/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/mix006_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 05:10:21,721 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 05:10:21,723 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 05:10:21,735 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 05:10:21,736 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 05:10:21,737 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 05:10:21,738 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 05:10:21,740 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 05:10:21,742 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 05:10:21,742 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 05:10:21,743 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 05:10:21,745 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 05:10:21,745 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 05:10:21,746 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 05:10:21,747 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 05:10:21,748 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 05:10:21,749 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 05:10:21,749 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 05:10:21,753 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 05:10:21,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 05:10:21,760 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 05:10:21,762 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 05:10:21,763 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 05:10:21,767 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 05:10:21,771 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 05:10:21,771 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 05:10:21,771 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 05:10:21,772 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 05:10:21,773 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 05:10:21,774 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 05:10:21,774 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 05:10:21,775 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 05:10:21,778 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 05:10:21,779 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 05:10:21,782 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 05:10:21,782 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 05:10:21,783 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 05:10:21,783 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 05:10:21,783 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 05:10:21,785 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 05:10:21,787 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 05:10:21,788 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 05:10:21,810 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 05:10:21,810 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 05:10:21,812 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 05:10:21,812 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 05:10:21,813 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 05:10:21,813 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 05:10:21,813 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 05:10:21,813 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 05:10:21,813 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 05:10:21,814 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 05:10:21,815 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 05:10:21,815 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 05:10:21,815 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 05:10:21,815 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 05:10:21,816 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 05:10:21,816 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 05:10:21,816 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 05:10:21,816 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 05:10:21,816 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 05:10:21,817 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 05:10:21,817 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 05:10:21,817 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:10:21,817 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 05:10:21,817 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 05:10:21,818 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 05:10:21,818 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 05:10:21,818 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 05:10:21,818 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 05:10:21,818 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 05:10:21,819 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 05:10:22,113 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 05:10:22,137 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 05:10:22,140 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 05:10:22,142 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 05:10:22,142 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 05:10:22,143 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix006_power.oepc.i [2019-12-27 05:10:22,216 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c462ebf4d/001d3498e588496ba9f9ecd9d8802298/FLAG0f20cbb90 [2019-12-27 05:10:22,803 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 05:10:22,804 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix006_power.oepc.i [2019-12-27 05:10:22,830 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c462ebf4d/001d3498e588496ba9f9ecd9d8802298/FLAG0f20cbb90 [2019-12-27 05:10:23,026 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c462ebf4d/001d3498e588496ba9f9ecd9d8802298 [2019-12-27 05:10:23,037 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 05:10:23,039 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 05:10:23,040 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 05:10:23,040 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 05:10:23,044 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 05:10:23,045 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:10:23" (1/1) ... [2019-12-27 05:10:23,048 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@679bb618 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:10:23, skipping insertion in model container [2019-12-27 05:10:23,048 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:10:23" (1/1) ... [2019-12-27 05:10:23,056 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 05:10:23,097 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 05:10:23,591 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:10:23,604 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 05:10:23,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 05:10:23,754 INFO L208 MainTranslator]: Completed translation [2019-12-27 05:10:23,755 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:10:23 WrapperNode [2019-12-27 05:10:23,755 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 05:10:23,756 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 05:10:23,756 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 05:10:23,756 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 05:10:23,765 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:10:23" (1/1) ... [2019-12-27 05:10:23,793 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:10:23" (1/1) ... [2019-12-27 05:10:23,835 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 05:10:23,836 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 05:10:23,836 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 05:10:23,836 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 05:10:23,847 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:10:23" (1/1) ... [2019-12-27 05:10:23,847 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:10:23" (1/1) ... [2019-12-27 05:10:23,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:10:23" (1/1) ... [2019-12-27 05:10:23,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:10:23" (1/1) ... [2019-12-27 05:10:23,869 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:10:23" (1/1) ... [2019-12-27 05:10:23,873 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:10:23" (1/1) ... [2019-12-27 05:10:23,877 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:10:23" (1/1) ... [2019-12-27 05:10:23,883 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 05:10:23,883 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 05:10:23,883 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 05:10:23,883 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 05:10:23,884 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:10:23" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 05:10:23,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 05:10:23,953 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 05:10:23,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 05:10:23,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 05:10:23,954 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 05:10:23,954 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 05:10:23,954 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 05:10:23,954 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 05:10:23,955 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 05:10:23,955 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 05:10:23,955 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 05:10:23,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 05:10:23,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 05:10:23,958 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 05:10:24,716 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 05:10:24,717 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 05:10:24,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:10:24 BoogieIcfgContainer [2019-12-27 05:10:24,719 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 05:10:24,720 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 05:10:24,720 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 05:10:24,723 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 05:10:24,724 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:10:23" (1/3) ... [2019-12-27 05:10:24,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa4aa85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:10:24, skipping insertion in model container [2019-12-27 05:10:24,725 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:10:23" (2/3) ... [2019-12-27 05:10:24,725 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fa4aa85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:10:24, skipping insertion in model container [2019-12-27 05:10:24,726 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:10:24" (3/3) ... [2019-12-27 05:10:24,727 INFO L109 eAbstractionObserver]: Analyzing ICFG mix006_power.oepc.i [2019-12-27 05:10:24,739 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 05:10:24,739 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 05:10:24,747 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 05:10:24,748 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 05:10:24,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,797 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,797 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,798 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,798 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,798 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,800 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,800 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,800 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,801 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,802 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,803 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,804 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,805 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,806 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,807 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,808 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,808 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,808 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,809 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,810 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,811 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,812 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,813 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,814 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,815 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,816 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,817 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,817 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,817 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,818 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,838 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,839 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,847 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,848 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,849 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,850 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,851 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,852 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,853 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,854 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,855 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,856 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,857 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,858 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,859 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,860 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,863 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,864 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,865 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,865 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,866 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,866 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,867 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,868 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,869 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,872 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,873 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,874 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,874 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,874 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,874 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,880 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,880 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,880 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,881 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,882 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 05:10:24,899 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 05:10:24,923 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 05:10:24,923 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 05:10:24,923 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 05:10:24,924 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-27 05:10:24,924 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 05:10:24,924 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 05:10:24,924 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 05:10:24,924 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 05:10:24,951 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 05:10:24,953 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 05:10:25,073 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 05:10:25,073 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:10:25,093 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:10:25,115 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 05:10:25,173 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 05:10:25,174 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 05:10:25,182 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 436 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 05:10:25,204 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 05:10:25,205 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 05:10:28,811 WARN L192 SmtUtils]: Spent 256.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 05:10:28,958 WARN L192 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 05:10:29,007 INFO L206 etLargeBlockEncoding]: Checked pairs total: 82443 [2019-12-27 05:10:29,007 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 05:10:29,012 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 105 transitions [2019-12-27 05:10:50,845 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 120992 states. [2019-12-27 05:10:50,847 INFO L276 IsEmpty]: Start isEmpty. Operand 120992 states. [2019-12-27 05:10:50,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 05:10:50,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:10:50,854 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 05:10:50,854 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:10:50,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:10:50,860 INFO L82 PathProgramCache]: Analyzing trace with hash 913992, now seen corresponding path program 1 times [2019-12-27 05:10:50,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:10:50,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330737065] [2019-12-27 05:10:50,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:10:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:10:51,169 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 05:10:51,170 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330737065] [2019-12-27 05:10:51,171 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:10:51,171 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:10:51,172 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [884909163] [2019-12-27 05:10:51,178 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:10:51,179 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:10:51,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:10:51,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:10:51,197 INFO L87 Difference]: Start difference. First operand 120992 states. Second operand 3 states. [2019-12-27 05:10:52,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:10:52,687 INFO L93 Difference]: Finished difference Result 119518 states and 508908 transitions. [2019-12-27 05:10:52,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:10:52,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 05:10:52,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:10:56,714 INFO L225 Difference]: With dead ends: 119518 [2019-12-27 05:10:56,714 INFO L226 Difference]: Without dead ends: 112056 [2019-12-27 05:10:56,716 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 05:11:01,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112056 states. [2019-12-27 05:11:03,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112056 to 112056. [2019-12-27 05:11:03,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112056 states. [2019-12-27 05:11:04,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112056 states to 112056 states and 476484 transitions. [2019-12-27 05:11:04,310 INFO L78 Accepts]: Start accepts. Automaton has 112056 states and 476484 transitions. Word has length 3 [2019-12-27 05:11:04,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:04,310 INFO L462 AbstractCegarLoop]: Abstraction has 112056 states and 476484 transitions. [2019-12-27 05:11:04,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:11:04,310 INFO L276 IsEmpty]: Start isEmpty. Operand 112056 states and 476484 transitions. [2019-12-27 05:11:04,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 05:11:04,313 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:04,313 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:11:04,314 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:04,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:04,314 INFO L82 PathProgramCache]: Analyzing trace with hash -224245043, now seen corresponding path program 1 times [2019-12-27 05:11:04,314 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:04,315 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117766143] [2019-12-27 05:11:04,315 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:04,441 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 05:11:04,441 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117766143] [2019-12-27 05:11:04,442 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:04,442 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:11:04,443 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [826521115] [2019-12-27 05:11:04,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:11:04,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:04,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:11:04,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:11:04,445 INFO L87 Difference]: Start difference. First operand 112056 states and 476484 transitions. Second operand 4 states. [2019-12-27 05:11:09,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:09,847 INFO L93 Difference]: Finished difference Result 173434 states and 704626 transitions. [2019-12-27 05:11:09,847 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:11:09,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 05:11:09,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:10,439 INFO L225 Difference]: With dead ends: 173434 [2019-12-27 05:11:10,439 INFO L226 Difference]: Without dead ends: 173385 [2019-12-27 05:11:10,440 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:11:19,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173385 states. [2019-12-27 05:11:22,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173385 to 158867. [2019-12-27 05:11:22,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158867 states. [2019-12-27 05:11:23,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158867 states to 158867 states and 654272 transitions. [2019-12-27 05:11:23,212 INFO L78 Accepts]: Start accepts. Automaton has 158867 states and 654272 transitions. Word has length 11 [2019-12-27 05:11:23,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:23,213 INFO L462 AbstractCegarLoop]: Abstraction has 158867 states and 654272 transitions. [2019-12-27 05:11:23,213 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:11:23,213 INFO L276 IsEmpty]: Start isEmpty. Operand 158867 states and 654272 transitions. [2019-12-27 05:11:23,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 05:11:23,221 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:23,221 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:11:23,221 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:23,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:23,222 INFO L82 PathProgramCache]: Analyzing trace with hash 703391521, now seen corresponding path program 1 times [2019-12-27 05:11:23,222 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:23,222 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866258708] [2019-12-27 05:11:23,223 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:23,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:23,276 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 05:11:23,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866258708] [2019-12-27 05:11:23,277 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:23,277 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:11:23,277 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217847184] [2019-12-27 05:11:23,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:11:23,278 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:23,278 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:11:23,278 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:11:23,279 INFO L87 Difference]: Start difference. First operand 158867 states and 654272 transitions. Second operand 3 states. [2019-12-27 05:11:23,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:23,425 INFO L93 Difference]: Finished difference Result 34345 states and 110990 transitions. [2019-12-27 05:11:23,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:11:23,425 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 05:11:23,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:23,521 INFO L225 Difference]: With dead ends: 34345 [2019-12-27 05:11:23,521 INFO L226 Difference]: Without dead ends: 34345 [2019-12-27 05:11:23,522 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 05:11:28,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34345 states. [2019-12-27 05:11:29,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34345 to 34345. [2019-12-27 05:11:29,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34345 states. [2019-12-27 05:11:29,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34345 states to 34345 states and 110990 transitions. [2019-12-27 05:11:29,137 INFO L78 Accepts]: Start accepts. Automaton has 34345 states and 110990 transitions. Word has length 13 [2019-12-27 05:11:29,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:29,137 INFO L462 AbstractCegarLoop]: Abstraction has 34345 states and 110990 transitions. [2019-12-27 05:11:29,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:11:29,138 INFO L276 IsEmpty]: Start isEmpty. Operand 34345 states and 110990 transitions. [2019-12-27 05:11:29,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 05:11:29,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:29,140 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:11:29,141 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:29,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:29,141 INFO L82 PathProgramCache]: Analyzing trace with hash -1949648440, now seen corresponding path program 1 times [2019-12-27 05:11:29,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:29,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [167386426] [2019-12-27 05:11:29,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:29,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:29,237 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 05:11:29,237 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [167386426] [2019-12-27 05:11:29,237 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:29,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:11:29,238 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1256468644] [2019-12-27 05:11:29,238 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:11:29,238 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:29,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:11:29,239 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:11:29,239 INFO L87 Difference]: Start difference. First operand 34345 states and 110990 transitions. Second operand 4 states. [2019-12-27 05:11:29,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:29,637 INFO L93 Difference]: Finished difference Result 41968 states and 135253 transitions. [2019-12-27 05:11:29,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:11:29,637 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 05:11:29,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:29,707 INFO L225 Difference]: With dead ends: 41968 [2019-12-27 05:11:29,707 INFO L226 Difference]: Without dead ends: 41968 [2019-12-27 05:11:29,708 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 05:11:29,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41968 states. [2019-12-27 05:11:30,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41968 to 37815. [2019-12-27 05:11:30,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37815 states. [2019-12-27 05:11:30,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37815 states to 37815 states and 122278 transitions. [2019-12-27 05:11:30,434 INFO L78 Accepts]: Start accepts. Automaton has 37815 states and 122278 transitions. Word has length 16 [2019-12-27 05:11:30,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:30,436 INFO L462 AbstractCegarLoop]: Abstraction has 37815 states and 122278 transitions. [2019-12-27 05:11:30,436 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:11:30,436 INFO L276 IsEmpty]: Start isEmpty. Operand 37815 states and 122278 transitions. [2019-12-27 05:11:30,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 05:11:30,444 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:30,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:11:30,445 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:30,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:30,445 INFO L82 PathProgramCache]: Analyzing trace with hash -1390855021, now seen corresponding path program 1 times [2019-12-27 05:11:30,446 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:30,446 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325317865] [2019-12-27 05:11:30,446 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:30,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:30,544 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 05:11:30,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325317865] [2019-12-27 05:11:30,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:30,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:11:30,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [530620679] [2019-12-27 05:11:30,547 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:11:30,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:30,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:11:30,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:11:30,548 INFO L87 Difference]: Start difference. First operand 37815 states and 122278 transitions. Second operand 5 states. [2019-12-27 05:11:31,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:31,210 INFO L93 Difference]: Finished difference Result 48568 states and 154032 transitions. [2019-12-27 05:11:31,211 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:11:31,211 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2019-12-27 05:11:31,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:31,291 INFO L225 Difference]: With dead ends: 48568 [2019-12-27 05:11:31,291 INFO L226 Difference]: Without dead ends: 48561 [2019-12-27 05:11:31,291 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:11:32,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48561 states. [2019-12-27 05:11:32,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48561 to 37245. [2019-12-27 05:11:32,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37245 states. [2019-12-27 05:11:32,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37245 states to 37245 states and 120198 transitions. [2019-12-27 05:11:32,492 INFO L78 Accepts]: Start accepts. Automaton has 37245 states and 120198 transitions. Word has length 22 [2019-12-27 05:11:32,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:32,492 INFO L462 AbstractCegarLoop]: Abstraction has 37245 states and 120198 transitions. [2019-12-27 05:11:32,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:11:32,493 INFO L276 IsEmpty]: Start isEmpty. Operand 37245 states and 120198 transitions. [2019-12-27 05:11:32,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 05:11:32,504 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:32,504 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 05:11:32,505 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:32,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:32,505 INFO L82 PathProgramCache]: Analyzing trace with hash 896315521, now seen corresponding path program 1 times [2019-12-27 05:11:32,505 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:32,506 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [466698721] [2019-12-27 05:11:32,506 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:32,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:32,568 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 05:11:32,568 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [466698721] [2019-12-27 05:11:32,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:32,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:11:32,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430211405] [2019-12-27 05:11:32,569 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 05:11:32,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:32,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 05:11:32,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 05:11:32,570 INFO L87 Difference]: Start difference. First operand 37245 states and 120198 transitions. Second operand 4 states. [2019-12-27 05:11:32,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:32,640 INFO L93 Difference]: Finished difference Result 14946 states and 45537 transitions. [2019-12-27 05:11:32,640 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 05:11:32,640 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 05:11:32,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:32,661 INFO L225 Difference]: With dead ends: 14946 [2019-12-27 05:11:32,661 INFO L226 Difference]: Without dead ends: 14946 [2019-12-27 05:11:32,662 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 05:11:32,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14946 states. [2019-12-27 05:11:32,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14946 to 14702. [2019-12-27 05:11:32,868 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14702 states. [2019-12-27 05:11:32,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14702 states to 14702 states and 44841 transitions. [2019-12-27 05:11:32,893 INFO L78 Accepts]: Start accepts. Automaton has 14702 states and 44841 transitions. Word has length 25 [2019-12-27 05:11:32,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:32,894 INFO L462 AbstractCegarLoop]: Abstraction has 14702 states and 44841 transitions. [2019-12-27 05:11:32,894 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 05:11:32,894 INFO L276 IsEmpty]: Start isEmpty. Operand 14702 states and 44841 transitions. [2019-12-27 05:11:32,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:11:32,904 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:32,904 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] [2019-12-27 05:11:32,904 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:32,905 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:32,905 INFO L82 PathProgramCache]: Analyzing trace with hash 1170080207, now seen corresponding path program 1 times [2019-12-27 05:11:32,905 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:32,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390246473] [2019-12-27 05:11:32,909 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:32,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:32,961 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 05:11:32,962 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390246473] [2019-12-27 05:11:32,962 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:32,962 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 05:11:32,962 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193215248] [2019-12-27 05:11:32,963 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:11:32,963 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:32,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:11:32,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:11:32,964 INFO L87 Difference]: Start difference. First operand 14702 states and 44841 transitions. Second operand 3 states. [2019-12-27 05:11:33,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:33,074 INFO L93 Difference]: Finished difference Result 21048 states and 63094 transitions. [2019-12-27 05:11:33,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:11:33,075 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 05:11:33,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:33,104 INFO L225 Difference]: With dead ends: 21048 [2019-12-27 05:11:33,105 INFO L226 Difference]: Without dead ends: 21048 [2019-12-27 05:11:33,105 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 05:11:33,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21048 states. [2019-12-27 05:11:33,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21048 to 15496. [2019-12-27 05:11:33,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15496 states. [2019-12-27 05:11:33,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15496 states to 15496 states and 47121 transitions. [2019-12-27 05:11:33,388 INFO L78 Accepts]: Start accepts. Automaton has 15496 states and 47121 transitions. Word has length 27 [2019-12-27 05:11:33,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:33,388 INFO L462 AbstractCegarLoop]: Abstraction has 15496 states and 47121 transitions. [2019-12-27 05:11:33,389 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:11:33,389 INFO L276 IsEmpty]: Start isEmpty. Operand 15496 states and 47121 transitions. [2019-12-27 05:11:33,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 05:11:33,402 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:33,403 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] [2019-12-27 05:11:33,403 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:33,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:33,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1291585692, now seen corresponding path program 1 times [2019-12-27 05:11:33,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:33,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2054922860] [2019-12-27 05:11:33,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:33,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:33,537 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 05:11:33,537 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2054922860] [2019-12-27 05:11:33,538 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:33,538 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:11:33,538 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606422843] [2019-12-27 05:11:33,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:11:33,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:33,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:11:33,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:11:33,539 INFO L87 Difference]: Start difference. First operand 15496 states and 47121 transitions. Second operand 6 states. [2019-12-27 05:11:34,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:34,383 INFO L93 Difference]: Finished difference Result 39367 states and 118228 transitions. [2019-12-27 05:11:34,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:11:34,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 05:11:34,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:34,449 INFO L225 Difference]: With dead ends: 39367 [2019-12-27 05:11:34,449 INFO L226 Difference]: Without dead ends: 39367 [2019-12-27 05:11:34,449 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-27 05:11:34,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39367 states. [2019-12-27 05:11:35,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39367 to 22126. [2019-12-27 05:11:35,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22126 states. [2019-12-27 05:11:35,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22126 states to 22126 states and 68213 transitions. [2019-12-27 05:11:35,253 INFO L78 Accepts]: Start accepts. Automaton has 22126 states and 68213 transitions. Word has length 27 [2019-12-27 05:11:35,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:35,254 INFO L462 AbstractCegarLoop]: Abstraction has 22126 states and 68213 transitions. [2019-12-27 05:11:35,254 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:11:35,254 INFO L276 IsEmpty]: Start isEmpty. Operand 22126 states and 68213 transitions. [2019-12-27 05:11:35,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 05:11:35,269 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:35,269 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:11:35,269 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:35,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:35,270 INFO L82 PathProgramCache]: Analyzing trace with hash 859272137, now seen corresponding path program 1 times [2019-12-27 05:11:35,270 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:35,270 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187986177] [2019-12-27 05:11:35,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:35,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:35,354 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 05:11:35,354 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187986177] [2019-12-27 05:11:35,355 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:35,355 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:11:35,355 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064750437] [2019-12-27 05:11:35,355 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:11:35,356 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:35,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:11:35,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:11:35,356 INFO L87 Difference]: Start difference. First operand 22126 states and 68213 transitions. Second operand 5 states. [2019-12-27 05:11:35,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:35,483 INFO L93 Difference]: Finished difference Result 23167 states and 69730 transitions. [2019-12-27 05:11:35,483 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:11:35,483 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-27 05:11:35,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:35,515 INFO L225 Difference]: With dead ends: 23167 [2019-12-27 05:11:35,515 INFO L226 Difference]: Without dead ends: 23167 [2019-12-27 05:11:35,516 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:11:35,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23167 states. [2019-12-27 05:11:35,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23167 to 20260. [2019-12-27 05:11:35,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20260 states. [2019-12-27 05:11:35,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20260 states to 20260 states and 60630 transitions. [2019-12-27 05:11:35,840 INFO L78 Accepts]: Start accepts. Automaton has 20260 states and 60630 transitions. Word has length 28 [2019-12-27 05:11:35,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:35,840 INFO L462 AbstractCegarLoop]: Abstraction has 20260 states and 60630 transitions. [2019-12-27 05:11:35,840 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:11:35,840 INFO L276 IsEmpty]: Start isEmpty. Operand 20260 states and 60630 transitions. [2019-12-27 05:11:35,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-27 05:11:35,857 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:35,857 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] [2019-12-27 05:11:35,857 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:35,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:35,858 INFO L82 PathProgramCache]: Analyzing trace with hash 1081604050, now seen corresponding path program 1 times [2019-12-27 05:11:35,858 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:35,858 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248292882] [2019-12-27 05:11:35,858 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:35,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:36,005 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 05:11:36,005 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248292882] [2019-12-27 05:11:36,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:36,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:11:36,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545127087] [2019-12-27 05:11:36,006 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:11:36,006 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:36,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:11:36,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:11:36,007 INFO L87 Difference]: Start difference. First operand 20260 states and 60630 transitions. Second operand 6 states. [2019-12-27 05:11:36,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:36,732 INFO L93 Difference]: Finished difference Result 30853 states and 90758 transitions. [2019-12-27 05:11:36,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 05:11:36,733 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-27 05:11:36,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:36,774 INFO L225 Difference]: With dead ends: 30853 [2019-12-27 05:11:36,774 INFO L226 Difference]: Without dead ends: 30853 [2019-12-27 05:11:36,775 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:11:36,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30853 states. [2019-12-27 05:11:37,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30853 to 20012. [2019-12-27 05:11:37,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20012 states. [2019-12-27 05:11:37,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20012 states to 20012 states and 59937 transitions. [2019-12-27 05:11:37,171 INFO L78 Accepts]: Start accepts. Automaton has 20012 states and 59937 transitions. Word has length 29 [2019-12-27 05:11:37,171 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:37,171 INFO L462 AbstractCegarLoop]: Abstraction has 20012 states and 59937 transitions. [2019-12-27 05:11:37,171 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:11:37,171 INFO L276 IsEmpty]: Start isEmpty. Operand 20012 states and 59937 transitions. [2019-12-27 05:11:37,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:11:37,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:37,190 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] [2019-12-27 05:11:37,191 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:37,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:37,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1529980999, now seen corresponding path program 1 times [2019-12-27 05:11:37,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:37,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527175918] [2019-12-27 05:11:37,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:37,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:37,331 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 05:11:37,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527175918] [2019-12-27 05:11:37,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:37,332 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:11:37,332 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096972501] [2019-12-27 05:11:37,332 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:11:37,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:37,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:11:37,333 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:11:37,333 INFO L87 Difference]: Start difference. First operand 20012 states and 59937 transitions. Second operand 7 states. [2019-12-27 05:11:38,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:38,796 INFO L93 Difference]: Finished difference Result 40608 states and 118859 transitions. [2019-12-27 05:11:38,797 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 05:11:38,797 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-27 05:11:38,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:38,887 INFO L225 Difference]: With dead ends: 40608 [2019-12-27 05:11:38,888 INFO L226 Difference]: Without dead ends: 40608 [2019-12-27 05:11:38,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-27 05:11:39,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40608 states. [2019-12-27 05:11:39,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40608 to 22178. [2019-12-27 05:11:39,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22178 states. [2019-12-27 05:11:39,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22178 states to 22178 states and 66331 transitions. [2019-12-27 05:11:39,478 INFO L78 Accepts]: Start accepts. Automaton has 22178 states and 66331 transitions. Word has length 33 [2019-12-27 05:11:39,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:39,478 INFO L462 AbstractCegarLoop]: Abstraction has 22178 states and 66331 transitions. [2019-12-27 05:11:39,478 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:11:39,478 INFO L276 IsEmpty]: Start isEmpty. Operand 22178 states and 66331 transitions. [2019-12-27 05:11:39,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 05:11:39,501 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:39,502 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] [2019-12-27 05:11:39,502 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:39,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:39,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1030046023, now seen corresponding path program 2 times [2019-12-27 05:11:39,502 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:39,503 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417172705] [2019-12-27 05:11:39,503 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:39,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:40,039 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 05:11:40,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417172705] [2019-12-27 05:11:40,040 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:40,040 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:11:40,040 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1003520570] [2019-12-27 05:11:40,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:11:40,041 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:40,041 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:11:40,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:11:40,042 INFO L87 Difference]: Start difference. First operand 22178 states and 66331 transitions. Second operand 9 states. [2019-12-27 05:11:42,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:42,529 INFO L93 Difference]: Finished difference Result 51880 states and 151963 transitions. [2019-12-27 05:11:42,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-27 05:11:42,529 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 05:11:42,530 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:42,607 INFO L225 Difference]: With dead ends: 51880 [2019-12-27 05:11:42,607 INFO L226 Difference]: Without dead ends: 51880 [2019-12-27 05:11:42,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 0 SyntacticMatches, 2 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 256 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=216, Invalid=776, Unknown=0, NotChecked=0, Total=992 [2019-12-27 05:11:42,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51880 states. [2019-12-27 05:11:43,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51880 to 22208. [2019-12-27 05:11:43,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22208 states. [2019-12-27 05:11:43,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22208 states to 22208 states and 66442 transitions. [2019-12-27 05:11:43,158 INFO L78 Accepts]: Start accepts. Automaton has 22208 states and 66442 transitions. Word has length 33 [2019-12-27 05:11:43,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:43,159 INFO L462 AbstractCegarLoop]: Abstraction has 22208 states and 66442 transitions. [2019-12-27 05:11:43,159 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:11:43,159 INFO L276 IsEmpty]: Start isEmpty. Operand 22208 states and 66442 transitions. [2019-12-27 05:11:43,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 05:11:43,176 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:43,177 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] [2019-12-27 05:11:43,177 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:43,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:43,177 INFO L82 PathProgramCache]: Analyzing trace with hash -383019289, now seen corresponding path program 1 times [2019-12-27 05:11:43,178 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:43,178 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500287153] [2019-12-27 05:11:43,178 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:43,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:43,299 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 05:11:43,299 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500287153] [2019-12-27 05:11:43,299 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:43,299 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:11:43,300 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897874258] [2019-12-27 05:11:43,300 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:11:43,300 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:43,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:11:43,301 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:11:43,301 INFO L87 Difference]: Start difference. First operand 22208 states and 66442 transitions. Second operand 7 states. [2019-12-27 05:11:44,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:44,570 INFO L93 Difference]: Finished difference Result 38204 states and 111558 transitions. [2019-12-27 05:11:44,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 05:11:44,571 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 35 [2019-12-27 05:11:44,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:44,625 INFO L225 Difference]: With dead ends: 38204 [2019-12-27 05:11:44,625 INFO L226 Difference]: Without dead ends: 38204 [2019-12-27 05:11:44,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=89, Invalid=253, Unknown=0, NotChecked=0, Total=342 [2019-12-27 05:11:44,752 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38204 states. [2019-12-27 05:11:45,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38204 to 21469. [2019-12-27 05:11:45,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21469 states. [2019-12-27 05:11:45,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21469 states to 21469 states and 64258 transitions. [2019-12-27 05:11:45,088 INFO L78 Accepts]: Start accepts. Automaton has 21469 states and 64258 transitions. Word has length 35 [2019-12-27 05:11:45,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:45,088 INFO L462 AbstractCegarLoop]: Abstraction has 21469 states and 64258 transitions. [2019-12-27 05:11:45,088 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:11:45,088 INFO L276 IsEmpty]: Start isEmpty. Operand 21469 states and 64258 transitions. [2019-12-27 05:11:45,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-27 05:11:45,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:45,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] [2019-12-27 05:11:45,106 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:45,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:45,107 INFO L82 PathProgramCache]: Analyzing trace with hash 866606587, now seen corresponding path program 2 times [2019-12-27 05:11:45,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:45,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795311509] [2019-12-27 05:11:45,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:45,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:45,239 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 05:11:45,240 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795311509] [2019-12-27 05:11:45,240 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:45,240 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:11:45,240 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373989456] [2019-12-27 05:11:45,241 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:11:45,241 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:45,241 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:11:45,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:11:45,242 INFO L87 Difference]: Start difference. First operand 21469 states and 64258 transitions. Second operand 8 states. [2019-12-27 05:11:47,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:47,331 INFO L93 Difference]: Finished difference Result 42927 states and 124251 transitions. [2019-12-27 05:11:47,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2019-12-27 05:11:47,331 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 35 [2019-12-27 05:11:47,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:47,390 INFO L225 Difference]: With dead ends: 42927 [2019-12-27 05:11:47,391 INFO L226 Difference]: Without dead ends: 42927 [2019-12-27 05:11:47,391 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 149 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=161, Invalid=489, Unknown=0, NotChecked=0, Total=650 [2019-12-27 05:11:47,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42927 states. [2019-12-27 05:11:47,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42927 to 20077. [2019-12-27 05:11:47,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20077 states. [2019-12-27 05:11:47,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20077 states to 20077 states and 60280 transitions. [2019-12-27 05:11:47,879 INFO L78 Accepts]: Start accepts. Automaton has 20077 states and 60280 transitions. Word has length 35 [2019-12-27 05:11:47,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:47,879 INFO L462 AbstractCegarLoop]: Abstraction has 20077 states and 60280 transitions. [2019-12-27 05:11:47,879 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:11:47,879 INFO L276 IsEmpty]: Start isEmpty. Operand 20077 states and 60280 transitions. [2019-12-27 05:11:47,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-27 05:11:47,907 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:47,907 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] [2019-12-27 05:11:47,907 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:47,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:47,907 INFO L82 PathProgramCache]: Analyzing trace with hash -587405115, now seen corresponding path program 1 times [2019-12-27 05:11:47,908 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:47,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989876944] [2019-12-27 05:11:47,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:47,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:48,065 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 05:11:48,066 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989876944] [2019-12-27 05:11:48,066 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:48,066 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:11:48,067 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806386245] [2019-12-27 05:11:48,067 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:11:48,067 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:48,067 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:11:48,067 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:11:48,068 INFO L87 Difference]: Start difference. First operand 20077 states and 60280 transitions. Second operand 7 states. [2019-12-27 05:11:49,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:49,392 INFO L93 Difference]: Finished difference Result 46268 states and 134818 transitions. [2019-12-27 05:11:49,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 05:11:49,392 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 37 [2019-12-27 05:11:49,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:49,457 INFO L225 Difference]: With dead ends: 46268 [2019-12-27 05:11:49,458 INFO L226 Difference]: Without dead ends: 46268 [2019-12-27 05:11:49,458 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-27 05:11:49,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46268 states. [2019-12-27 05:11:49,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46268 to 19035. [2019-12-27 05:11:49,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19035 states. [2019-12-27 05:11:49,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19035 states to 19035 states and 57142 transitions. [2019-12-27 05:11:49,944 INFO L78 Accepts]: Start accepts. Automaton has 19035 states and 57142 transitions. Word has length 37 [2019-12-27 05:11:49,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:49,944 INFO L462 AbstractCegarLoop]: Abstraction has 19035 states and 57142 transitions. [2019-12-27 05:11:49,944 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:11:49,944 INFO L276 IsEmpty]: Start isEmpty. Operand 19035 states and 57142 transitions. [2019-12-27 05:11:49,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:11:49,968 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:49,969 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] [2019-12-27 05:11:49,969 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:49,969 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:49,969 INFO L82 PathProgramCache]: Analyzing trace with hash 1833609665, now seen corresponding path program 1 times [2019-12-27 05:11:49,969 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:49,970 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674777609] [2019-12-27 05:11:49,970 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:49,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:50,029 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 05:11:50,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674777609] [2019-12-27 05:11:50,030 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:50,030 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:11:50,030 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380198134] [2019-12-27 05:11:50,031 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:11:50,031 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:50,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:11:50,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:11:50,031 INFO L87 Difference]: Start difference. First operand 19035 states and 57142 transitions. Second operand 3 states. [2019-12-27 05:11:50,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:50,160 INFO L93 Difference]: Finished difference Result 32191 states and 96988 transitions. [2019-12-27 05:11:50,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:11:50,161 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 05:11:50,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:50,194 INFO L225 Difference]: With dead ends: 32191 [2019-12-27 05:11:50,194 INFO L226 Difference]: Without dead ends: 16567 [2019-12-27 05:11:50,195 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 05:11:50,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16567 states. [2019-12-27 05:11:50,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16567 to 16488. [2019-12-27 05:11:50,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16488 states. [2019-12-27 05:11:50,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16488 states to 16488 states and 48648 transitions. [2019-12-27 05:11:50,698 INFO L78 Accepts]: Start accepts. Automaton has 16488 states and 48648 transitions. Word has length 39 [2019-12-27 05:11:50,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:50,699 INFO L462 AbstractCegarLoop]: Abstraction has 16488 states and 48648 transitions. [2019-12-27 05:11:50,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:11:50,699 INFO L276 IsEmpty]: Start isEmpty. Operand 16488 states and 48648 transitions. [2019-12-27 05:11:50,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 05:11:50,727 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:50,728 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] [2019-12-27 05:11:50,728 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:50,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:50,728 INFO L82 PathProgramCache]: Analyzing trace with hash -584791835, now seen corresponding path program 2 times [2019-12-27 05:11:50,729 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:50,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [279627414] [2019-12-27 05:11:50,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:50,795 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 05:11:50,795 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [279627414] [2019-12-27 05:11:50,796 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:50,796 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 05:11:50,796 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521196429] [2019-12-27 05:11:50,797 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:11:50,797 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:50,798 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:11:50,798 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:11:50,798 INFO L87 Difference]: Start difference. First operand 16488 states and 48648 transitions. Second operand 3 states. [2019-12-27 05:11:50,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:50,892 INFO L93 Difference]: Finished difference Result 16487 states and 48646 transitions. [2019-12-27 05:11:50,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:11:50,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 05:11:50,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:50,928 INFO L225 Difference]: With dead ends: 16487 [2019-12-27 05:11:50,929 INFO L226 Difference]: Without dead ends: 16487 [2019-12-27 05:11:50,930 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 05:11:51,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16487 states. [2019-12-27 05:11:51,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16487 to 16487. [2019-12-27 05:11:51,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16487 states. [2019-12-27 05:11:51,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16487 states to 16487 states and 48646 transitions. [2019-12-27 05:11:51,581 INFO L78 Accepts]: Start accepts. Automaton has 16487 states and 48646 transitions. Word has length 39 [2019-12-27 05:11:51,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:51,581 INFO L462 AbstractCegarLoop]: Abstraction has 16487 states and 48646 transitions. [2019-12-27 05:11:51,581 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:11:51,581 INFO L276 IsEmpty]: Start isEmpty. Operand 16487 states and 48646 transitions. [2019-12-27 05:11:51,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:11:51,598 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:51,598 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:11:51,598 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:51,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:51,598 INFO L82 PathProgramCache]: Analyzing trace with hash 529682792, now seen corresponding path program 1 times [2019-12-27 05:11:51,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:51,599 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877918637] [2019-12-27 05:11:51,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:51,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:51,663 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 05:11:51,664 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877918637] [2019-12-27 05:11:51,664 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:51,664 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 05:11:51,664 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312073989] [2019-12-27 05:11:51,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:11:51,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:51,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:11:51,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:11:51,665 INFO L87 Difference]: Start difference. First operand 16487 states and 48646 transitions. Second operand 5 states. [2019-12-27 05:11:52,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:52,316 INFO L93 Difference]: Finished difference Result 23933 states and 69349 transitions. [2019-12-27 05:11:52,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 05:11:52,317 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 05:11:52,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:52,349 INFO L225 Difference]: With dead ends: 23933 [2019-12-27 05:11:52,350 INFO L226 Difference]: Without dead ends: 23933 [2019-12-27 05:11:52,350 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 2 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 05:11:52,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23933 states. [2019-12-27 05:11:52,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23933 to 21429. [2019-12-27 05:11:52,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21429 states. [2019-12-27 05:11:52,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21429 states to 21429 states and 62865 transitions. [2019-12-27 05:11:52,705 INFO L78 Accepts]: Start accepts. Automaton has 21429 states and 62865 transitions. Word has length 40 [2019-12-27 05:11:52,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:52,705 INFO L462 AbstractCegarLoop]: Abstraction has 21429 states and 62865 transitions. [2019-12-27 05:11:52,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:11:52,706 INFO L276 IsEmpty]: Start isEmpty. Operand 21429 states and 62865 transitions. [2019-12-27 05:11:52,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:11:52,728 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:52,728 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:11:52,728 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:52,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:52,728 INFO L82 PathProgramCache]: Analyzing trace with hash -330359536, now seen corresponding path program 2 times [2019-12-27 05:11:52,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:52,729 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856867320] [2019-12-27 05:11:52,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:52,794 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 05:11:52,794 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856867320] [2019-12-27 05:11:52,794 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:52,795 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:11:52,795 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356027398] [2019-12-27 05:11:52,795 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 05:11:52,795 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:52,796 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 05:11:52,796 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 05:11:52,796 INFO L87 Difference]: Start difference. First operand 21429 states and 62865 transitions. Second operand 6 states. [2019-12-27 05:11:53,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:53,729 INFO L93 Difference]: Finished difference Result 35061 states and 102041 transitions. [2019-12-27 05:11:53,729 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 05:11:53,730 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 05:11:53,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:53,778 INFO L225 Difference]: With dead ends: 35061 [2019-12-27 05:11:53,778 INFO L226 Difference]: Without dead ends: 35061 [2019-12-27 05:11:53,778 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:11:53,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35061 states. [2019-12-27 05:11:54,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35061 to 25674. [2019-12-27 05:11:54,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25674 states. [2019-12-27 05:11:54,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25674 states to 25674 states and 75008 transitions. [2019-12-27 05:11:54,264 INFO L78 Accepts]: Start accepts. Automaton has 25674 states and 75008 transitions. Word has length 40 [2019-12-27 05:11:54,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:54,264 INFO L462 AbstractCegarLoop]: Abstraction has 25674 states and 75008 transitions. [2019-12-27 05:11:54,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 05:11:54,264 INFO L276 IsEmpty]: Start isEmpty. Operand 25674 states and 75008 transitions. [2019-12-27 05:11:54,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 05:11:54,289 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:54,289 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:11:54,289 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:54,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:54,290 INFO L82 PathProgramCache]: Analyzing trace with hash -457662442, now seen corresponding path program 3 times [2019-12-27 05:11:54,290 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:54,290 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823196009] [2019-12-27 05:11:54,290 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:54,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:54,330 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 05:11:54,331 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823196009] [2019-12-27 05:11:54,331 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:54,331 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 05:11:54,331 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [161453146] [2019-12-27 05:11:54,331 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 05:11:54,332 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:54,332 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 05:11:54,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:11:54,332 INFO L87 Difference]: Start difference. First operand 25674 states and 75008 transitions. Second operand 5 states. [2019-12-27 05:11:54,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:54,423 INFO L93 Difference]: Finished difference Result 24363 states and 72018 transitions. [2019-12-27 05:11:54,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 05:11:54,424 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 40 [2019-12-27 05:11:54,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:54,454 INFO L225 Difference]: With dead ends: 24363 [2019-12-27 05:11:54,454 INFO L226 Difference]: Without dead ends: 22296 [2019-12-27 05:11:54,454 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 05:11:54,543 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22296 states. [2019-12-27 05:11:54,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22296 to 20943. [2019-12-27 05:11:54,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20943 states. [2019-12-27 05:11:54,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20943 states to 20943 states and 63463 transitions. [2019-12-27 05:11:54,798 INFO L78 Accepts]: Start accepts. Automaton has 20943 states and 63463 transitions. Word has length 40 [2019-12-27 05:11:54,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:54,799 INFO L462 AbstractCegarLoop]: Abstraction has 20943 states and 63463 transitions. [2019-12-27 05:11:54,799 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 05:11:54,799 INFO L276 IsEmpty]: Start isEmpty. Operand 20943 states and 63463 transitions. [2019-12-27 05:11:54,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:11:54,820 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:54,820 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:11:54,820 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:54,820 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:54,820 INFO L82 PathProgramCache]: Analyzing trace with hash 1175417712, now seen corresponding path program 1 times [2019-12-27 05:11:54,821 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:54,821 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873961702] [2019-12-27 05:11:54,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:54,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:54,898 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 05:11:54,898 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873961702] [2019-12-27 05:11:54,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:54,899 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:11:54,899 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456082032] [2019-12-27 05:11:54,899 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:11:54,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:54,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:11:54,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:11:54,900 INFO L87 Difference]: Start difference. First operand 20943 states and 63463 transitions. Second operand 7 states. [2019-12-27 05:11:55,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:55,497 INFO L93 Difference]: Finished difference Result 57927 states and 174754 transitions. [2019-12-27 05:11:55,497 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 05:11:55,497 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 05:11:55,498 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:55,580 INFO L225 Difference]: With dead ends: 57927 [2019-12-27 05:11:55,580 INFO L226 Difference]: Without dead ends: 42266 [2019-12-27 05:11:55,583 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 05:11:55,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42266 states. [2019-12-27 05:11:56,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42266 to 23721. [2019-12-27 05:11:56,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23721 states. [2019-12-27 05:11:56,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23721 states to 23721 states and 71893 transitions. [2019-12-27 05:11:56,457 INFO L78 Accepts]: Start accepts. Automaton has 23721 states and 71893 transitions. Word has length 64 [2019-12-27 05:11:56,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:56,458 INFO L462 AbstractCegarLoop]: Abstraction has 23721 states and 71893 transitions. [2019-12-27 05:11:56,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:11:56,458 INFO L276 IsEmpty]: Start isEmpty. Operand 23721 states and 71893 transitions. [2019-12-27 05:11:56,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:11:56,485 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:56,485 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:11:56,485 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:56,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:56,486 INFO L82 PathProgramCache]: Analyzing trace with hash 369269380, now seen corresponding path program 2 times [2019-12-27 05:11:56,486 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:56,486 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [126961480] [2019-12-27 05:11:56,486 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:56,576 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 05:11:56,576 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [126961480] [2019-12-27 05:11:56,576 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:56,576 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:11:56,577 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467309138] [2019-12-27 05:11:56,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:11:56,577 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:56,577 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:11:56,577 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:11:56,578 INFO L87 Difference]: Start difference. First operand 23721 states and 71893 transitions. Second operand 8 states. [2019-12-27 05:11:57,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:11:57,891 INFO L93 Difference]: Finished difference Result 98880 states and 294903 transitions. [2019-12-27 05:11:57,891 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:11:57,891 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 05:11:57,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:11:57,993 INFO L225 Difference]: With dead ends: 98880 [2019-12-27 05:11:57,993 INFO L226 Difference]: Without dead ends: 68420 [2019-12-27 05:11:57,993 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=145, Invalid=455, Unknown=0, NotChecked=0, Total=600 [2019-12-27 05:11:58,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68420 states. [2019-12-27 05:11:58,754 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68420 to 27318. [2019-12-27 05:11:58,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27318 states. [2019-12-27 05:11:58,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27318 states to 27318 states and 82460 transitions. [2019-12-27 05:11:58,807 INFO L78 Accepts]: Start accepts. Automaton has 27318 states and 82460 transitions. Word has length 64 [2019-12-27 05:11:58,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:11:58,807 INFO L462 AbstractCegarLoop]: Abstraction has 27318 states and 82460 transitions. [2019-12-27 05:11:58,807 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:11:58,807 INFO L276 IsEmpty]: Start isEmpty. Operand 27318 states and 82460 transitions. [2019-12-27 05:11:58,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:11:58,839 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:11:58,839 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:11:58,839 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:11:58,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:11:58,840 INFO L82 PathProgramCache]: Analyzing trace with hash 592424618, now seen corresponding path program 3 times [2019-12-27 05:11:58,840 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:11:58,840 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234787865] [2019-12-27 05:11:58,840 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:11:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:11:58,956 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 05:11:58,957 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234787865] [2019-12-27 05:11:58,957 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:11:58,957 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:11:58,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2058859824] [2019-12-27 05:11:58,958 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:11:58,958 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:11:58,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:11:58,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:11:58,958 INFO L87 Difference]: Start difference. First operand 27318 states and 82460 transitions. Second operand 9 states. [2019-12-27 05:12:00,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:00,478 INFO L93 Difference]: Finished difference Result 113389 states and 336234 transitions. [2019-12-27 05:12:00,478 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:12:00,478 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 05:12:00,478 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:00,643 INFO L225 Difference]: With dead ends: 113389 [2019-12-27 05:12:00,643 INFO L226 Difference]: Without dead ends: 108412 [2019-12-27 05:12:00,644 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 144 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=157, Invalid=493, Unknown=0, NotChecked=0, Total=650 [2019-12-27 05:12:01,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108412 states. [2019-12-27 05:12:02,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108412 to 28001. [2019-12-27 05:12:02,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28001 states. [2019-12-27 05:12:02,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28001 states to 28001 states and 84643 transitions. [2019-12-27 05:12:02,119 INFO L78 Accepts]: Start accepts. Automaton has 28001 states and 84643 transitions. Word has length 64 [2019-12-27 05:12:02,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:02,119 INFO L462 AbstractCegarLoop]: Abstraction has 28001 states and 84643 transitions. [2019-12-27 05:12:02,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:12:02,120 INFO L276 IsEmpty]: Start isEmpty. Operand 28001 states and 84643 transitions. [2019-12-27 05:12:02,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:12:02,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:02,153 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:02,153 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:02,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:02,154 INFO L82 PathProgramCache]: Analyzing trace with hash -876522364, now seen corresponding path program 4 times [2019-12-27 05:12:02,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:02,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946252783] [2019-12-27 05:12:02,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:02,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:02,254 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 05:12:02,255 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946252783] [2019-12-27 05:12:02,255 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:02,255 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:12:02,255 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [710416691] [2019-12-27 05:12:02,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 05:12:02,257 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:02,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 05:12:02,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-27 05:12:02,258 INFO L87 Difference]: Start difference. First operand 28001 states and 84643 transitions. Second operand 9 states. [2019-12-27 05:12:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:03,750 INFO L93 Difference]: Finished difference Result 91200 states and 270494 transitions. [2019-12-27 05:12:03,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 05:12:03,751 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 64 [2019-12-27 05:12:03,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:03,875 INFO L225 Difference]: With dead ends: 91200 [2019-12-27 05:12:03,875 INFO L226 Difference]: Without dead ends: 87321 [2019-12-27 05:12:03,876 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2019-12-27 05:12:04,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87321 states. [2019-12-27 05:12:04,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87321 to 27728. [2019-12-27 05:12:04,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27728 states. [2019-12-27 05:12:04,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27728 states to 27728 states and 83966 transitions. [2019-12-27 05:12:04,819 INFO L78 Accepts]: Start accepts. Automaton has 27728 states and 83966 transitions. Word has length 64 [2019-12-27 05:12:04,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:04,819 INFO L462 AbstractCegarLoop]: Abstraction has 27728 states and 83966 transitions. [2019-12-27 05:12:04,819 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 05:12:04,819 INFO L276 IsEmpty]: Start isEmpty. Operand 27728 states and 83966 transitions. [2019-12-27 05:12:04,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:12:04,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:04,852 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:04,852 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:04,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:04,852 INFO L82 PathProgramCache]: Analyzing trace with hash 1596629638, now seen corresponding path program 5 times [2019-12-27 05:12:04,852 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:04,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505156325] [2019-12-27 05:12:04,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:04,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:04,925 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 05:12:04,926 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505156325] [2019-12-27 05:12:04,926 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:04,926 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 05:12:04,926 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227035520] [2019-12-27 05:12:04,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:12:04,927 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:04,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:12:04,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:12:04,928 INFO L87 Difference]: Start difference. First operand 27728 states and 83966 transitions. Second operand 7 states. [2019-12-27 05:12:05,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:05,819 INFO L93 Difference]: Finished difference Result 59157 states and 176525 transitions. [2019-12-27 05:12:05,820 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 05:12:05,820 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-27 05:12:05,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:05,888 INFO L225 Difference]: With dead ends: 59157 [2019-12-27 05:12:05,888 INFO L226 Difference]: Without dead ends: 49850 [2019-12-27 05:12:05,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 05:12:06,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49850 states. [2019-12-27 05:12:06,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49850 to 27934. [2019-12-27 05:12:06,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27934 states. [2019-12-27 05:12:06,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27934 states to 27934 states and 84487 transitions. [2019-12-27 05:12:06,516 INFO L78 Accepts]: Start accepts. Automaton has 27934 states and 84487 transitions. Word has length 64 [2019-12-27 05:12:06,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:06,517 INFO L462 AbstractCegarLoop]: Abstraction has 27934 states and 84487 transitions. [2019-12-27 05:12:06,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:12:06,517 INFO L276 IsEmpty]: Start isEmpty. Operand 27934 states and 84487 transitions. [2019-12-27 05:12:06,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 05:12:06,551 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:06,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:06,552 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:06,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:06,552 INFO L82 PathProgramCache]: Analyzing trace with hash 1037760048, now seen corresponding path program 6 times [2019-12-27 05:12:06,552 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:06,553 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302206635] [2019-12-27 05:12:06,553 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:06,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:06,609 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 05:12:06,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302206635] [2019-12-27 05:12:06,610 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:06,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:12:06,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067930490] [2019-12-27 05:12:06,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:12:06,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:06,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:12:06,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:12:06,611 INFO L87 Difference]: Start difference. First operand 27934 states and 84487 transitions. Second operand 3 states. [2019-12-27 05:12:06,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:06,758 INFO L93 Difference]: Finished difference Result 32036 states and 96497 transitions. [2019-12-27 05:12:06,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:12:06,759 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 05:12:06,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:06,806 INFO L225 Difference]: With dead ends: 32036 [2019-12-27 05:12:06,806 INFO L226 Difference]: Without dead ends: 32036 [2019-12-27 05:12:06,806 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 05:12:06,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32036 states. [2019-12-27 05:12:07,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32036 to 27645. [2019-12-27 05:12:07,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27645 states. [2019-12-27 05:12:07,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27645 states to 27645 states and 83779 transitions. [2019-12-27 05:12:07,294 INFO L78 Accepts]: Start accepts. Automaton has 27645 states and 83779 transitions. Word has length 64 [2019-12-27 05:12:07,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:07,294 INFO L462 AbstractCegarLoop]: Abstraction has 27645 states and 83779 transitions. [2019-12-27 05:12:07,294 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:12:07,294 INFO L276 IsEmpty]: Start isEmpty. Operand 27645 states and 83779 transitions. [2019-12-27 05:12:07,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:12:07,327 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:07,328 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:07,328 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:07,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:07,328 INFO L82 PathProgramCache]: Analyzing trace with hash 1997790892, now seen corresponding path program 1 times [2019-12-27 05:12:07,328 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:07,328 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621477630] [2019-12-27 05:12:07,328 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:07,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:07,422 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 05:12:07,422 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621477630] [2019-12-27 05:12:07,422 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:07,423 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-27 05:12:07,423 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226216630] [2019-12-27 05:12:07,423 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 05:12:07,423 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:07,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 05:12:07,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 05:12:07,424 INFO L87 Difference]: Start difference. First operand 27645 states and 83779 transitions. Second operand 7 states. [2019-12-27 05:12:09,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:09,035 INFO L93 Difference]: Finished difference Result 48940 states and 145909 transitions. [2019-12-27 05:12:09,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 05:12:09,036 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 05:12:09,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:09,102 INFO L225 Difference]: With dead ends: 48940 [2019-12-27 05:12:09,102 INFO L226 Difference]: Without dead ends: 48940 [2019-12-27 05:12:09,102 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-27 05:12:09,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48940 states. [2019-12-27 05:12:09,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48940 to 27687. [2019-12-27 05:12:09,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27687 states. [2019-12-27 05:12:09,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27687 states to 27687 states and 83962 transitions. [2019-12-27 05:12:09,723 INFO L78 Accepts]: Start accepts. Automaton has 27687 states and 83962 transitions. Word has length 65 [2019-12-27 05:12:09,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:09,723 INFO L462 AbstractCegarLoop]: Abstraction has 27687 states and 83962 transitions. [2019-12-27 05:12:09,723 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 05:12:09,723 INFO L276 IsEmpty]: Start isEmpty. Operand 27687 states and 83962 transitions. [2019-12-27 05:12:09,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:12:09,752 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:09,753 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:09,753 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:09,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:09,753 INFO L82 PathProgramCache]: Analyzing trace with hash 1032072508, now seen corresponding path program 2 times [2019-12-27 05:12:09,753 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:09,753 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436688815] [2019-12-27 05:12:09,753 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:09,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:10,274 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 05:12:10,274 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436688815] [2019-12-27 05:12:10,275 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:10,275 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 05:12:10,275 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194591405] [2019-12-27 05:12:10,275 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 05:12:10,275 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:10,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 05:12:10,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 05:12:10,276 INFO L87 Difference]: Start difference. First operand 27687 states and 83962 transitions. Second operand 8 states. [2019-12-27 05:12:12,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:12,170 INFO L93 Difference]: Finished difference Result 55080 states and 164769 transitions. [2019-12-27 05:12:12,170 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-27 05:12:12,170 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 05:12:12,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:12,249 INFO L225 Difference]: With dead ends: 55080 [2019-12-27 05:12:12,249 INFO L226 Difference]: Without dead ends: 55080 [2019-12-27 05:12:12,249 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=99, Invalid=281, Unknown=0, NotChecked=0, Total=380 [2019-12-27 05:12:12,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55080 states. [2019-12-27 05:12:12,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55080 to 27715. [2019-12-27 05:12:12,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27715 states. [2019-12-27 05:12:12,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27715 states to 27715 states and 84070 transitions. [2019-12-27 05:12:12,950 INFO L78 Accepts]: Start accepts. Automaton has 27715 states and 84070 transitions. Word has length 65 [2019-12-27 05:12:12,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:12,950 INFO L462 AbstractCegarLoop]: Abstraction has 27715 states and 84070 transitions. [2019-12-27 05:12:12,950 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 05:12:12,950 INFO L276 IsEmpty]: Start isEmpty. Operand 27715 states and 84070 transitions. [2019-12-27 05:12:12,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 05:12:12,983 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:12,983 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:12,983 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:12,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:12,983 INFO L82 PathProgramCache]: Analyzing trace with hash 1510951580, now seen corresponding path program 3 times [2019-12-27 05:12:12,983 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:12,984 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480149976] [2019-12-27 05:12:12,984 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:13,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:13,046 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 05:12:13,047 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480149976] [2019-12-27 05:12:13,047 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:13,047 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:12:13,047 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501580866] [2019-12-27 05:12:13,047 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:12:13,048 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:13,048 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:12:13,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:12:13,048 INFO L87 Difference]: Start difference. First operand 27715 states and 84070 transitions. Second operand 3 states. [2019-12-27 05:12:13,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:13,148 INFO L93 Difference]: Finished difference Result 20781 states and 62318 transitions. [2019-12-27 05:12:13,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:12:13,149 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 05:12:13,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:13,192 INFO L225 Difference]: With dead ends: 20781 [2019-12-27 05:12:13,192 INFO L226 Difference]: Without dead ends: 20781 [2019-12-27 05:12:13,193 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 05:12:13,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20781 states. [2019-12-27 05:12:13,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20781 to 19130. [2019-12-27 05:12:13,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19130 states. [2019-12-27 05:12:13,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19130 states to 19130 states and 57353 transitions. [2019-12-27 05:12:13,719 INFO L78 Accepts]: Start accepts. Automaton has 19130 states and 57353 transitions. Word has length 65 [2019-12-27 05:12:13,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:13,720 INFO L462 AbstractCegarLoop]: Abstraction has 19130 states and 57353 transitions. [2019-12-27 05:12:13,720 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:12:13,720 INFO L276 IsEmpty]: Start isEmpty. Operand 19130 states and 57353 transitions. [2019-12-27 05:12:13,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 05:12:13,748 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:13,749 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:13,749 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:13,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:13,749 INFO L82 PathProgramCache]: Analyzing trace with hash -666708629, now seen corresponding path program 1 times [2019-12-27 05:12:13,749 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:13,750 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687177942] [2019-12-27 05:12:13,750 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:13,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 05:12:13,830 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 05:12:13,830 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687177942] [2019-12-27 05:12:13,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 05:12:13,833 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 05:12:13,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175753514] [2019-12-27 05:12:13,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 05:12:13,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 05:12:13,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 05:12:13,834 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 05:12:13,834 INFO L87 Difference]: Start difference. First operand 19130 states and 57353 transitions. Second operand 3 states. [2019-12-27 05:12:13,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 05:12:13,915 INFO L93 Difference]: Finished difference Result 19130 states and 57352 transitions. [2019-12-27 05:12:13,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 05:12:13,916 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 05:12:13,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 05:12:13,949 INFO L225 Difference]: With dead ends: 19130 [2019-12-27 05:12:13,950 INFO L226 Difference]: Without dead ends: 19130 [2019-12-27 05:12:13,952 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 05:12:14,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19130 states. [2019-12-27 05:12:14,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19130 to 15229. [2019-12-27 05:12:14,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15229 states. [2019-12-27 05:12:14,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15229 states to 15229 states and 46328 transitions. [2019-12-27 05:12:14,249 INFO L78 Accepts]: Start accepts. Automaton has 15229 states and 46328 transitions. Word has length 66 [2019-12-27 05:12:14,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 05:12:14,249 INFO L462 AbstractCegarLoop]: Abstraction has 15229 states and 46328 transitions. [2019-12-27 05:12:14,249 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 05:12:14,249 INFO L276 IsEmpty]: Start isEmpty. Operand 15229 states and 46328 transitions. [2019-12-27 05:12:14,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 05:12:14,266 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 05:12:14,266 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 05:12:14,266 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 05:12:14,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 05:12:14,267 INFO L82 PathProgramCache]: Analyzing trace with hash -190644257, now seen corresponding path program 1 times [2019-12-27 05:12:14,267 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 05:12:14,267 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620140535] [2019-12-27 05:12:14,267 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 05:12:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:12:14,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 05:12:14,387 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 05:12:14,388 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 05:12:14,392 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_63| 0 0))) (and (= 0 v_~z$r_buff1_thd0~0_25) (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= v_~z$r_buff0_thd3~0_76 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd0~0_20 0) (= 0 v_~__unbuffered_cnt~0_20) (= v_~z~0_28 0) (= |v_#NULL.offset_6| 0) (= v_~__unbuffered_p1_EBX~0_15 0) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t153~0.base_19|) (= v_~z$r_buff0_thd2~0_20 0) (= v_~__unbuffered_p2_EBX~0_16 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t153~0.base_19| 4) |v_#length_23|) (= v_~z$read_delayed~0_6 0) (= 0 v_~weak$$choice2~0_32) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t153~0.base_19|)) (= 0 v_~z$r_buff1_thd2~0_16) (= 0 v_~z$mem_tmp~0_9) (= v_~z$read_delayed_var~0.base_6 0) (< 0 |v_#StackHeapBarrier_18|) (= 0 v_~__unbuffered_p2_EAX~0_15) (= 0 |v_#NULL.base_6|) (= v_~z$r_buff0_thd1~0_27 0) (= v_~x~0_18 0) (= 0 v_~weak$$choice0~0_7) (= (store |v_#memory_int_20| |v_ULTIMATE.start_main_~#t153~0.base_19| (store (select |v_#memory_int_20| |v_ULTIMATE.start_main_~#t153~0.base_19|) |v_ULTIMATE.start_main_~#t153~0.offset_15| 0)) |v_#memory_int_19|) (= |v_ULTIMATE.start_main_~#t153~0.offset_15| 0) (= 0 v_~z$w_buff1_used~0_74) (= |v_#valid_61| (store .cse0 |v_ULTIMATE.start_main_~#t153~0.base_19| 1)) (= v_~z$w_buff0_used~0_111 0) (= 0 v_~z$r_buff1_thd1~0_19) (= 0 v_~z$flush_delayed~0_12) (= 0 v_~z$w_buff0~0_25) (= 0 v_~z$r_buff1_thd3~0_50) (= 0 v_~z$w_buff1~0_24) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_63|, #memory_int=|v_#memory_int_20|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t154~0.offset=|v_ULTIMATE.start_main_~#t154~0.offset_14|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_16, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_20, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ULTIMATE.start_main_~#t153~0.base=|v_ULTIMATE.start_main_~#t153~0.base_19|, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_15, ~z$mem_tmp~0=v_~z$mem_tmp~0_9, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_8|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_74, ~z$flush_delayed~0=v_~z$flush_delayed~0_12, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_~#t155~0.offset=|v_ULTIMATE.start_main_~#t155~0.offset_15|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_19, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_76, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_18, ULTIMATE.start_main_~#t154~0.base=|v_ULTIMATE.start_main_~#t154~0.base_18|, ULTIMATE.start_main_~#t155~0.base=|v_ULTIMATE.start_main_~#t155~0.base_19|, ~z$read_delayed~0=v_~z$read_delayed~0_6, ~z$w_buff1~0=v_~z$w_buff1~0_24, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_25, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_15, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_111, ~z$w_buff0~0=v_~z$w_buff0~0_25, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ULTIMATE.start_main_~#t153~0.offset=|v_ULTIMATE.start_main_~#t153~0.offset_15|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_6|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_19|, ~z~0=v_~z~0_28, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t154~0.offset, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t153~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t155~0.offset, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t154~0.base, ULTIMATE.start_main_~#t155~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ~__unbuffered_p1_EBX~0, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t153~0.offset, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:12:14,393 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [864] [864] L830-1-->L832: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t154~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t154~0.offset_9| 0) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t154~0.base_11| 1)) (= 0 (select |v_#valid_36| |v_ULTIMATE.start_main_~#t154~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t154~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t154~0.base_11|) |v_ULTIMATE.start_main_~#t154~0.offset_9| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t154~0.base_11|) (not (= 0 |v_ULTIMATE.start_main_~#t154~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_~#t154~0.offset=|v_ULTIMATE.start_main_~#t154~0.offset_9|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_5|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t154~0.base=|v_ULTIMATE.start_main_~#t154~0.base_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t154~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t154~0.base] because there is no mapped edge [2019-12-27 05:12:14,394 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->L748: Formula: (and (= 1 v_~x~0_6) (= v_~z$r_buff0_thd0~0_15 v_~z$r_buff1_thd0~0_11) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd3~0_45 v_~z$r_buff1_thd3~0_27) (= v_~z$r_buff0_thd1~0_17 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6)) (= v_~z$r_buff0_thd1~0_18 v_~z$r_buff1_thd1~0_11)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_45, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_18, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_27, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_11, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_45, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_6, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_17, ~x~0=v_~x~0_6, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0, ~x~0] because there is no mapped edge [2019-12-27 05:12:14,396 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L771-2-->L771-4: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In682868186 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In682868186 256)))) (or (and (= ~z~0_In682868186 |P1Thread1of1ForFork2_#t~ite9_Out682868186|) (or .cse0 .cse1)) (and (= ~z$w_buff1~0_In682868186 |P1Thread1of1ForFork2_#t~ite9_Out682868186|) (not .cse0) (not .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In682868186, ~z$w_buff1_used~0=~z$w_buff1_used~0_In682868186, ~z$w_buff1~0=~z$w_buff1~0_In682868186, ~z~0=~z~0_In682868186} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out682868186|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In682868186, ~z$w_buff1_used~0=~z$w_buff1_used~0_In682868186, ~z$w_buff1~0=~z$w_buff1~0_In682868186, ~z~0=~z~0_In682868186} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 05:12:14,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L771-4-->L772: Formula: (= v_~z~0_18 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 05:12:14,397 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L772-->L772-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In591008942 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In591008942 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out591008942|) (not .cse1)) (and (or .cse0 .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out591008942| ~z$w_buff0_used~0_In591008942)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In591008942, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In591008942} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In591008942, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out591008942|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In591008942} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 05:12:14,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L773-->L773-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1836521524 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In1836521524 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1836521524 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1836521524 256) 0))) (or (and (= |P1Thread1of1ForFork2_#t~ite12_Out1836521524| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P1Thread1of1ForFork2_#t~ite12_Out1836521524| ~z$w_buff1_used~0_In1836521524) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1836521524, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1836521524, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1836521524, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1836521524} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1836521524, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1836521524, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1836521524, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out1836521524|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1836521524} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 05:12:14,398 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L832-1-->L834: Formula: (and (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t155~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t155~0.base_9|) |v_ULTIMATE.start_main_~#t155~0.offset_8| 2)) |v_#memory_int_9|) (= |v_ULTIMATE.start_main_~#t155~0.offset_8| 0) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t155~0.base_9|) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t155~0.base_9| 1)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t155~0.base_9| 4) |v_#length_13|) (not (= |v_ULTIMATE.start_main_~#t155~0.base_9| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t155~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t155~0.base=|v_ULTIMATE.start_main_~#t155~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t155~0.offset=|v_ULTIMATE.start_main_~#t155~0.offset_8|, #valid=|v_#valid_27|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t155~0.base, ULTIMATE.start_main_~#t155~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 05:12:14,400 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L796-->L796-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In101658677 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite20_In101658677| |P2Thread1of1ForFork0_#t~ite20_Out101658677|) (= |P2Thread1of1ForFork0_#t~ite21_Out101658677| ~z$w_buff0~0_In101658677) (not .cse0)) (and (= |P2Thread1of1ForFork0_#t~ite21_Out101658677| |P2Thread1of1ForFork0_#t~ite20_Out101658677|) (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In101658677 256)))) (or (and .cse1 (= 0 (mod ~z$r_buff1_thd3~0_In101658677 256))) (= (mod ~z$w_buff0_used~0_In101658677 256) 0) (and .cse1 (= 0 (mod ~z$w_buff1_used~0_In101658677 256))))) (= |P2Thread1of1ForFork0_#t~ite20_Out101658677| ~z$w_buff0~0_In101658677) .cse0))) InVars {~z$w_buff0~0=~z$w_buff0~0_In101658677, ~z$w_buff0_used~0=~z$w_buff0_used~0_In101658677, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In101658677, ~z$w_buff1_used~0=~z$w_buff1_used~0_In101658677, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In101658677, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In101658677|, ~weak$$choice2~0=~weak$$choice2~0_In101658677} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out101658677|, ~z$w_buff0~0=~z$w_buff0~0_In101658677, ~z$w_buff0_used~0=~z$w_buff0_used~0_In101658677, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In101658677, ~z$w_buff1_used~0=~z$w_buff1_used~0_In101658677, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In101658677, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out101658677|, ~weak$$choice2~0=~weak$$choice2~0_In101658677} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 05:12:14,401 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L797-->L797-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1007787147 256)))) (or (and (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1007787147 256)))) (or (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-1007787147 256))) (= 0 (mod ~z$w_buff0_used~0_In-1007787147 256)) (and (= (mod ~z$w_buff1_used~0_In-1007787147 256) 0) .cse0))) (= |P2Thread1of1ForFork0_#t~ite24_Out-1007787147| |P2Thread1of1ForFork0_#t~ite23_Out-1007787147|) .cse1 (= ~z$w_buff1~0_In-1007787147 |P2Thread1of1ForFork0_#t~ite23_Out-1007787147|)) (and (= ~z$w_buff1~0_In-1007787147 |P2Thread1of1ForFork0_#t~ite24_Out-1007787147|) (not .cse1) (= |P2Thread1of1ForFork0_#t~ite23_In-1007787147| |P2Thread1of1ForFork0_#t~ite23_Out-1007787147|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1007787147, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1007787147, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-1007787147|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1007787147, ~z$w_buff1~0=~z$w_buff1~0_In-1007787147, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1007787147, ~weak$$choice2~0=~weak$$choice2~0_In-1007787147} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1007787147, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-1007787147|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1007787147, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-1007787147|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1007787147, ~z$w_buff1~0=~z$w_buff1~0_In-1007787147, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1007787147, ~weak$$choice2~0=~weak$$choice2~0_In-1007787147} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 05:12:14,402 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L798-->L798-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-62675433 256) 0))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out-62675433| |P2Thread1of1ForFork0_#t~ite26_Out-62675433|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-62675433 256)))) (or (and .cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-62675433 256))) (and .cse0 (= (mod ~z$w_buff1_used~0_In-62675433 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In-62675433 256)))) (= ~z$w_buff0_used~0_In-62675433 |P2Thread1of1ForFork0_#t~ite26_Out-62675433|) .cse1) (and (not .cse1) (= ~z$w_buff0_used~0_In-62675433 |P2Thread1of1ForFork0_#t~ite27_Out-62675433|) (= |P2Thread1of1ForFork0_#t~ite26_In-62675433| |P2Thread1of1ForFork0_#t~ite26_Out-62675433|)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-62675433|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-62675433, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-62675433, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-62675433, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-62675433, ~weak$$choice2~0=~weak$$choice2~0_In-62675433} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-62675433|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-62675433|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-62675433, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-62675433, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-62675433, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-62675433, ~weak$$choice2~0=~weak$$choice2~0_In-62675433} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 05:12:14,403 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~z$r_buff0_thd3~0_49 v_~z$r_buff0_thd3~0_48)) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_49, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_48, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 05:12:14,404 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L803-->L807: Formula: (and (= v_~z~0_21 v_~z$mem_tmp~0_5) (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_21} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 05:12:14,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L807-2-->L807-4: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd3~0_In-1852909329 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1852909329 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1852909329| ~z~0_In-1852909329) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork0_#t~ite38_Out-1852909329| ~z$w_buff1~0_In-1852909329) (not .cse1) (not .cse0)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1852909329, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1852909329, ~z$w_buff1~0=~z$w_buff1~0_In-1852909329, ~z~0=~z~0_In-1852909329} OutVars{P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-1852909329|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1852909329, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1852909329, ~z$w_buff1~0=~z$w_buff1~0_In-1852909329, ~z~0=~z~0_In-1852909329} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 05:12:14,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L807-4-->L808: Formula: (= v_~z~0_17 |v_P2Thread1of1ForFork0_#t~ite38_8|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_8|} OutVars{P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_7|, ~z~0=v_~z~0_17} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38, ~z~0] because there is no mapped edge [2019-12-27 05:12:14,405 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L808-->L808-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In1829301021 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1829301021 256) 0))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In1829301021 |P2Thread1of1ForFork0_#t~ite40_Out1829301021|)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite40_Out1829301021| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1829301021, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1829301021} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1829301021, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out1829301021|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1829301021} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 05:12:14,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L774-->L774-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-631372060 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-631372060 256)))) (or (and (= ~z$r_buff0_thd2~0_In-631372060 |P1Thread1of1ForFork2_#t~ite13_Out-631372060|) (or .cse0 .cse1)) (and (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out-631372060| 0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-631372060, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-631372060} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-631372060, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out-631372060|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-631372060} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 05:12:14,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L775-->L775-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1199310920 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In1199310920 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1199310920 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1199310920 256) 0))) (or (and (= ~z$r_buff1_thd2~0_In1199310920 |P1Thread1of1ForFork2_#t~ite14_Out1199310920|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P1Thread1of1ForFork2_#t~ite14_Out1199310920|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1199310920, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1199310920, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1199310920, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1199310920} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1199310920, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1199310920, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1199310920, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1199310920|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1199310920} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 05:12:14,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [851] [851] L775-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_12) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_12 1) v_~__unbuffered_cnt~0_11) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 05:12:14,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L749-->L749-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In835944515 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In835944515 256)))) (or (and (= ~z$w_buff0_used~0_In835944515 |P0Thread1of1ForFork1_#t~ite5_Out835944515|) (or .cse0 .cse1)) (and (= |P0Thread1of1ForFork1_#t~ite5_Out835944515| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In835944515, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In835944515} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out835944515|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In835944515, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In835944515} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 05:12:14,409 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L750-->L750-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-886779472 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-886779472 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-886779472 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-886779472 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite6_Out-886779472| 0)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-886779472 |P0Thread1of1ForFork1_#t~ite6_Out-886779472|) (or .cse2 .cse3)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-886779472, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-886779472, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-886779472, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-886779472} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-886779472, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-886779472|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-886779472, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-886779472, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-886779472} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 05:12:14,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L751-->L752: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1016138166 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In1016138166 256)))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out1016138166 0)) (and (= ~z$r_buff0_thd1~0_Out1016138166 ~z$r_buff0_thd1~0_In1016138166) (or .cse0 .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1016138166, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1016138166} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1016138166, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1016138166|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1016138166} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 05:12:14,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L752-->L752-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In1939795727 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In1939795727 256))) (.cse1 (= (mod ~z$r_buff1_thd1~0_In1939795727 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1939795727 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out1939795727| 0)) (and (or .cse2 .cse3) (= |P0Thread1of1ForFork1_#t~ite8_Out1939795727| ~z$r_buff1_thd1~0_In1939795727) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1939795727, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1939795727, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1939795727, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1939795727} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1939795727|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1939795727, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1939795727, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1939795727, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1939795727} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 05:12:14,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [868] [868] L752-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_16 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= (+ v_~__unbuffered_cnt~0_16 1) v_~__unbuffered_cnt~0_15) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_16, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 05:12:14,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L809-->L809-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-788372009 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-788372009 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd3~0_In-788372009 256))) (.cse3 (= (mod ~z$w_buff1_used~0_In-788372009 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite41_Out-788372009| ~z$w_buff1_used~0_In-788372009) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite41_Out-788372009| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-788372009, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-788372009, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-788372009, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-788372009} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-788372009, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-788372009, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-788372009, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-788372009, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-788372009|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 05:12:14,413 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L810-->L810-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1211039348 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-1211039348 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_In-1211039348 |P2Thread1of1ForFork0_#t~ite42_Out-1211039348|)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-1211039348|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1211039348, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1211039348} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1211039348, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1211039348, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1211039348|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 05:12:14,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In34610876 256))) (.cse3 (= (mod ~z$r_buff0_thd3~0_In34610876 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In34610876 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In34610876 256)))) (or (and (= ~z$r_buff1_thd3~0_In34610876 |P2Thread1of1ForFork0_#t~ite43_Out34610876|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork0_#t~ite43_Out34610876| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In34610876, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In34610876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In34610876, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In34610876} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out34610876|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In34610876, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In34610876, ~z$w_buff1_used~0=~z$w_buff1_used~0_In34610876, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In34610876} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 05:12:14,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [853] [853] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_13 (+ v_~__unbuffered_cnt~0_14 1)) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_43 |v_P2Thread1of1ForFork0_#t~ite43_8|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 05:12:14,415 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [807] [807] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_3|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 05:12:14,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L840-2-->L840-5: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-343540644 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out-343540644| |ULTIMATE.start_main_#t~ite47_Out-343540644|)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-343540644 256)))) (or (and (= ~z~0_In-343540644 |ULTIMATE.start_main_#t~ite47_Out-343540644|) (or .cse0 .cse1) .cse2) (and (= ~z$w_buff1~0_In-343540644 |ULTIMATE.start_main_#t~ite47_Out-343540644|) (not .cse0) .cse2 (not .cse1)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-343540644, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-343540644, ~z$w_buff1~0=~z$w_buff1~0_In-343540644, ~z~0=~z~0_In-343540644} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-343540644, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-343540644|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-343540644, ~z$w_buff1~0=~z$w_buff1~0_In-343540644, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-343540644|, ~z~0=~z~0_In-343540644} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 05:12:14,418 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In-269773571 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-269773571 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out-269773571|)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-269773571 |ULTIMATE.start_main_#t~ite49_Out-269773571|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-269773571, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-269773571} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-269773571, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-269773571, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out-269773571|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 05:12:14,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L842-->L842-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1128903979 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In-1128903979 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd0~0_In-1128903979 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-1128903979 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out-1128903979|)) (and (= ~z$w_buff1_used~0_In-1128903979 |ULTIMATE.start_main_#t~ite50_Out-1128903979|) (or .cse3 .cse2) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1128903979, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1128903979, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1128903979, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1128903979} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out-1128903979|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1128903979, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1128903979, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1128903979, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1128903979} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 05:12:14,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L843-->L843-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-745822154 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-745822154 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-745822154 |ULTIMATE.start_main_#t~ite51_Out-745822154|)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite51_Out-745822154| 0) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-745822154, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-745822154} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-745822154, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-745822154|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-745822154} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 05:12:14,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In-154880217 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In-154880217 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In-154880217 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-154880217 256)))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-154880217| ~z$r_buff1_thd0~0_In-154880217) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite52_Out-154880217| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-154880217, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-154880217, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-154880217, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-154880217} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-154880217|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-154880217, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-154880217, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-154880217, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-154880217} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 05:12:14,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [882] [882] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~__unbuffered_p2_EAX~0_8 1) (= v_~main$tmp_guard1~0_9 0) (= 2 v_~__unbuffered_p1_EAX~0_7) (= 0 v_~__unbuffered_p1_EBX~0_8) (= v_~__unbuffered_p2_EBX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_13| v_~z$r_buff1_thd0~0_18) (= v_ULTIMATE.start___VERIFIER_assert_~expression_15 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_10| (mod v_~main$tmp_guard1~0_9 256)) (= v_~x~0_11 2)) InVars {ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_13|, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_11} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_12|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_15, ~__unbuffered_p1_EBX~0=v_~__unbuffered_p1_EBX~0_8, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_9, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_7, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_18, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_8, ~x~0=v_~x~0_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 05:12:14,574 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:12:14 BasicIcfg [2019-12-27 05:12:14,574 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 05:12:14,576 INFO L168 Benchmark]: Toolchain (without parser) took 111537.57 ms. Allocated memory was 137.9 MB in the beginning and 3.8 GB in the end (delta: 3.7 GB). Free memory was 99.9 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-27 05:12:14,580 INFO L168 Benchmark]: CDTParser took 0.52 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 05:12:14,580 INFO L168 Benchmark]: CACSL2BoogieTranslator took 715.41 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.5 MB in the beginning and 155.6 MB in the end (delta: -56.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. [2019-12-27 05:12:14,581 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.50 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 152.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-27 05:12:14,581 INFO L168 Benchmark]: Boogie Preprocessor took 47.23 ms. Allocated memory is still 202.4 MB. Free memory was 152.8 MB in the beginning and 150.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 05:12:14,582 INFO L168 Benchmark]: RCFGBuilder took 835.59 ms. Allocated memory is still 202.4 MB. Free memory was 150.8 MB in the beginning and 100.6 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. [2019-12-27 05:12:14,582 INFO L168 Benchmark]: TraceAbstraction took 109854.50 ms. Allocated memory was 202.4 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 99.9 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. [2019-12-27 05:12:14,588 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.52 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 715.41 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.5 MB in the beginning and 155.6 MB in the end (delta: -56.1 MB). Peak memory consumption was 24.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.50 ms. Allocated memory is still 202.4 MB. Free memory was 155.6 MB in the beginning and 152.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 47.23 ms. Allocated memory is still 202.4 MB. Free memory was 152.8 MB in the beginning and 150.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 835.59 ms. Allocated memory is still 202.4 MB. Free memory was 150.8 MB in the beginning and 100.6 MB in the end (delta: 50.2 MB). Peak memory consumption was 50.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 109854.50 ms. Allocated memory was 202.4 MB in the beginning and 3.8 GB in the end (delta: 3.6 GB). Free memory was 99.9 MB in the beginning and 1.1 GB in the end (delta: -1.0 GB). Peak memory consumption was 2.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.0s, 177 ProgramPointsBefore, 95 ProgramPointsAfterwards, 214 TransitionsBefore, 105 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 34 TrivialSequentialCompositions, 48 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 31 ChoiceCompositions, 7246 VarBasedMoverChecksPositive, 203 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 82443 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t153, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] FCALL, FORK 0 pthread_create(&t154, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L733] 1 z$w_buff1 = z$w_buff0 [L734] 1 z$w_buff0 = 1 [L735] 1 z$w_buff1_used = z$w_buff0_used [L736] 1 z$w_buff0_used = (_Bool)1 [L762] 2 x = 2 [L765] 2 __unbuffered_p1_EAX = x [L768] 2 __unbuffered_p1_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L771] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L772] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L834] FCALL, FORK 0 pthread_create(&t155, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L785] 3 y = 1 [L788] 3 __unbuffered_p2_EAX = y [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 z$flush_delayed = weak$$choice2 [L794] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L795] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L796] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L797] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L798] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L801] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L807] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L773] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L774] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L748] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L748] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L749] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L750] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L808] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L809] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L810] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L840] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p1_EAX=2, __unbuffered_p1_EBX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=10, weak$$choice2=1, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L840] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L841] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L842] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L843] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 109.4s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 36.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7399 SDtfs, 10680 SDslu, 19418 SDs, 0 SdLazy, 12797 SolverSat, 673 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 374 GetRequests, 61 SyntacticMatches, 25 SemanticMatches, 288 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1163 ImplicationChecksByTransitivity, 4.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158867occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 42.2s AutomataMinimizationTime, 30 MinimizatonAttempts, 475143 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.9s InterpolantComputationTime, 1284 NumberOfCodeBlocks, 1284 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1187 ConstructedInterpolants, 0 QuantifiedInterpolants, 212441 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 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...