/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix017_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 21:41:07,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 21:41:07,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 21:41:07,699 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 21:41:07,700 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 21:41:07,701 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 21:41:07,703 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 21:41:07,712 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 21:41:07,717 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 21:41:07,718 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 21:41:07,720 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 21:41:07,721 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 21:41:07,722 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 21:41:07,723 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 21:41:07,725 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 21:41:07,727 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 21:41:07,727 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 21:41:07,730 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 21:41:07,732 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 21:41:07,733 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 21:41:07,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 21:41:07,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 21:41:07,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 21:41:07,741 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 21:41:07,745 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 21:41:07,745 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 21:41:07,746 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 21:41:07,747 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 21:41:07,749 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 21:41:07,750 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 21:41:07,750 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 21:41:07,751 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 21:41:07,752 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 21:41:07,753 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 21:41:07,754 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 21:41:07,755 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 21:41:07,756 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 21:41:07,756 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 21:41:07,756 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 21:41:07,760 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 21:41:07,761 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 21:41:07,762 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 21:41:07,780 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 21:41:07,780 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 21:41:07,781 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 21:41:07,782 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 21:41:07,782 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 21:41:07,782 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 21:41:07,782 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 21:41:07,783 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 21:41:07,783 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 21:41:07,783 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 21:41:07,783 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 21:41:07,783 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 21:41:07,784 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 21:41:07,784 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 21:41:07,784 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 21:41:07,784 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 21:41:07,785 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 21:41:07,785 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 21:41:07,785 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 21:41:07,785 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 21:41:07,785 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 21:41:07,786 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 21:41:07,786 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 21:41:07,786 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 21:41:07,786 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 21:41:07,786 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 21:41:07,787 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 21:41:07,787 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 21:41:07,787 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 21:41:07,787 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 21:41:08,069 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 21:41:08,083 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 21:41:08,086 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 21:41:08,087 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 21:41:08,088 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 21:41:08,089 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix017_rmo.opt.i [2019-12-26 21:41:08,158 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28b2353c7/a2091eb81a3d44db83bf2e67fff7e0ef/FLAG6e858360e [2019-12-26 21:41:08,691 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 21:41:08,692 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix017_rmo.opt.i [2019-12-26 21:41:08,712 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28b2353c7/a2091eb81a3d44db83bf2e67fff7e0ef/FLAG6e858360e [2019-12-26 21:41:08,974 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28b2353c7/a2091eb81a3d44db83bf2e67fff7e0ef [2019-12-26 21:41:08,982 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 21:41:08,984 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 21:41:08,986 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 21:41:08,986 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 21:41:08,989 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 21:41:08,990 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:41:08" (1/1) ... [2019-12-26 21:41:08,993 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@da9fed6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:41:08, skipping insertion in model container [2019-12-26 21:41:08,993 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 09:41:08" (1/1) ... [2019-12-26 21:41:09,000 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 21:41:09,040 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 21:41:09,533 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:41:09,545 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 21:41:09,607 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 21:41:09,688 INFO L208 MainTranslator]: Completed translation [2019-12-26 21:41:09,688 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:41:09 WrapperNode [2019-12-26 21:41:09,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 21:41:09,689 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 21:41:09,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 21:41:09,690 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 21:41:09,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:41:09" (1/1) ... [2019-12-26 21:41:09,718 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:41:09" (1/1) ... [2019-12-26 21:41:09,750 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 21:41:09,751 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 21:41:09,751 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 21:41:09,751 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 21:41:09,759 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:41:09" (1/1) ... [2019-12-26 21:41:09,759 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:41:09" (1/1) ... [2019-12-26 21:41:09,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:41:09" (1/1) ... [2019-12-26 21:41:09,767 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:41:09" (1/1) ... [2019-12-26 21:41:09,786 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:41:09" (1/1) ... [2019-12-26 21:41:09,791 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:41:09" (1/1) ... [2019-12-26 21:41:09,797 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:41:09" (1/1) ... [2019-12-26 21:41:09,812 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 21:41:09,813 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 21:41:09,813 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 21:41:09,813 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 21:41:09,814 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:41:09" (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-26 21:41:09,866 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 21:41:09,866 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 21:41:09,866 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 21:41:09,866 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 21:41:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 21:41:09,867 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 21:41:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 21:41:09,867 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 21:41:09,867 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 21:41:09,868 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 21:41:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-26 21:41:09,868 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-26 21:41:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 21:41:09,868 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 21:41:09,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 21:41:09,870 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 21:41:10,616 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 21:41:10,617 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 21:41:10,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:41:10 BoogieIcfgContainer [2019-12-26 21:41:10,619 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 21:41:10,620 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 21:41:10,620 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 21:41:10,624 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 21:41:10,624 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 09:41:08" (1/3) ... [2019-12-26 21:41:10,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@253a3b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:41:10, skipping insertion in model container [2019-12-26 21:41:10,625 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 09:41:09" (2/3) ... [2019-12-26 21:41:10,625 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@253a3b81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 09:41:10, skipping insertion in model container [2019-12-26 21:41:10,626 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 09:41:10" (3/3) ... [2019-12-26 21:41:10,627 INFO L109 eAbstractionObserver]: Analyzing ICFG mix017_rmo.opt.i [2019-12-26 21:41:10,638 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 21:41:10,638 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 21:41:10,646 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 21:41:10,647 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 21:41:10,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,690 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,690 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,692 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,693 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,693 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,693 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,694 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,695 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,696 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,697 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,698 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,699 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,700 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,701 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,718 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,719 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,720 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,721 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,722 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,723 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,724 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,725 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,726 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,727 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,728 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,733 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,733 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,733 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,733 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,734 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,734 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,735 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,740 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,740 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,740 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,741 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,741 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,741 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,741 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,741 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,742 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,742 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,742 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,742 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,742 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,743 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,743 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,743 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,743 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,744 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,744 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,744 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,744 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,744 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,745 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,746 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,746 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,746 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,750 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,751 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,751 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,751 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,755 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,755 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,757 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,759 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,761 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,762 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,762 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,765 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,766 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,766 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,766 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,767 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,767 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,768 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork3_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 21:41:10,782 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-26 21:41:10,802 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 21:41:10,802 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 21:41:10,802 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 21:41:10,802 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 21:41:10,802 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 21:41:10,802 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 21:41:10,803 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 21:41:10,803 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 21:41:10,819 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-26 21:41:10,821 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-26 21:41:10,977 INFO L132 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-26 21:41:10,977 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:41:10,999 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 440 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 21:41:11,021 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-26 21:41:11,089 INFO L132 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-26 21:41:11,089 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 21:41:11,097 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 440 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 21:41:11,118 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 18126 [2019-12-26 21:41:11,120 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 21:41:17,076 WARN L192 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-26 21:41:17,210 WARN L192 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-26 21:41:17,236 INFO L206 etLargeBlockEncoding]: Checked pairs total: 72619 [2019-12-26 21:41:17,236 INFO L214 etLargeBlockEncoding]: Total number of compositions: 123 [2019-12-26 21:41:17,241 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 88 places, 92 transitions [2019-12-26 21:41:51,379 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 160086 states. [2019-12-26 21:41:51,381 INFO L276 IsEmpty]: Start isEmpty. Operand 160086 states. [2019-12-26 21:41:51,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-12-26 21:41:51,387 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:41:51,387 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:41:51,388 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:41:51,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:41:51,393 INFO L82 PathProgramCache]: Analyzing trace with hash 1489169700, now seen corresponding path program 1 times [2019-12-26 21:41:51,401 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:41:51,402 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170612547] [2019-12-26 21:41:51,402 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:41:51,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:41:51,650 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-26 21:41:51,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170612547] [2019-12-26 21:41:51,652 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:41:51,652 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 21:41:51,653 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [145659777] [2019-12-26 21:41:51,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:41:51,659 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:41:51,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:41:51,677 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:41:51,680 INFO L87 Difference]: Start difference. First operand 160086 states. Second operand 3 states. [2019-12-26 21:41:53,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:41:53,737 INFO L93 Difference]: Finished difference Result 158106 states and 752394 transitions. [2019-12-26 21:41:53,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:41:53,738 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2019-12-26 21:41:53,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:41:59,318 INFO L225 Difference]: With dead ends: 158106 [2019-12-26 21:41:59,319 INFO L226 Difference]: Without dead ends: 149058 [2019-12-26 21:41:59,320 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-26 21:42:04,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149058 states. [2019-12-26 21:42:13,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149058 to 149058. [2019-12-26 21:42:13,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 149058 states. [2019-12-26 21:42:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149058 states to 149058 states and 708428 transitions. [2019-12-26 21:42:13,931 INFO L78 Accepts]: Start accepts. Automaton has 149058 states and 708428 transitions. Word has length 7 [2019-12-26 21:42:13,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:42:13,932 INFO L462 AbstractCegarLoop]: Abstraction has 149058 states and 708428 transitions. [2019-12-26 21:42:13,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:42:13,932 INFO L276 IsEmpty]: Start isEmpty. Operand 149058 states and 708428 transitions. [2019-12-26 21:42:13,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 21:42:13,943 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:42:13,943 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:42:13,944 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:42:13,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:42:13,944 INFO L82 PathProgramCache]: Analyzing trace with hash 1593754123, now seen corresponding path program 1 times [2019-12-26 21:42:13,945 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:42:13,945 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928401013] [2019-12-26 21:42:13,945 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:42:14,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:42:14,080 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-26 21:42:14,080 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928401013] [2019-12-26 21:42:14,081 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:42:14,081 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:42:14,081 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472808782] [2019-12-26 21:42:14,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:42:14,083 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:42:14,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:42:14,083 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:42:14,084 INFO L87 Difference]: Start difference. First operand 149058 states and 708428 transitions. Second operand 4 states. [2019-12-26 21:42:21,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:42:21,464 INFO L93 Difference]: Finished difference Result 235386 states and 1077036 transitions. [2019-12-26 21:42:21,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:42:21,465 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-26 21:42:21,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:42:22,269 INFO L225 Difference]: With dead ends: 235386 [2019-12-26 21:42:22,269 INFO L226 Difference]: Without dead ends: 235190 [2019-12-26 21:42:22,270 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-26 21:42:30,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235190 states. [2019-12-26 21:42:35,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235190 to 218838. [2019-12-26 21:42:35,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 218838 states. [2019-12-26 21:42:47,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 218838 states to 218838 states and 1009170 transitions. [2019-12-26 21:42:47,268 INFO L78 Accepts]: Start accepts. Automaton has 218838 states and 1009170 transitions. Word has length 15 [2019-12-26 21:42:47,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:42:47,268 INFO L462 AbstractCegarLoop]: Abstraction has 218838 states and 1009170 transitions. [2019-12-26 21:42:47,268 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:42:47,268 INFO L276 IsEmpty]: Start isEmpty. Operand 218838 states and 1009170 transitions. [2019-12-26 21:42:47,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 21:42:47,272 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:42:47,272 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:42:47,273 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:42:47,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:42:47,273 INFO L82 PathProgramCache]: Analyzing trace with hash -314430534, now seen corresponding path program 1 times [2019-12-26 21:42:47,273 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:42:47,274 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748273658] [2019-12-26 21:42:47,274 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:42:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:42:47,339 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-26 21:42:47,339 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748273658] [2019-12-26 21:42:47,339 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:42:47,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:42:47,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500308495] [2019-12-26 21:42:47,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:42:47,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:42:47,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:42:47,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:42:47,344 INFO L87 Difference]: Start difference. First operand 218838 states and 1009170 transitions. Second operand 3 states. [2019-12-26 21:42:47,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:42:47,994 INFO L93 Difference]: Finished difference Result 136511 states and 567133 transitions. [2019-12-26 21:42:47,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:42:47,995 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2019-12-26 21:42:47,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:42:48,548 INFO L225 Difference]: With dead ends: 136511 [2019-12-26 21:42:48,549 INFO L226 Difference]: Without dead ends: 136511 [2019-12-26 21:42:48,549 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-26 21:42:59,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136511 states. [2019-12-26 21:43:01,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136511 to 136511. [2019-12-26 21:43:01,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 136511 states. [2019-12-26 21:43:02,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136511 states to 136511 states and 567133 transitions. [2019-12-26 21:43:02,825 INFO L78 Accepts]: Start accepts. Automaton has 136511 states and 567133 transitions. Word has length 15 [2019-12-26 21:43:02,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:43:02,825 INFO L462 AbstractCegarLoop]: Abstraction has 136511 states and 567133 transitions. [2019-12-26 21:43:02,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:43:02,825 INFO L276 IsEmpty]: Start isEmpty. Operand 136511 states and 567133 transitions. [2019-12-26 21:43:02,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:43:02,829 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:43:02,829 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:43:02,830 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:43:02,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:43:02,830 INFO L82 PathProgramCache]: Analyzing trace with hash -1173494608, now seen corresponding path program 1 times [2019-12-26 21:43:02,830 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:43:02,831 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962102700] [2019-12-26 21:43:02,831 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:43:02,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:43:02,902 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-26 21:43:02,903 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962102700] [2019-12-26 21:43:02,903 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:43:02,903 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:43:02,903 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364690866] [2019-12-26 21:43:02,904 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:43:02,904 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:43:02,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:43:02,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:43:02,904 INFO L87 Difference]: Start difference. First operand 136511 states and 567133 transitions. Second operand 4 states. [2019-12-26 21:43:03,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:43:03,089 INFO L93 Difference]: Finished difference Result 37132 states and 130918 transitions. [2019-12-26 21:43:03,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:43:03,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 21:43:03,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:43:03,196 INFO L225 Difference]: With dead ends: 37132 [2019-12-26 21:43:03,197 INFO L226 Difference]: Without dead ends: 37132 [2019-12-26 21:43:03,197 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-26 21:43:03,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37132 states. [2019-12-26 21:43:03,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37132 to 37132. [2019-12-26 21:43:03,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37132 states. [2019-12-26 21:43:03,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37132 states to 37132 states and 130918 transitions. [2019-12-26 21:43:03,932 INFO L78 Accepts]: Start accepts. Automaton has 37132 states and 130918 transitions. Word has length 16 [2019-12-26 21:43:03,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:43:03,932 INFO L462 AbstractCegarLoop]: Abstraction has 37132 states and 130918 transitions. [2019-12-26 21:43:03,932 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:43:03,932 INFO L276 IsEmpty]: Start isEmpty. Operand 37132 states and 130918 transitions. [2019-12-26 21:43:03,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 21:43:03,935 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:43:03,935 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:43:03,935 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:43:03,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:43:03,935 INFO L82 PathProgramCache]: Analyzing trace with hash 24118251, now seen corresponding path program 1 times [2019-12-26 21:43:03,936 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:43:03,936 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49949215] [2019-12-26 21:43:03,936 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:43:03,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:43:04,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-26 21:43:04,006 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49949215] [2019-12-26 21:43:04,006 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:43:04,006 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:43:04,006 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518155948] [2019-12-26 21:43:04,007 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:43:04,007 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:43:04,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:43:04,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:43:04,007 INFO L87 Difference]: Start difference. First operand 37132 states and 130918 transitions. Second operand 4 states. [2019-12-26 21:43:04,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:43:04,399 INFO L93 Difference]: Finished difference Result 47278 states and 165300 transitions. [2019-12-26 21:43:04,399 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:43:04,400 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-26 21:43:04,400 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:43:05,554 INFO L225 Difference]: With dead ends: 47278 [2019-12-26 21:43:05,554 INFO L226 Difference]: Without dead ends: 47267 [2019-12-26 21:43:05,554 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-26 21:43:05,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47267 states. [2019-12-26 21:43:06,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47267 to 41603. [2019-12-26 21:43:06,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41603 states. [2019-12-26 21:43:06,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41603 states to 41603 states and 146400 transitions. [2019-12-26 21:43:06,305 INFO L78 Accepts]: Start accepts. Automaton has 41603 states and 146400 transitions. Word has length 16 [2019-12-26 21:43:06,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:43:06,306 INFO L462 AbstractCegarLoop]: Abstraction has 41603 states and 146400 transitions. [2019-12-26 21:43:06,306 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:43:06,306 INFO L276 IsEmpty]: Start isEmpty. Operand 41603 states and 146400 transitions. [2019-12-26 21:43:06,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-26 21:43:06,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:43:06,322 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] [2019-12-26 21:43:06,322 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:43:06,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:43:06,322 INFO L82 PathProgramCache]: Analyzing trace with hash -116240952, now seen corresponding path program 1 times [2019-12-26 21:43:06,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:43:06,323 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512017925] [2019-12-26 21:43:06,323 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:43:06,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:43:06,474 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-26 21:43:06,475 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512017925] [2019-12-26 21:43:06,475 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:43:06,475 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:43:06,475 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1029089823] [2019-12-26 21:43:06,476 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:43:06,476 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:43:06,476 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:43:06,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:43:06,477 INFO L87 Difference]: Start difference. First operand 41603 states and 146400 transitions. Second operand 6 states. [2019-12-26 21:43:07,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:43:07,329 INFO L93 Difference]: Finished difference Result 55623 states and 192614 transitions. [2019-12-26 21:43:07,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:43:07,329 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2019-12-26 21:43:07,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:43:07,430 INFO L225 Difference]: With dead ends: 55623 [2019-12-26 21:43:07,430 INFO L226 Difference]: Without dead ends: 55612 [2019-12-26 21:43:07,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:43:10,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55612 states. [2019-12-26 21:43:10,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55612 to 41708. [2019-12-26 21:43:10,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41708 states. [2019-12-26 21:43:11,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41708 states to 41708 states and 146690 transitions. [2019-12-26 21:43:11,039 INFO L78 Accepts]: Start accepts. Automaton has 41708 states and 146690 transitions. Word has length 24 [2019-12-26 21:43:11,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:43:11,039 INFO L462 AbstractCegarLoop]: Abstraction has 41708 states and 146690 transitions. [2019-12-26 21:43:11,039 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:43:11,039 INFO L276 IsEmpty]: Start isEmpty. Operand 41708 states and 146690 transitions. [2019-12-26 21:43:11,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-26 21:43:11,051 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:43:11,051 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] [2019-12-26 21:43:11,051 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:43:11,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:43:11,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1098866008, now seen corresponding path program 2 times [2019-12-26 21:43:11,052 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:43:11,052 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044749883] [2019-12-26 21:43:11,052 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:43:11,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:43:11,129 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-26 21:43:11,129 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044749883] [2019-12-26 21:43:11,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:43:11,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:43:11,130 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281739520] [2019-12-26 21:43:11,130 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:43:11,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:43:11,131 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:43:11,131 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:43:11,131 INFO L87 Difference]: Start difference. First operand 41708 states and 146690 transitions. Second operand 5 states. [2019-12-26 21:43:11,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:43:11,738 INFO L93 Difference]: Finished difference Result 50584 states and 176009 transitions. [2019-12-26 21:43:11,739 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 21:43:11,739 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 24 [2019-12-26 21:43:11,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:43:11,837 INFO L225 Difference]: With dead ends: 50584 [2019-12-26 21:43:11,837 INFO L226 Difference]: Without dead ends: 50570 [2019-12-26 21:43:11,837 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:43:12,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50570 states. [2019-12-26 21:43:12,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50570 to 40948. [2019-12-26 21:43:12,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40948 states. [2019-12-26 21:43:13,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40948 states to 40948 states and 143892 transitions. [2019-12-26 21:43:13,068 INFO L78 Accepts]: Start accepts. Automaton has 40948 states and 143892 transitions. Word has length 24 [2019-12-26 21:43:13,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:43:13,069 INFO L462 AbstractCegarLoop]: Abstraction has 40948 states and 143892 transitions. [2019-12-26 21:43:13,069 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:43:13,069 INFO L276 IsEmpty]: Start isEmpty. Operand 40948 states and 143892 transitions. [2019-12-26 21:43:13,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-26 21:43:13,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:43:13,089 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:43:13,089 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:43:13,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:43:13,090 INFO L82 PathProgramCache]: Analyzing trace with hash 2109697444, now seen corresponding path program 1 times [2019-12-26 21:43:13,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:43:13,090 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020357619] [2019-12-26 21:43:13,090 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:43:13,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:43:13,171 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-26 21:43:13,173 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020357619] [2019-12-26 21:43:13,173 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:43:13,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 21:43:13,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651075969] [2019-12-26 21:43:13,174 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:43:13,174 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:43:13,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:43:13,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:43:13,174 INFO L87 Difference]: Start difference. First operand 40948 states and 143892 transitions. Second operand 5 states. [2019-12-26 21:43:13,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:43:13,306 INFO L93 Difference]: Finished difference Result 20928 states and 74435 transitions. [2019-12-26 21:43:13,306 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 21:43:13,306 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-12-26 21:43:13,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:43:13,359 INFO L225 Difference]: With dead ends: 20928 [2019-12-26 21:43:13,359 INFO L226 Difference]: Without dead ends: 20928 [2019-12-26 21:43:13,360 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-26 21:43:13,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20928 states. [2019-12-26 21:43:13,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20928 to 20736. [2019-12-26 21:43:13,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20736 states. [2019-12-26 21:43:13,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20736 states to 20736 states and 73779 transitions. [2019-12-26 21:43:13,733 INFO L78 Accepts]: Start accepts. Automaton has 20736 states and 73779 transitions. Word has length 28 [2019-12-26 21:43:13,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:43:13,733 INFO L462 AbstractCegarLoop]: Abstraction has 20736 states and 73779 transitions. [2019-12-26 21:43:13,733 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:43:13,733 INFO L276 IsEmpty]: Start isEmpty. Operand 20736 states and 73779 transitions. [2019-12-26 21:43:13,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-26 21:43:13,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:43:13,768 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:43:13,769 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:43:13,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:43:13,769 INFO L82 PathProgramCache]: Analyzing trace with hash 708784038, now seen corresponding path program 1 times [2019-12-26 21:43:13,769 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:43:13,769 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072215962] [2019-12-26 21:43:13,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:43:13,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:43:13,853 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-26 21:43:13,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072215962] [2019-12-26 21:43:13,854 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:43:13,854 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:43:13,854 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370226140] [2019-12-26 21:43:13,855 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:43:13,855 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:43:13,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:43:13,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:43:13,855 INFO L87 Difference]: Start difference. First operand 20736 states and 73779 transitions. Second operand 4 states. [2019-12-26 21:43:14,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:43:14,386 INFO L93 Difference]: Finished difference Result 30054 states and 102106 transitions. [2019-12-26 21:43:14,387 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:43:14,387 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 42 [2019-12-26 21:43:14,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:43:14,455 INFO L225 Difference]: With dead ends: 30054 [2019-12-26 21:43:14,456 INFO L226 Difference]: Without dead ends: 21038 [2019-12-26 21:43:14,456 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-26 21:43:14,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21038 states. [2019-12-26 21:43:14,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21038 to 20942. [2019-12-26 21:43:14,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20942 states. [2019-12-26 21:43:14,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20942 states to 20942 states and 73630 transitions. [2019-12-26 21:43:14,997 INFO L78 Accepts]: Start accepts. Automaton has 20942 states and 73630 transitions. Word has length 42 [2019-12-26 21:43:14,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:43:14,998 INFO L462 AbstractCegarLoop]: Abstraction has 20942 states and 73630 transitions. [2019-12-26 21:43:14,998 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:43:14,998 INFO L276 IsEmpty]: Start isEmpty. Operand 20942 states and 73630 transitions. [2019-12-26 21:43:15,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-26 21:43:15,033 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:43:15,033 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:43:15,033 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:43:15,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:43:15,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1622826474, now seen corresponding path program 2 times [2019-12-26 21:43:15,034 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:43:15,034 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253765592] [2019-12-26 21:43:15,034 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:43:15,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:43:15,129 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-26 21:43:15,130 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253765592] [2019-12-26 21:43:15,130 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:43:15,130 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:43:15,131 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789099587] [2019-12-26 21:43:15,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 21:43:15,131 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:43:15,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 21:43:15,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:43:15,132 INFO L87 Difference]: Start difference. First operand 20942 states and 73630 transitions. Second operand 5 states. [2019-12-26 21:43:15,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:43:15,741 INFO L93 Difference]: Finished difference Result 31343 states and 109184 transitions. [2019-12-26 21:43:15,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:43:15,742 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 42 [2019-12-26 21:43:15,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:43:15,801 INFO L225 Difference]: With dead ends: 31343 [2019-12-26 21:43:15,801 INFO L226 Difference]: Without dead ends: 31343 [2019-12-26 21:43:15,801 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:43:15,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31343 states. [2019-12-26 21:43:16,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31343 to 28179. [2019-12-26 21:43:16,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28179 states. [2019-12-26 21:43:16,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28179 states to 28179 states and 98942 transitions. [2019-12-26 21:43:16,674 INFO L78 Accepts]: Start accepts. Automaton has 28179 states and 98942 transitions. Word has length 42 [2019-12-26 21:43:16,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:43:16,674 INFO L462 AbstractCegarLoop]: Abstraction has 28179 states and 98942 transitions. [2019-12-26 21:43:16,675 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 21:43:16,675 INFO L276 IsEmpty]: Start isEmpty. Operand 28179 states and 98942 transitions. [2019-12-26 21:43:16,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-26 21:43:16,716 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:43:16,716 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 21:43:16,717 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:43:16,717 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:43:16,717 INFO L82 PathProgramCache]: Analyzing trace with hash 1262851908, now seen corresponding path program 3 times [2019-12-26 21:43:16,717 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:43:16,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [473518233] [2019-12-26 21:43:16,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:43:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:43:16,787 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-26 21:43:16,787 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [473518233] [2019-12-26 21:43:16,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:43:16,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 21:43:16,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115503471] [2019-12-26 21:43:16,788 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 21:43:16,788 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:43:16,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 21:43:16,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:43:16,789 INFO L87 Difference]: Start difference. First operand 28179 states and 98942 transitions. Second operand 6 states. [2019-12-26 21:43:16,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:43:16,964 INFO L93 Difference]: Finished difference Result 26793 states and 95440 transitions. [2019-12-26 21:43:16,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 21:43:16,964 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-26 21:43:16,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:43:17,012 INFO L225 Difference]: With dead ends: 26793 [2019-12-26 21:43:17,012 INFO L226 Difference]: Without dead ends: 24459 [2019-12-26 21:43:17,012 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-12-26 21:43:17,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24459 states. [2019-12-26 21:43:17,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24459 to 23427. [2019-12-26 21:43:17,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23427 states. [2019-12-26 21:43:17,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23427 states to 23427 states and 83180 transitions. [2019-12-26 21:43:17,470 INFO L78 Accepts]: Start accepts. Automaton has 23427 states and 83180 transitions. Word has length 42 [2019-12-26 21:43:17,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:43:17,470 INFO L462 AbstractCegarLoop]: Abstraction has 23427 states and 83180 transitions. [2019-12-26 21:43:17,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 21:43:17,470 INFO L276 IsEmpty]: Start isEmpty. Operand 23427 states and 83180 transitions. [2019-12-26 21:43:17,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 21:43:17,516 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:43:17,516 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] [2019-12-26 21:43:17,516 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:43:17,517 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:43:17,517 INFO L82 PathProgramCache]: Analyzing trace with hash 712944392, now seen corresponding path program 1 times [2019-12-26 21:43:17,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:43:17,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075826583] [2019-12-26 21:43:17,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:43:17,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:43:17,604 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-26 21:43:17,605 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075826583] [2019-12-26 21:43:17,605 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:43:17,605 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 21:43:17,605 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [617239745] [2019-12-26 21:43:17,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 21:43:17,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:43:17,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 21:43:17,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 21:43:17,607 INFO L87 Difference]: Start difference. First operand 23427 states and 83180 transitions. Second operand 4 states. [2019-12-26 21:43:17,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:43:17,796 INFO L93 Difference]: Finished difference Result 33565 states and 114667 transitions. [2019-12-26 21:43:17,796 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 21:43:17,796 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 57 [2019-12-26 21:43:17,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:43:17,821 INFO L225 Difference]: With dead ends: 33565 [2019-12-26 21:43:17,821 INFO L226 Difference]: Without dead ends: 10964 [2019-12-26 21:43:17,821 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 21:43:17,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10964 states. [2019-12-26 21:43:17,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10964 to 10964. [2019-12-26 21:43:17,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10964 states. [2019-12-26 21:43:18,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10964 states to 10964 states and 33801 transitions. [2019-12-26 21:43:18,014 INFO L78 Accepts]: Start accepts. Automaton has 10964 states and 33801 transitions. Word has length 57 [2019-12-26 21:43:18,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:43:18,014 INFO L462 AbstractCegarLoop]: Abstraction has 10964 states and 33801 transitions. [2019-12-26 21:43:18,014 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 21:43:18,014 INFO L276 IsEmpty]: Start isEmpty. Operand 10964 states and 33801 transitions. [2019-12-26 21:43:18,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 21:43:18,032 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:43:18,032 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] [2019-12-26 21:43:18,032 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:43:18,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:43:18,033 INFO L82 PathProgramCache]: Analyzing trace with hash 719186054, now seen corresponding path program 2 times [2019-12-26 21:43:18,033 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:43:18,033 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328083775] [2019-12-26 21:43:18,033 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:43:18,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:43:18,165 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-26 21:43:18,165 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328083775] [2019-12-26 21:43:18,166 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:43:18,166 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:43:18,166 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892160120] [2019-12-26 21:43:18,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:43:18,166 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:43:18,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:43:18,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:43:18,167 INFO L87 Difference]: Start difference. First operand 10964 states and 33801 transitions. Second operand 9 states. [2019-12-26 21:43:20,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:43:20,173 INFO L93 Difference]: Finished difference Result 80963 states and 252225 transitions. [2019-12-26 21:43:20,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-26 21:43:20,173 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-26 21:43:20,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:43:20,259 INFO L225 Difference]: With dead ends: 80963 [2019-12-26 21:43:20,259 INFO L226 Difference]: Without dead ends: 56302 [2019-12-26 21:43:20,260 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 606 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=477, Invalid=1593, Unknown=0, NotChecked=0, Total=2070 [2019-12-26 21:43:20,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56302 states. [2019-12-26 21:43:20,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56302 to 13593. [2019-12-26 21:43:20,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13593 states. [2019-12-26 21:43:20,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13593 states to 13593 states and 42350 transitions. [2019-12-26 21:43:20,780 INFO L78 Accepts]: Start accepts. Automaton has 13593 states and 42350 transitions. Word has length 57 [2019-12-26 21:43:20,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:43:20,780 INFO L462 AbstractCegarLoop]: Abstraction has 13593 states and 42350 transitions. [2019-12-26 21:43:20,780 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:43:20,780 INFO L276 IsEmpty]: Start isEmpty. Operand 13593 states and 42350 transitions. [2019-12-26 21:43:20,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 21:43:20,794 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:43:20,794 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] [2019-12-26 21:43:20,794 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:43:20,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:43:20,795 INFO L82 PathProgramCache]: Analyzing trace with hash -1032821336, now seen corresponding path program 3 times [2019-12-26 21:43:20,795 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:43:20,795 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132693882] [2019-12-26 21:43:20,795 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:43:20,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:43:20,891 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-26 21:43:20,891 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132693882] [2019-12-26 21:43:20,892 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:43:20,892 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:43:20,892 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411198471] [2019-12-26 21:43:20,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:43:20,892 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:43:20,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:43:20,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:43:20,893 INFO L87 Difference]: Start difference. First operand 13593 states and 42350 transitions. Second operand 7 states. [2019-12-26 21:43:21,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:43:21,253 INFO L93 Difference]: Finished difference Result 35767 states and 109392 transitions. [2019-12-26 21:43:21,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 21:43:21,253 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-26 21:43:21,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:43:21,314 INFO L225 Difference]: With dead ends: 35767 [2019-12-26 21:43:21,314 INFO L226 Difference]: Without dead ends: 25000 [2019-12-26 21:43:21,315 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-26 21:43:21,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25000 states. [2019-12-26 21:43:21,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25000 to 16351. [2019-12-26 21:43:21,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16351 states. [2019-12-26 21:43:21,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16351 states to 16351 states and 50702 transitions. [2019-12-26 21:43:21,793 INFO L78 Accepts]: Start accepts. Automaton has 16351 states and 50702 transitions. Word has length 57 [2019-12-26 21:43:21,794 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:43:21,794 INFO L462 AbstractCegarLoop]: Abstraction has 16351 states and 50702 transitions. [2019-12-26 21:43:21,794 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:43:21,794 INFO L276 IsEmpty]: Start isEmpty. Operand 16351 states and 50702 transitions. [2019-12-26 21:43:21,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 21:43:21,810 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:43:21,810 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] [2019-12-26 21:43:21,810 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:43:21,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:43:21,811 INFO L82 PathProgramCache]: Analyzing trace with hash 315127332, now seen corresponding path program 4 times [2019-12-26 21:43:21,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:43:21,811 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653202780] [2019-12-26 21:43:21,811 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:43:21,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:43:21,983 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-26 21:43:21,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653202780] [2019-12-26 21:43:21,984 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:43:21,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:43:21,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515344003] [2019-12-26 21:43:21,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:43:21,985 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:43:21,985 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:43:21,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:43:21,985 INFO L87 Difference]: Start difference. First operand 16351 states and 50702 transitions. Second operand 9 states. [2019-12-26 21:43:23,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:43:23,904 INFO L93 Difference]: Finished difference Result 95460 states and 296034 transitions. [2019-12-26 21:43:23,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 45 states. [2019-12-26 21:43:23,905 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 57 [2019-12-26 21:43:23,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:43:24,032 INFO L225 Difference]: With dead ends: 95460 [2019-12-26 21:43:24,033 INFO L226 Difference]: Without dead ends: 78835 [2019-12-26 21:43:24,034 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 631 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=454, Invalid=1616, Unknown=0, NotChecked=0, Total=2070 [2019-12-26 21:43:24,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78835 states. [2019-12-26 21:43:24,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78835 to 21627. [2019-12-26 21:43:24,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21627 states. [2019-12-26 21:43:25,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21627 states to 21627 states and 67322 transitions. [2019-12-26 21:43:25,030 INFO L78 Accepts]: Start accepts. Automaton has 21627 states and 67322 transitions. Word has length 57 [2019-12-26 21:43:25,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:43:25,030 INFO L462 AbstractCegarLoop]: Abstraction has 21627 states and 67322 transitions. [2019-12-26 21:43:25,031 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:43:25,031 INFO L276 IsEmpty]: Start isEmpty. Operand 21627 states and 67322 transitions. [2019-12-26 21:43:25,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 21:43:25,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:43:25,055 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] [2019-12-26 21:43:25,056 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:43:25,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:43:25,056 INFO L82 PathProgramCache]: Analyzing trace with hash 57637352, now seen corresponding path program 5 times [2019-12-26 21:43:25,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:43:25,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763770601] [2019-12-26 21:43:25,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:43:25,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:43:25,128 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-26 21:43:25,128 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763770601] [2019-12-26 21:43:25,128 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:43:25,129 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 21:43:25,129 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434378558] [2019-12-26 21:43:25,129 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 21:43:25,129 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:43:25,130 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 21:43:25,130 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 21:43:25,130 INFO L87 Difference]: Start difference. First operand 21627 states and 67322 transitions. Second operand 7 states. [2019-12-26 21:43:25,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:43:25,557 INFO L93 Difference]: Finished difference Result 40740 states and 124618 transitions. [2019-12-26 21:43:25,557 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 21:43:25,557 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 57 [2019-12-26 21:43:25,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:43:25,630 INFO L225 Difference]: With dead ends: 40740 [2019-12-26 21:43:25,630 INFO L226 Difference]: Without dead ends: 35500 [2019-12-26 21:43:25,630 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 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-26 21:43:25,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35500 states. [2019-12-26 21:43:26,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35500 to 21867. [2019-12-26 21:43:26,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21867 states. [2019-12-26 21:43:26,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21867 states to 21867 states and 68068 transitions. [2019-12-26 21:43:26,074 INFO L78 Accepts]: Start accepts. Automaton has 21867 states and 68068 transitions. Word has length 57 [2019-12-26 21:43:26,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:43:26,075 INFO L462 AbstractCegarLoop]: Abstraction has 21867 states and 68068 transitions. [2019-12-26 21:43:26,075 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 21:43:26,075 INFO L276 IsEmpty]: Start isEmpty. Operand 21867 states and 68068 transitions. [2019-12-26 21:43:26,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2019-12-26 21:43:26,099 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:43:26,099 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] [2019-12-26 21:43:26,099 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:43:26,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:43:26,099 INFO L82 PathProgramCache]: Analyzing trace with hash 841823262, now seen corresponding path program 6 times [2019-12-26 21:43:26,100 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:43:26,100 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817604937] [2019-12-26 21:43:26,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:43:26,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:43:26,149 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-26 21:43:26,149 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817604937] [2019-12-26 21:43:26,149 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:43:26,149 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:43:26,150 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167453321] [2019-12-26 21:43:26,150 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:43:26,150 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:43:26,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:43:26,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:43:26,151 INFO L87 Difference]: Start difference. First operand 21867 states and 68068 transitions. Second operand 3 states. [2019-12-26 21:43:26,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:43:26,237 INFO L93 Difference]: Finished difference Result 19943 states and 60935 transitions. [2019-12-26 21:43:26,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:43:26,238 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 57 [2019-12-26 21:43:26,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:43:26,272 INFO L225 Difference]: With dead ends: 19943 [2019-12-26 21:43:26,272 INFO L226 Difference]: Without dead ends: 19943 [2019-12-26 21:43:26,273 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-26 21:43:26,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19943 states. [2019-12-26 21:43:26,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19943 to 19142. [2019-12-26 21:43:26,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19142 states. [2019-12-26 21:43:26,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19142 states to 19142 states and 58299 transitions. [2019-12-26 21:43:26,747 INFO L78 Accepts]: Start accepts. Automaton has 19142 states and 58299 transitions. Word has length 57 [2019-12-26 21:43:26,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:43:26,747 INFO L462 AbstractCegarLoop]: Abstraction has 19142 states and 58299 transitions. [2019-12-26 21:43:26,747 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:43:26,747 INFO L276 IsEmpty]: Start isEmpty. Operand 19142 states and 58299 transitions. [2019-12-26 21:43:26,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 21:43:26,768 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:43:26,769 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] [2019-12-26 21:43:26,769 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:43:26,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:43:26,769 INFO L82 PathProgramCache]: Analyzing trace with hash -531606549, now seen corresponding path program 1 times [2019-12-26 21:43:26,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:43:26,770 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878364694] [2019-12-26 21:43:26,770 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:43:26,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:43:26,889 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-26 21:43:26,889 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878364694] [2019-12-26 21:43:26,889 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:43:26,889 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:43:26,890 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993997788] [2019-12-26 21:43:26,890 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 21:43:26,890 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:43:26,890 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 21:43:26,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 21:43:26,891 INFO L87 Difference]: Start difference. First operand 19142 states and 58299 transitions. Second operand 9 states. [2019-12-26 21:43:28,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:43:28,261 INFO L93 Difference]: Finished difference Result 33710 states and 102184 transitions. [2019-12-26 21:43:28,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 21:43:28,261 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 58 [2019-12-26 21:43:28,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:43:28,301 INFO L225 Difference]: With dead ends: 33710 [2019-12-26 21:43:28,302 INFO L226 Difference]: Without dead ends: 26827 [2019-12-26 21:43:28,302 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=100, Invalid=362, Unknown=0, NotChecked=0, Total=462 [2019-12-26 21:43:28,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26827 states. [2019-12-26 21:43:28,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26827 to 19493. [2019-12-26 21:43:28,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19493 states. [2019-12-26 21:43:28,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19493 states to 19493 states and 59099 transitions. [2019-12-26 21:43:28,668 INFO L78 Accepts]: Start accepts. Automaton has 19493 states and 59099 transitions. Word has length 58 [2019-12-26 21:43:28,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:43:28,668 INFO L462 AbstractCegarLoop]: Abstraction has 19493 states and 59099 transitions. [2019-12-26 21:43:28,668 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 21:43:28,668 INFO L276 IsEmpty]: Start isEmpty. Operand 19493 states and 59099 transitions. [2019-12-26 21:43:28,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 21:43:28,691 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:43:28,692 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] [2019-12-26 21:43:28,692 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:43:28,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:43:28,692 INFO L82 PathProgramCache]: Analyzing trace with hash -48042617, now seen corresponding path program 2 times [2019-12-26 21:43:28,692 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:43:28,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127233416] [2019-12-26 21:43:28,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:43:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:43:28,826 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-26 21:43:28,827 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127233416] [2019-12-26 21:43:28,827 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:43:28,827 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:43:28,827 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629903016] [2019-12-26 21:43:28,828 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:43:28,828 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:43:28,828 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:43:28,829 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:43:28,829 INFO L87 Difference]: Start difference. First operand 19493 states and 59099 transitions. Second operand 10 states. [2019-12-26 21:43:29,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:43:29,738 INFO L93 Difference]: Finished difference Result 36456 states and 109899 transitions. [2019-12-26 21:43:29,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-26 21:43:29,738 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-26 21:43:29,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:43:29,782 INFO L225 Difference]: With dead ends: 36456 [2019-12-26 21:43:29,783 INFO L226 Difference]: Without dead ends: 30289 [2019-12-26 21:43:29,783 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=162, Invalid=650, Unknown=0, NotChecked=0, Total=812 [2019-12-26 21:43:29,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30289 states. [2019-12-26 21:43:30,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30289 to 19255. [2019-12-26 21:43:30,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19255 states. [2019-12-26 21:43:30,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19255 states to 19255 states and 58219 transitions. [2019-12-26 21:43:30,304 INFO L78 Accepts]: Start accepts. Automaton has 19255 states and 58219 transitions. Word has length 58 [2019-12-26 21:43:30,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:43:30,305 INFO L462 AbstractCegarLoop]: Abstraction has 19255 states and 58219 transitions. [2019-12-26 21:43:30,305 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:43:30,305 INFO L276 IsEmpty]: Start isEmpty. Operand 19255 states and 58219 transitions. [2019-12-26 21:43:30,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 21:43:30,326 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:43:30,326 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] [2019-12-26 21:43:30,326 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:43:30,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:43:30,327 INFO L82 PathProgramCache]: Analyzing trace with hash -330235761, now seen corresponding path program 3 times [2019-12-26 21:43:30,327 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:43:30,327 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176601050] [2019-12-26 21:43:30,327 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:43:30,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:43:30,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-26 21:43:30,831 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176601050] [2019-12-26 21:43:30,831 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:43:30,831 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-26 21:43:30,831 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891125082] [2019-12-26 21:43:30,831 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 21:43:30,832 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:43:30,832 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 21:43:30,832 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2019-12-26 21:43:30,832 INFO L87 Difference]: Start difference. First operand 19255 states and 58219 transitions. Second operand 16 states. [2019-12-26 21:43:33,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:43:33,543 INFO L93 Difference]: Finished difference Result 25054 states and 75224 transitions. [2019-12-26 21:43:33,543 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2019-12-26 21:43:33,544 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 58 [2019-12-26 21:43:33,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:43:33,580 INFO L225 Difference]: With dead ends: 25054 [2019-12-26 21:43:33,580 INFO L226 Difference]: Without dead ends: 23970 [2019-12-26 21:43:33,581 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 0 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=192, Invalid=800, Unknown=0, NotChecked=0, Total=992 [2019-12-26 21:43:33,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23970 states. [2019-12-26 21:43:33,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23970 to 19339. [2019-12-26 21:43:33,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19339 states. [2019-12-26 21:43:33,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19339 states to 19339 states and 58421 transitions. [2019-12-26 21:43:33,925 INFO L78 Accepts]: Start accepts. Automaton has 19339 states and 58421 transitions. Word has length 58 [2019-12-26 21:43:33,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:43:33,925 INFO L462 AbstractCegarLoop]: Abstraction has 19339 states and 58421 transitions. [2019-12-26 21:43:33,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 21:43:33,925 INFO L276 IsEmpty]: Start isEmpty. Operand 19339 states and 58421 transitions. [2019-12-26 21:43:33,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 21:43:33,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:43:33,946 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] [2019-12-26 21:43:33,946 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:43:33,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:43:33,946 INFO L82 PathProgramCache]: Analyzing trace with hash -194102625, now seen corresponding path program 4 times [2019-12-26 21:43:33,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:43:33,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303508659] [2019-12-26 21:43:33,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:43:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:43:34,076 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-26 21:43:34,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303508659] [2019-12-26 21:43:34,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:43:34,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 21:43:34,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132359100] [2019-12-26 21:43:34,078 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-26 21:43:34,078 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:43:34,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-26 21:43:34,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-26 21:43:34,079 INFO L87 Difference]: Start difference. First operand 19339 states and 58421 transitions. Second operand 8 states. [2019-12-26 21:43:36,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:43:36,745 INFO L93 Difference]: Finished difference Result 41938 states and 125949 transitions. [2019-12-26 21:43:36,746 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-26 21:43:36,746 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2019-12-26 21:43:36,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:43:36,803 INFO L225 Difference]: With dead ends: 41938 [2019-12-26 21:43:36,803 INFO L226 Difference]: Without dead ends: 41716 [2019-12-26 21:43:36,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 11 SyntacticMatches, 2 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=255, Invalid=935, Unknown=0, NotChecked=0, Total=1190 [2019-12-26 21:43:36,918 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41716 states. [2019-12-26 21:43:37,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41716 to 22517. [2019-12-26 21:43:37,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22517 states. [2019-12-26 21:43:37,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22517 states to 22517 states and 68561 transitions. [2019-12-26 21:43:37,294 INFO L78 Accepts]: Start accepts. Automaton has 22517 states and 68561 transitions. Word has length 58 [2019-12-26 21:43:37,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:43:37,295 INFO L462 AbstractCegarLoop]: Abstraction has 22517 states and 68561 transitions. [2019-12-26 21:43:37,295 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-26 21:43:37,295 INFO L276 IsEmpty]: Start isEmpty. Operand 22517 states and 68561 transitions. [2019-12-26 21:43:37,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 21:43:37,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:43:37,318 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] [2019-12-26 21:43:37,318 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:43:37,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:43:37,318 INFO L82 PathProgramCache]: Analyzing trace with hash 166533569, now seen corresponding path program 5 times [2019-12-26 21:43:37,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:43:37,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109606663] [2019-12-26 21:43:37,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:43:37,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:43:37,499 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-26 21:43:37,500 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [109606663] [2019-12-26 21:43:37,500 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:43:37,500 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:43:37,500 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979563283] [2019-12-26 21:43:37,501 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 21:43:37,501 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:43:37,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 21:43:37,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2019-12-26 21:43:37,503 INFO L87 Difference]: Start difference. First operand 22517 states and 68561 transitions. Second operand 10 states. [2019-12-26 21:43:41,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:43:41,031 INFO L93 Difference]: Finished difference Result 51982 states and 154967 transitions. [2019-12-26 21:43:41,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-26 21:43:41,032 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 58 [2019-12-26 21:43:41,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:43:41,108 INFO L225 Difference]: With dead ends: 51982 [2019-12-26 21:43:41,108 INFO L226 Difference]: Without dead ends: 51982 [2019-12-26 21:43:41,109 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 12 SyntacticMatches, 2 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 510 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=351, Invalid=1371, Unknown=0, NotChecked=0, Total=1722 [2019-12-26 21:43:41,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51982 states. [2019-12-26 21:43:41,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51982 to 22162. [2019-12-26 21:43:41,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22162 states. [2019-12-26 21:43:41,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22162 states to 22162 states and 67454 transitions. [2019-12-26 21:43:41,672 INFO L78 Accepts]: Start accepts. Automaton has 22162 states and 67454 transitions. Word has length 58 [2019-12-26 21:43:41,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:43:41,672 INFO L462 AbstractCegarLoop]: Abstraction has 22162 states and 67454 transitions. [2019-12-26 21:43:41,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 21:43:41,672 INFO L276 IsEmpty]: Start isEmpty. Operand 22162 states and 67454 transitions. [2019-12-26 21:43:41,695 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 21:43:41,695 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:43:41,695 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] [2019-12-26 21:43:41,695 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:43:41,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:43:41,696 INFO L82 PathProgramCache]: Analyzing trace with hash -265896589, now seen corresponding path program 6 times [2019-12-26 21:43:41,696 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:43:41,696 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59658584] [2019-12-26 21:43:41,696 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:43:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:43:41,862 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-26 21:43:41,863 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59658584] [2019-12-26 21:43:41,863 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:43:41,863 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:43:41,863 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337256011] [2019-12-26 21:43:41,864 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:43:41,864 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:43:41,864 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:43:41,864 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:43:41,865 INFO L87 Difference]: Start difference. First operand 22162 states and 67454 transitions. Second operand 11 states. [2019-12-26 21:43:42,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:43:42,944 INFO L93 Difference]: Finished difference Result 38020 states and 115720 transitions. [2019-12-26 21:43:42,944 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 21:43:42,945 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-26 21:43:42,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:43:42,997 INFO L225 Difference]: With dead ends: 38020 [2019-12-26 21:43:42,997 INFO L226 Difference]: Without dead ends: 37402 [2019-12-26 21:43:42,998 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=572, Unknown=0, NotChecked=0, Total=702 [2019-12-26 21:43:43,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37402 states. [2019-12-26 21:43:43,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37402 to 24523. [2019-12-26 21:43:43,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24523 states. [2019-12-26 21:43:43,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24523 states to 24523 states and 74499 transitions. [2019-12-26 21:43:43,517 INFO L78 Accepts]: Start accepts. Automaton has 24523 states and 74499 transitions. Word has length 58 [2019-12-26 21:43:43,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:43:43,517 INFO L462 AbstractCegarLoop]: Abstraction has 24523 states and 74499 transitions. [2019-12-26 21:43:43,517 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:43:43,517 INFO L276 IsEmpty]: Start isEmpty. Operand 24523 states and 74499 transitions. [2019-12-26 21:43:43,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 21:43:43,549 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:43:43,550 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] [2019-12-26 21:43:43,550 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:43:43,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:43:43,550 INFO L82 PathProgramCache]: Analyzing trace with hash -642624699, now seen corresponding path program 7 times [2019-12-26 21:43:43,550 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:43:43,551 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1605286886] [2019-12-26 21:43:43,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:43:43,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:43:43,718 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-26 21:43:43,718 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1605286886] [2019-12-26 21:43:43,719 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:43:43,719 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 21:43:43,719 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526165329] [2019-12-26 21:43:43,721 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 21:43:43,721 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:43:43,721 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 21:43:43,722 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 21:43:43,722 INFO L87 Difference]: Start difference. First operand 24523 states and 74499 transitions. Second operand 11 states. [2019-12-26 21:43:44,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:43:44,576 INFO L93 Difference]: Finished difference Result 37876 states and 114725 transitions. [2019-12-26 21:43:44,576 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2019-12-26 21:43:44,576 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 58 [2019-12-26 21:43:44,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:43:44,624 INFO L225 Difference]: With dead ends: 37876 [2019-12-26 21:43:44,624 INFO L226 Difference]: Without dead ends: 34812 [2019-12-26 21:43:44,625 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=478, Unknown=0, NotChecked=0, Total=600 [2019-12-26 21:43:44,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34812 states. [2019-12-26 21:43:45,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34812 to 21769. [2019-12-26 21:43:45,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21769 states. [2019-12-26 21:43:45,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21769 states to 21769 states and 66274 transitions. [2019-12-26 21:43:45,195 INFO L78 Accepts]: Start accepts. Automaton has 21769 states and 66274 transitions. Word has length 58 [2019-12-26 21:43:45,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:43:45,195 INFO L462 AbstractCegarLoop]: Abstraction has 21769 states and 66274 transitions. [2019-12-26 21:43:45,195 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 21:43:45,196 INFO L276 IsEmpty]: Start isEmpty. Operand 21769 states and 66274 transitions. [2019-12-26 21:43:45,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-12-26 21:43:45,225 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:43:45,225 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] [2019-12-26 21:43:45,225 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:43:45,226 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:43:45,226 INFO L82 PathProgramCache]: Analyzing trace with hash -949890779, now seen corresponding path program 8 times [2019-12-26 21:43:45,226 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:43:45,226 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1178241502] [2019-12-26 21:43:45,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:43:45,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:43:45,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 21:43:45,277 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1178241502] [2019-12-26 21:43:45,278 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:43:45,278 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 21:43:45,278 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833172966] [2019-12-26 21:43:45,278 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 21:43:45,279 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:43:45,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 21:43:45,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 21:43:45,279 INFO L87 Difference]: Start difference. First operand 21769 states and 66274 transitions. Second operand 3 states. [2019-12-26 21:43:45,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:43:45,374 INFO L93 Difference]: Finished difference Result 21767 states and 66269 transitions. [2019-12-26 21:43:45,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 21:43:45,375 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 58 [2019-12-26 21:43:45,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:43:45,419 INFO L225 Difference]: With dead ends: 21767 [2019-12-26 21:43:45,420 INFO L226 Difference]: Without dead ends: 21767 [2019-12-26 21:43:45,420 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-26 21:43:45,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21767 states. [2019-12-26 21:43:45,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21767 to 20243. [2019-12-26 21:43:45,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20243 states. [2019-12-26 21:43:45,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20243 states to 20243 states and 62191 transitions. [2019-12-26 21:43:45,770 INFO L78 Accepts]: Start accepts. Automaton has 20243 states and 62191 transitions. Word has length 58 [2019-12-26 21:43:45,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:43:45,770 INFO L462 AbstractCegarLoop]: Abstraction has 20243 states and 62191 transitions. [2019-12-26 21:43:45,770 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 21:43:45,770 INFO L276 IsEmpty]: Start isEmpty. Operand 20243 states and 62191 transitions. [2019-12-26 21:43:45,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 21:43:45,790 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:43:45,791 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] [2019-12-26 21:43:45,791 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:43:45,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:43:45,791 INFO L82 PathProgramCache]: Analyzing trace with hash -152494338, now seen corresponding path program 1 times [2019-12-26 21:43:45,791 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:43:45,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424588223] [2019-12-26 21:43:45,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:43:45,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 21:43:45,983 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-26 21:43:45,983 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424588223] [2019-12-26 21:43:45,983 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 21:43:45,984 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 21:43:45,984 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110981642] [2019-12-26 21:43:45,984 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 21:43:45,984 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 21:43:45,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 21:43:45,985 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 21:43:45,985 INFO L87 Difference]: Start difference. First operand 20243 states and 62191 transitions. Second operand 12 states. [2019-12-26 21:43:46,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 21:43:46,973 INFO L93 Difference]: Finished difference Result 31555 states and 96801 transitions. [2019-12-26 21:43:46,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 21:43:46,974 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 59 [2019-12-26 21:43:46,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 21:43:47,020 INFO L225 Difference]: With dead ends: 31555 [2019-12-26 21:43:47,020 INFO L226 Difference]: Without dead ends: 31231 [2019-12-26 21:43:47,020 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=569, Unknown=0, NotChecked=0, Total=702 [2019-12-26 21:43:47,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31231 states. [2019-12-26 21:43:47,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31231 to 20049. [2019-12-26 21:43:47,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20049 states. [2019-12-26 21:43:47,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20049 states to 20049 states and 61716 transitions. [2019-12-26 21:43:47,590 INFO L78 Accepts]: Start accepts. Automaton has 20049 states and 61716 transitions. Word has length 59 [2019-12-26 21:43:47,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 21:43:47,590 INFO L462 AbstractCegarLoop]: Abstraction has 20049 states and 61716 transitions. [2019-12-26 21:43:47,590 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 21:43:47,590 INFO L276 IsEmpty]: Start isEmpty. Operand 20049 states and 61716 transitions. [2019-12-26 21:43:47,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 21:43:47,609 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 21:43:47,610 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] [2019-12-26 21:43:47,610 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P2Err0ASSERT_VIOLATIONERROR_FUNCTION, P2Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 21:43:47,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 21:43:47,610 INFO L82 PathProgramCache]: Analyzing trace with hash -300648998, now seen corresponding path program 2 times [2019-12-26 21:43:47,610 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 21:43:47,610 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093582816] [2019-12-26 21:43:47,610 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 21:43:47,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:43:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 21:43:47,712 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 21:43:47,712 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 21:43:47,716 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [857] [857] ULTIMATE.startENTRY-->L845: Formula: (let ((.cse0 (store |v_#valid_101| 0 0))) (and (= 0 v_~y$r_buff0_thd3~0_200) (= v_~weak$$choice2~0_146 0) (= v_~z~0_79 0) (= 0 v_~y$read_delayed_var~0.offset_7) (= |v_#length_31| (store |v_#length_32| |v_ULTIMATE.start_main_~#t453~0.base_42| 4)) (= |v_#NULL.offset_6| 0) (= v_~y$read_delayed~0_7 0) (= v_~y$w_buff0_used~0_906 0) (= v_~__unbuffered_cnt~0_174 0) (= |v_#memory_int_21| (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t453~0.base_42| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t453~0.base_42|) |v_ULTIMATE.start_main_~#t453~0.offset_27| 0))) (= v_~main$tmp_guard1~0_51 0) (= 0 v_~__unbuffered_p3_EAX~0_50) (= 0 |v_ULTIMATE.start_main_~#t453~0.offset_27|) (= 0 v_~__unbuffered_p2_EAX~0_106) (= 0 v_~y$r_buff0_thd2~0_339) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t453~0.base_42|) (= v_~y$mem_tmp~0_18 0) (= 0 v_~__unbuffered_p1_EAX~0_54) (= 0 v_~y$r_buff1_thd4~0_165) (= 0 v_~y$w_buff0~0_533) (= 0 v_~y$r_buff1_thd2~0_235) (= 0 v_~__unbuffered_p3_EBX~0_50) (= 0 |v_#NULL.base_6|) (= v_~y$w_buff1~0_348 0) (= 0 v_~y$r_buff0_thd4~0_151) (= 0 v_~y$read_delayed_var~0.base_7) (= 0 v_~__unbuffered_p0_EAX~0_64) (< 0 |v_#StackHeapBarrier_20|) (= 0 v_~weak$$choice0~0_16) (= v_~a~0_35 0) (= v_~main$tmp_guard0~0_21 0) (= 0 v_~y$flush_delayed~0_42) (= (select .cse0 |v_ULTIMATE.start_main_~#t453~0.base_42|) 0) (= v_~x~0_39 0) (= v_~y$r_buff0_thd1~0_73 0) (= 0 v_~y$r_buff1_thd1~0_74) (= v_~y~0_158 0) (= v_~y$r_buff1_thd0~0_169 0) (= v_~y$r_buff0_thd0~0_171 0) (= |v_#valid_99| (store .cse0 |v_ULTIMATE.start_main_~#t453~0.base_42| 1)) (= v_~y$w_buff1_used~0_540 0) (= 0 v_~y$r_buff1_thd3~0_136))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_101|, #memory_int=|v_#memory_int_22|, #length=|v_#length_32|} OutVars{ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_110|, #NULL.offset=|v_#NULL.offset_6|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_39|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_43|, ULTIMATE.start_main_~#t455~0.offset=|v_ULTIMATE.start_main_~#t455~0.offset_18|, ~y$read_delayed~0=v_~y$read_delayed~0_7, ~a~0=v_~a~0_35, ~y$mem_tmp~0=v_~y$mem_tmp~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_64, ~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_136, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_54, ~y$r_buff0_thd1~0=v_~y$r_buff0_thd1~0_73, ~y$flush_delayed~0=v_~y$flush_delayed~0_42, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_50, #length=|v_#length_31|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_106, ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_21|, ULTIMATE.start_main_~#t456~0.base=|v_ULTIMATE.start_main_~#t456~0.base_25|, ~weak$$choice0~0=v_~weak$$choice0~0_16, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_165, ~y$w_buff1~0=v_~y$w_buff1~0_348, ~y$read_delayed_var~0.base=v_~y$read_delayed_var~0.base_7, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_339, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_9|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_174, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_169, ~x~0=v_~x~0_39, ULTIMATE.start_main_~#t456~0.offset=|v_ULTIMATE.start_main_~#t456~0.offset_19|, ~y$read_delayed_var~0.offset=v_~y$read_delayed_var~0.offset_7, ~y$w_buff0_used~0=v_~y$w_buff0_used~0_906, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_51, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_41|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_239|, ~y$r_buff1_thd1~0=v_~y$r_buff1_thd1~0_74, ~y$w_buff0~0=v_~y$w_buff0~0_533, ~y$r_buff0_thd3~0=v_~y$r_buff0_thd3~0_200, ULTIMATE.start_main_~#t455~0.base=|v_ULTIMATE.start_main_~#t455~0.base_24|, ~y~0=v_~y~0_158, ULTIMATE.start_main_~#t454~0.offset=|v_ULTIMATE.start_main_~#t454~0.offset_19|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_10|, ULTIMATE.start_main_~#t453~0.base=|v_ULTIMATE.start_main_~#t453~0.base_42|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_50, ULTIMATE.start_main_~#t453~0.offset=|v_ULTIMATE.start_main_~#t453~0.offset_27|, #NULL.base=|v_#NULL.base_6|, ~y$r_buff1_thd2~0=v_~y$r_buff1_thd2~0_235, ~y$r_buff0_thd4~0=v_~y$r_buff0_thd4~0_151, ULTIMATE.start_main_~#t454~0.base=|v_ULTIMATE.start_main_~#t454~0.base_34|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_33|, ~y$r_buff0_thd0~0=v_~y$r_buff0_thd0~0_171, #valid=|v_#valid_99|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_9|, ~z~0=v_~z~0_79, ~weak$$choice2~0=v_~weak$$choice2~0_146, ~y$w_buff1_used~0=v_~y$w_buff1_used~0_540} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_~#t455~0.offset, ~y$read_delayed~0, ~a~0, ~y$mem_tmp~0, ~__unbuffered_p0_EAX~0, ~y$r_buff1_thd3~0, ~__unbuffered_p1_EAX~0, ~y$r_buff0_thd1~0, ~y$flush_delayed~0, ~__unbuffered_p3_EAX~0, #length, ~__unbuffered_p2_EAX~0, ULTIMATE.start_main_#t~nondet41, ULTIMATE.start_main_~#t456~0.base, ~weak$$choice0~0, ~y$r_buff1_thd4~0, ~y$w_buff1~0, ~y$read_delayed_var~0.base, ~y$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~y$r_buff1_thd0~0, ~x~0, ULTIMATE.start_main_~#t456~0.offset, ~y$read_delayed_var~0.offset, ~y$w_buff0_used~0, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ~y$r_buff1_thd1~0, ~y$w_buff0~0, ~y$r_buff0_thd3~0, ULTIMATE.start_main_~#t455~0.base, ~y~0, ULTIMATE.start_main_~#t454~0.offset, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t453~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_~#t453~0.offset, #NULL.base, ~y$r_buff1_thd2~0, ~y$r_buff0_thd4~0, ULTIMATE.start_main_~#t454~0.base, ULTIMATE.start_main_#res, ~y$r_buff0_thd0~0, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 21:43:47,717 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [811] [811] L845-1-->L847: Formula: (and (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t454~0.base_11| 4) |v_#length_23|) (= |v_ULTIMATE.start_main_~#t454~0.offset_10| 0) (= 0 (select |v_#valid_44| |v_ULTIMATE.start_main_~#t454~0.base_11|)) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t454~0.base_11|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t454~0.base_11| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t454~0.base_11|) |v_ULTIMATE.start_main_~#t454~0.offset_10| 1)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t454~0.base_11|)) (= |v_#valid_43| (store |v_#valid_44| |v_ULTIMATE.start_main_~#t454~0.base_11| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_18|, #length=|v_#length_24|} OutVars{ULTIMATE.start_main_~#t454~0.base=|v_ULTIMATE.start_main_~#t454~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_43|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_23|, ULTIMATE.start_main_~#t454~0.offset=|v_ULTIMATE.start_main_~#t454~0.offset_10|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t454~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length, ULTIMATE.start_main_~#t454~0.offset] because there is no mapped edge [2019-12-26 21:43:47,718 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [808] [808] L847-1-->L849: Formula: (and (= |v_#length_19| (store |v_#length_20| |v_ULTIMATE.start_main_~#t455~0.base_10| 4)) (= 0 |v_ULTIMATE.start_main_~#t455~0.offset_9|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t455~0.base_10|) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t455~0.base_10| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t455~0.base_10|) |v_ULTIMATE.start_main_~#t455~0.offset_9| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t455~0.base_10| 0)) (= 0 (select |v_#valid_40| |v_ULTIMATE.start_main_~#t455~0.base_10|)) (= (store |v_#valid_40| |v_ULTIMATE.start_main_~#t455~0.base_10| 1) |v_#valid_39|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_40|, #memory_int=|v_#memory_int_14|, #length=|v_#length_20|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t455~0.base=|v_ULTIMATE.start_main_~#t455~0.base_10|, #length=|v_#length_19|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t455~0.offset=|v_ULTIMATE.start_main_~#t455~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t455~0.base, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t455~0.offset] because there is no mapped edge [2019-12-26 21:43:47,719 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] P2ENTRY-->L4-3: Formula: (and (= ~y$w_buff0~0_In1239712218 ~y$w_buff1~0_Out1239712218) (= P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out1239712218 |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out1239712218|) (= P2Thread1of1ForFork3_~arg.offset_Out1239712218 |P2Thread1of1ForFork3_#in~arg.offset_In1239712218|) (= |P2Thread1of1ForFork3_#in~arg.base_In1239712218| P2Thread1of1ForFork3_~arg.base_Out1239712218) (= ~y$w_buff0_used~0_Out1239712218 1) (= 1 |P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out1239712218|) (= 1 ~y$w_buff0~0_Out1239712218) (= ~y$w_buff1_used~0_Out1239712218 ~y$w_buff0_used~0_In1239712218) (= 0 (mod ~y$w_buff1_used~0_Out1239712218 256))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1239712218, ~y$w_buff0~0=~y$w_buff0~0_In1239712218, P2Thread1of1ForFork3_#in~arg.base=|P2Thread1of1ForFork3_#in~arg.base_In1239712218|, P2Thread1of1ForFork3_#in~arg.offset=|P2Thread1of1ForFork3_#in~arg.offset_In1239712218|} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_Out1239712218, ~y$w_buff1~0=~y$w_buff1~0_Out1239712218, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression=|P2Thread1of1ForFork3___VERIFIER_assert_#in~expression_Out1239712218|, ~y$w_buff0~0=~y$w_buff0~0_Out1239712218, P2Thread1of1ForFork3_~arg.base=P2Thread1of1ForFork3_~arg.base_Out1239712218, P2Thread1of1ForFork3___VERIFIER_assert_~expression=P2Thread1of1ForFork3___VERIFIER_assert_~expression_Out1239712218, P2Thread1of1ForFork3_#in~arg.base=|P2Thread1of1ForFork3_#in~arg.base_In1239712218|, P2Thread1of1ForFork3_~arg.offset=P2Thread1of1ForFork3_~arg.offset_Out1239712218, P2Thread1of1ForFork3_#in~arg.offset=|P2Thread1of1ForFork3_#in~arg.offset_In1239712218|, ~y$w_buff1_used~0=~y$w_buff1_used~0_Out1239712218} AuxVars[] AssignedVars[~y$w_buff0_used~0, ~y$w_buff1~0, P2Thread1of1ForFork3___VERIFIER_assert_#in~expression, ~y$w_buff0~0, P2Thread1of1ForFork3_~arg.base, P2Thread1of1ForFork3___VERIFIER_assert_~expression, P2Thread1of1ForFork3_~arg.offset, ~y$w_buff1_used~0] because there is no mapped edge [2019-12-26 21:43:47,721 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [809] [809] L849-1-->L851: Formula: (and (= |v_ULTIMATE.start_main_~#t456~0.offset_11| 0) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t456~0.base_13| 4) |v_#length_21|) (= (store |v_#valid_42| |v_ULTIMATE.start_main_~#t456~0.base_13| 1) |v_#valid_41|) (= 0 (select |v_#valid_42| |v_ULTIMATE.start_main_~#t456~0.base_13|)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t456~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t456~0.base_13|) |v_ULTIMATE.start_main_~#t456~0.offset_11| 3)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t456~0.base_13|) (not (= 0 |v_ULTIMATE.start_main_~#t456~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_42|, #memory_int=|v_#memory_int_16|, #length=|v_#length_22|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ULTIMATE.start_main_~#t456~0.base=|v_ULTIMATE.start_main_~#t456~0.base_13|, #valid=|v_#valid_41|, #memory_int=|v_#memory_int_15|, #length=|v_#length_21|, ULTIMATE.start_main_~#t456~0.offset=|v_ULTIMATE.start_main_~#t456~0.offset_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t456~0.base, #valid, #memory_int, #length, ULTIMATE.start_main_~#t456~0.offset] because there is no mapped edge [2019-12-26 21:43:47,723 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] P0ENTRY-->P0EXIT: Formula: (and (= v_~x~0_23 v_~__unbuffered_p0_EAX~0_23) (= v_P0Thread1of1ForFork1_~arg.offset_15 |v_P0Thread1of1ForFork1_#in~arg.offset_15|) (= |v_P0Thread1of1ForFork1_#in~arg.base_15| v_P0Thread1of1ForFork1_~arg.base_15) (= 0 |v_P0Thread1of1ForFork1_#res.offset_7|) (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P0Thread1of1ForFork1_#res.base_7|) (= v_~a~0_19 1)) InVars {P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_23} OutVars{~a~0=v_~a~0_19, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_23, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_7|, P0Thread1of1ForFork1_#in~arg.offset=|v_P0Thread1of1ForFork1_#in~arg.offset_15|, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_7|, P0Thread1of1ForFork1_~arg.offset=v_P0Thread1of1ForFork1_~arg.offset_15, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P0Thread1of1ForFork1_#in~arg.base=|v_P0Thread1of1ForFork1_#in~arg.base_15|, ~x~0=v_~x~0_23, P0Thread1of1ForFork1_~arg.base=v_P0Thread1of1ForFork1_~arg.base_15} AuxVars[] AssignedVars[~a~0, ~__unbuffered_p0_EAX~0, P0Thread1of1ForFork1_#res.offset, P0Thread1of1ForFork1_#res.base, P0Thread1of1ForFork1_~arg.offset, ~__unbuffered_cnt~0, P0Thread1of1ForFork1_~arg.base] because there is no mapped edge [2019-12-26 21:43:47,724 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L822-2-->L822-5: Formula: (let ((.cse1 (= |P3Thread1of1ForFork0_#t~ite33_Out-2105389899| |P3Thread1of1ForFork0_#t~ite32_Out-2105389899|)) (.cse0 (= 0 (mod ~y$r_buff1_thd4~0_In-2105389899 256))) (.cse2 (= 0 (mod ~y$w_buff1_used~0_In-2105389899 256)))) (or (and (= ~y$w_buff1~0_In-2105389899 |P3Thread1of1ForFork0_#t~ite32_Out-2105389899|) (not .cse0) .cse1 (not .cse2)) (and .cse1 (or .cse0 .cse2) (= |P3Thread1of1ForFork0_#t~ite32_Out-2105389899| ~y~0_In-2105389899)))) InVars {~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-2105389899, ~y$w_buff1~0=~y$w_buff1~0_In-2105389899, ~y~0=~y~0_In-2105389899, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2105389899} OutVars{~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In-2105389899, ~y$w_buff1~0=~y$w_buff1~0_In-2105389899, ~y~0=~y~0_In-2105389899, P3Thread1of1ForFork0_#t~ite33=|P3Thread1of1ForFork0_#t~ite33_Out-2105389899|, P3Thread1of1ForFork0_#t~ite32=|P3Thread1of1ForFork0_#t~ite32_Out-2105389899|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-2105389899} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite33, P3Thread1of1ForFork0_#t~ite32] because there is no mapped edge [2019-12-26 21:43:47,725 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L800-->L800-2: Formula: (let ((.cse0 (= (mod ~y$r_buff0_thd3~0_In1335369502 256) 0)) (.cse1 (= 0 (mod ~y$w_buff0_used~0_In1335369502 256)))) (or (and (= ~y$w_buff0_used~0_In1335369502 |P2Thread1of1ForFork3_#t~ite28_Out1335369502|) (or .cse0 .cse1)) (and (= 0 |P2Thread1of1ForFork3_#t~ite28_Out1335369502|) (not .cse0) (not .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1335369502, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1335369502} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1335369502, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1335369502, P2Thread1of1ForFork3_#t~ite28=|P2Thread1of1ForFork3_#t~ite28_Out1335369502|} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite28] because there is no mapped edge [2019-12-26 21:43:47,728 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L823-->L823-2: Formula: (let ((.cse1 (= (mod ~y$r_buff0_thd4~0_In-1234103893 256) 0)) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-1234103893 256)))) (or (and (or .cse0 .cse1) (= ~y$w_buff0_used~0_In-1234103893 |P3Thread1of1ForFork0_#t~ite34_Out-1234103893|)) (and (= 0 |P3Thread1of1ForFork0_#t~ite34_Out-1234103893|) (not .cse1) (not .cse0)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1234103893, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1234103893} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1234103893, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1234103893, P3Thread1of1ForFork0_#t~ite34=|P3Thread1of1ForFork0_#t~ite34_Out-1234103893|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite34] because there is no mapped edge [2019-12-26 21:43:47,729 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L801-->L801-2: Formula: (let ((.cse3 (= (mod ~y$w_buff0_used~0_In1434896208 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd3~0_In1434896208 256) 0)) (.cse0 (= 0 (mod ~y$w_buff1_used~0_In1434896208 256))) (.cse1 (= 0 (mod ~y$r_buff1_thd3~0_In1434896208 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork3_#t~ite29_Out1434896208|)) (and (or .cse3 .cse2) (or .cse0 .cse1) (= ~y$w_buff1_used~0_In1434896208 |P2Thread1of1ForFork3_#t~ite29_Out1434896208|)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1434896208, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1434896208, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1434896208, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1434896208} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In1434896208, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1434896208, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In1434896208, P2Thread1of1ForFork3_#t~ite29=|P2Thread1of1ForFork3_#t~ite29_Out1434896208|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1434896208} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite29] because there is no mapped edge [2019-12-26 21:43:47,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L763-->L763-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-265664895 256)))) (or (and (= ~y$w_buff0~0_In-265664895 |P1Thread1of1ForFork2_#t~ite8_Out-265664895|) (let ((.cse0 (= (mod ~y$r_buff0_thd2~0_In-265664895 256) 0))) (or (and (= 0 (mod ~y$w_buff1_used~0_In-265664895 256)) .cse0) (= 0 (mod ~y$w_buff0_used~0_In-265664895 256)) (and (= (mod ~y$r_buff1_thd2~0_In-265664895 256) 0) .cse0))) .cse1 (= |P1Thread1of1ForFork2_#t~ite8_Out-265664895| |P1Thread1of1ForFork2_#t~ite9_Out-265664895|)) (and (not .cse1) (= ~y$w_buff0~0_In-265664895 |P1Thread1of1ForFork2_#t~ite9_Out-265664895|) (= |P1Thread1of1ForFork2_#t~ite8_In-265664895| |P1Thread1of1ForFork2_#t~ite8_Out-265664895|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-265664895, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-265664895, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_In-265664895|, ~y$w_buff0~0=~y$w_buff0~0_In-265664895, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-265664895, ~weak$$choice2~0=~weak$$choice2~0_In-265664895, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-265664895} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In-265664895, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out-265664895|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-265664895, P1Thread1of1ForFork2_#t~ite8=|P1Thread1of1ForFork2_#t~ite8_Out-265664895|, ~y$w_buff0~0=~y$w_buff0~0_In-265664895, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In-265664895, ~weak$$choice2~0=~weak$$choice2~0_In-265664895, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-265664895} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 21:43:47,732 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L802-->L803: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff0_used~0_In-2014074005 256))) (.cse0 (= (mod ~y$r_buff0_thd3~0_In-2014074005 256) 0))) (or (and (= ~y$r_buff0_thd3~0_In-2014074005 ~y$r_buff0_thd3~0_Out-2014074005) (or .cse0 .cse1)) (and (= ~y$r_buff0_thd3~0_Out-2014074005 0) (not .cse1) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2014074005, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-2014074005} OutVars{P2Thread1of1ForFork3_#t~ite30=|P2Thread1of1ForFork3_#t~ite30_Out-2014074005|, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-2014074005, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_Out-2014074005} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite30, ~y$r_buff0_thd3~0] because there is no mapped edge [2019-12-26 21:43:47,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [784] [784] L803-->L803-2: Formula: (let ((.cse1 (= 0 (mod ~y$w_buff1_used~0_In-1110184171 256))) (.cse0 (= 0 (mod ~y$r_buff1_thd3~0_In-1110184171 256))) (.cse2 (= 0 (mod ~y$r_buff0_thd3~0_In-1110184171 256))) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In-1110184171 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork3_#t~ite31_Out-1110184171| ~y$r_buff1_thd3~0_In-1110184171)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork3_#t~ite31_Out-1110184171| 0)))) InVars {~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1110184171, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1110184171, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1110184171, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1110184171} OutVars{~y$r_buff1_thd3~0=~y$r_buff1_thd3~0_In-1110184171, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1110184171, ~y$r_buff0_thd3~0=~y$r_buff0_thd3~0_In-1110184171, P2Thread1of1ForFork3_#t~ite31=|P2Thread1of1ForFork3_#t~ite31_Out-1110184171|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-1110184171} AuxVars[] AssignedVars[P2Thread1of1ForFork3_#t~ite31] because there is no mapped edge [2019-12-26 21:43:47,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork3_#res.offset_5| 0) (= 0 |v_P2Thread1of1ForFork3_#res.base_5|) (= v_~__unbuffered_cnt~0_100 (+ v_~__unbuffered_cnt~0_101 1)) (= |v_P2Thread1of1ForFork3_#t~ite31_40| v_~y$r_buff1_thd3~0_57)) InVars {P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_101} OutVars{~y$r_buff1_thd3~0=v_~y$r_buff1_thd3~0_57, P2Thread1of1ForFork3_#t~ite31=|v_P2Thread1of1ForFork3_#t~ite31_39|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_100, P2Thread1of1ForFork3_#res.base=|v_P2Thread1of1ForFork3_#res.base_5|, P2Thread1of1ForFork3_#res.offset=|v_P2Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~y$r_buff1_thd3~0, P2Thread1of1ForFork3_#t~ite31, ~__unbuffered_cnt~0, P2Thread1of1ForFork3_#res.base, P2Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-26 21:43:47,734 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [783] [783] L824-->L824-2: Formula: (let ((.cse0 (= 0 (mod ~y$w_buff1_used~0_In763358726 256))) (.cse1 (= (mod ~y$r_buff1_thd4~0_In763358726 256) 0)) (.cse2 (= (mod ~y$r_buff0_thd4~0_In763358726 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In763358726 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork0_#t~ite35_Out763358726|)) (and (or .cse0 .cse1) (= ~y$w_buff1_used~0_In763358726 |P3Thread1of1ForFork0_#t~ite35_Out763358726|) (or .cse2 .cse3)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In763358726, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In763358726, ~y$w_buff0_used~0=~y$w_buff0_used~0_In763358726, ~y$w_buff1_used~0=~y$w_buff1_used~0_In763358726} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In763358726, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In763358726, ~y$w_buff0_used~0=~y$w_buff0_used~0_In763358726, P3Thread1of1ForFork0_#t~ite35=|P3Thread1of1ForFork0_#t~ite35_Out763358726|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In763358726} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite35] because there is no mapped edge [2019-12-26 21:43:47,735 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L825-->L825-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In-1494062898 256) 0)) (.cse1 (= (mod ~y$r_buff0_thd4~0_In-1494062898 256) 0))) (or (and (= ~y$r_buff0_thd4~0_In-1494062898 |P3Thread1of1ForFork0_#t~ite36_Out-1494062898|) (or .cse0 .cse1)) (and (= 0 |P3Thread1of1ForFork0_#t~ite36_Out-1494062898|) (not .cse0) (not .cse1)))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1494062898, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1494062898} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In-1494062898, ~y$w_buff0_used~0=~y$w_buff0_used~0_In-1494062898, P3Thread1of1ForFork0_#t~ite36=|P3Thread1of1ForFork0_#t~ite36_Out-1494062898|} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite36] because there is no mapped edge [2019-12-26 21:43:47,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L826-->L826-2: Formula: (let ((.cse2 (= (mod ~y$r_buff0_thd4~0_In673962203 256) 0)) (.cse3 (= 0 (mod ~y$w_buff0_used~0_In673962203 256))) (.cse0 (= (mod ~y$r_buff1_thd4~0_In673962203 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In673962203 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~y$r_buff1_thd4~0_In673962203 |P3Thread1of1ForFork0_#t~ite37_Out673962203|)) (and (= |P3Thread1of1ForFork0_#t~ite37_Out673962203| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In673962203, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In673962203, ~y$w_buff0_used~0=~y$w_buff0_used~0_In673962203, ~y$w_buff1_used~0=~y$w_buff1_used~0_In673962203} OutVars{~y$r_buff0_thd4~0=~y$r_buff0_thd4~0_In673962203, ~y$r_buff1_thd4~0=~y$r_buff1_thd4~0_In673962203, ~y$w_buff0_used~0=~y$w_buff0_used~0_In673962203, P3Thread1of1ForFork0_#t~ite37=|P3Thread1of1ForFork0_#t~ite37_Out673962203|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In673962203} AuxVars[] AssignedVars[P3Thread1of1ForFork0_#t~ite37] because there is no mapped edge [2019-12-26 21:43:47,736 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L826-2-->P3EXIT: Formula: (and (= |v_P3Thread1of1ForFork0_#res.base_5| 0) (= |v_P3Thread1of1ForFork0_#t~ite37_36| v_~y$r_buff1_thd4~0_55) (= 0 |v_P3Thread1of1ForFork0_#res.offset_5|) (= v_~__unbuffered_cnt~0_77 (+ v_~__unbuffered_cnt~0_78 1))) InVars {P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_78} OutVars{~y$r_buff1_thd4~0=v_~y$r_buff1_thd4~0_55, P3Thread1of1ForFork0_#res.offset=|v_P3Thread1of1ForFork0_#res.offset_5|, P3Thread1of1ForFork0_#t~ite37=|v_P3Thread1of1ForFork0_#t~ite37_35|, P3Thread1of1ForFork0_#res.base=|v_P3Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77} AuxVars[] AssignedVars[~y$r_buff1_thd4~0, P3Thread1of1ForFork0_#res.offset, P3Thread1of1ForFork0_#t~ite37, P3Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 21:43:47,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L764-->L764-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In538944816 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_In538944816| |P1Thread1of1ForFork2_#t~ite11_Out538944816|) (= |P1Thread1of1ForFork2_#t~ite12_Out538944816| ~y$w_buff1~0_In538944816) (not .cse0)) (and .cse0 (= ~y$w_buff1~0_In538944816 |P1Thread1of1ForFork2_#t~ite11_Out538944816|) (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In538944816 256)))) (or (and .cse1 (= 0 (mod ~y$w_buff1_used~0_In538944816 256))) (and .cse1 (= (mod ~y$r_buff1_thd2~0_In538944816 256) 0)) (= (mod ~y$w_buff0_used~0_In538944816 256) 0))) (= |P1Thread1of1ForFork2_#t~ite12_Out538944816| |P1Thread1of1ForFork2_#t~ite11_Out538944816|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In538944816, ~y$w_buff1~0=~y$w_buff1~0_In538944816, ~y$w_buff0_used~0=~y$w_buff0_used~0_In538944816, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In538944816, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_In538944816|, ~weak$$choice2~0=~weak$$choice2~0_In538944816, ~y$w_buff1_used~0=~y$w_buff1_used~0_In538944816} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In538944816, ~y$w_buff1~0=~y$w_buff1~0_In538944816, ~y$w_buff0_used~0=~y$w_buff0_used~0_In538944816, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In538944816, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out538944816|, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out538944816|, ~weak$$choice2~0=~weak$$choice2~0_In538944816, ~y$w_buff1_used~0=~y$w_buff1_used~0_In538944816} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12, P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 21:43:47,738 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L765-->L765-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1956728429 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_In1956728429| |P1Thread1of1ForFork2_#t~ite14_Out1956728429|) (not .cse0) (= ~y$w_buff0_used~0_In1956728429 |P1Thread1of1ForFork2_#t~ite15_Out1956728429|)) (and (let ((.cse1 (= 0 (mod ~y$r_buff0_thd2~0_In1956728429 256)))) (or (and (= 0 (mod ~y$w_buff1_used~0_In1956728429 256)) .cse1) (= 0 (mod ~y$w_buff0_used~0_In1956728429 256)) (and (= 0 (mod ~y$r_buff1_thd2~0_In1956728429 256)) .cse1))) (= |P1Thread1of1ForFork2_#t~ite14_Out1956728429| |P1Thread1of1ForFork2_#t~ite15_Out1956728429|) (= ~y$w_buff0_used~0_In1956728429 |P1Thread1of1ForFork2_#t~ite14_Out1956728429|) .cse0))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1956728429, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1956728429, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1956728429, ~weak$$choice2~0=~weak$$choice2~0_In1956728429, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_In1956728429|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1956728429} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1956728429, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1956728429, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1956728429, ~weak$$choice2~0=~weak$$choice2~0_In1956728429, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1956728429|, P1Thread1of1ForFork2_#t~ite15=|P1Thread1of1ForFork2_#t~ite15_Out1956728429|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1956728429} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-26 21:43:47,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L767-->L768: Formula: (and (= v_~y$r_buff0_thd2~0_109 v_~y$r_buff0_thd2~0_108) (not (= (mod v_~weak$$choice2~0_39 256) 0))) InVars {~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_109, ~weak$$choice2~0=v_~weak$$choice2~0_39} OutVars{P1Thread1of1ForFork2_#t~ite19=|v_P1Thread1of1ForFork2_#t~ite19_8|, ~y$r_buff0_thd2~0=v_~y$r_buff0_thd2~0_108, P1Thread1of1ForFork2_#t~ite20=|v_P1Thread1of1ForFork2_#t~ite20_9|, P1Thread1of1ForFork2_#t~ite21=|v_P1Thread1of1ForFork2_#t~ite21_8|, ~weak$$choice2~0=v_~weak$$choice2~0_39} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite19, ~y$r_buff0_thd2~0, P1Thread1of1ForFork2_#t~ite20, P1Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-26 21:43:47,741 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L768-->L768-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1268385693 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~y$r_buff0_thd2~0_In1268385693 256)))) (or (and .cse0 (= 0 (mod ~y$r_buff1_thd2~0_In1268385693 256))) (and .cse0 (= 0 (mod ~y$w_buff1_used~0_In1268385693 256))) (= (mod ~y$w_buff0_used~0_In1268385693 256) 0))) (= ~y$r_buff1_thd2~0_In1268385693 |P1Thread1of1ForFork2_#t~ite23_Out1268385693|) .cse1 (= |P1Thread1of1ForFork2_#t~ite23_Out1268385693| |P1Thread1of1ForFork2_#t~ite24_Out1268385693|)) (and (not .cse1) (= ~y$r_buff1_thd2~0_In1268385693 |P1Thread1of1ForFork2_#t~ite24_Out1268385693|) (= |P1Thread1of1ForFork2_#t~ite23_In1268385693| |P1Thread1of1ForFork2_#t~ite23_Out1268385693|)))) InVars {~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1268385693, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1268385693, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1268385693, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_In1268385693|, ~weak$$choice2~0=~weak$$choice2~0_In1268385693, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1268385693} OutVars{~y$r_buff1_thd2~0=~y$r_buff1_thd2~0_In1268385693, ~y$w_buff0_used~0=~y$w_buff0_used~0_In1268385693, ~y$r_buff0_thd2~0=~y$r_buff0_thd2~0_In1268385693, P1Thread1of1ForFork2_#t~ite23=|P1Thread1of1ForFork2_#t~ite23_Out1268385693|, ~weak$$choice2~0=~weak$$choice2~0_In1268385693, P1Thread1of1ForFork2_#t~ite24=|P1Thread1of1ForFork2_#t~ite24_Out1268385693|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In1268385693} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite23, P1Thread1of1ForFork2_#t~ite24] because there is no mapped edge [2019-12-26 21:43:47,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L770-->L778: Formula: (and (= (+ v_~__unbuffered_cnt~0_22 1) v_~__unbuffered_cnt~0_21) (= v_~y~0_29 v_~y$mem_tmp~0_6) (= 0 v_~y$flush_delayed~0_8) (not (= 0 (mod v_~y$flush_delayed~0_9 256)))) InVars {~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_22} OutVars{~y$mem_tmp~0=v_~y$mem_tmp~0_6, ~y$flush_delayed~0=v_~y$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~y~0=v_~y~0_29, P1Thread1of1ForFork2_#t~ite25=|v_P1Thread1of1ForFork2_#t~ite25_7|} AuxVars[] AssignedVars[~y$flush_delayed~0, ~__unbuffered_cnt~0, ~y~0, P1Thread1of1ForFork2_#t~ite25] because there is no mapped edge [2019-12-26 21:43:47,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L851-1-->L857: Formula: (and (= 4 v_~__unbuffered_cnt~0_20) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20} OutVars{ULTIMATE.start_main_#t~nondet41=|v_ULTIMATE.start_main_#t~nondet41_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet41, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 21:43:47,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L857-2-->L857-4: Formula: (let ((.cse1 (= (mod ~y$r_buff1_thd0~0_In-381001183 256) 0)) (.cse0 (= (mod ~y$w_buff1_used~0_In-381001183 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite42_Out-381001183| ~y~0_In-381001183)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite42_Out-381001183| ~y$w_buff1~0_In-381001183)))) InVars {~y$w_buff1~0=~y$w_buff1~0_In-381001183, ~y~0=~y~0_In-381001183, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-381001183, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-381001183} OutVars{~y$w_buff1~0=~y$w_buff1~0_In-381001183, ~y~0=~y~0_In-381001183, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out-381001183|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In-381001183, ~y$w_buff1_used~0=~y$w_buff1_used~0_In-381001183} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 21:43:47,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L857-4-->L858: Formula: (= v_~y~0_46 |v_ULTIMATE.start_main_#t~ite42_14|) InVars {ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_14|} OutVars{ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_13|, ~y~0=v_~y~0_46, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43, ~y~0, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 21:43:47,744 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [793] [793] L858-->L858-2: Formula: (let ((.cse0 (= (mod ~y$w_buff0_used~0_In1866294887 256) 0)) (.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In1866294887 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite44_Out1866294887|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite44_Out1866294887| ~y$w_buff0_used~0_In1866294887) (or .cse0 .cse1)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In1866294887, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1866294887} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In1866294887, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In1866294887, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out1866294887|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-26 21:43:47,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] L859-->L859-2: Formula: (let ((.cse2 (= (mod ~y$w_buff0_used~0_In640777594 256) 0)) (.cse3 (= (mod ~y$r_buff0_thd0~0_In640777594 256) 0)) (.cse1 (= (mod ~y$w_buff1_used~0_In640777594 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In640777594 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite45_Out640777594| 0)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= |ULTIMATE.start_main_#t~ite45_Out640777594| ~y$w_buff1_used~0_In640777594)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In640777594, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In640777594, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In640777594, ~y$w_buff1_used~0=~y$w_buff1_used~0_In640777594} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In640777594, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In640777594, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In640777594, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out640777594|, ~y$w_buff1_used~0=~y$w_buff1_used~0_In640777594} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-26 21:43:47,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L860-->L860-2: Formula: (let ((.cse1 (= 0 (mod ~y$r_buff0_thd0~0_In-2147429216 256))) (.cse0 (= 0 (mod ~y$w_buff0_used~0_In-2147429216 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite46_Out-2147429216| ~y$r_buff0_thd0~0_In-2147429216)) (and (not .cse1) (= |ULTIMATE.start_main_#t~ite46_Out-2147429216| 0) (not .cse0)))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In-2147429216, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2147429216} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In-2147429216, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In-2147429216, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out-2147429216|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-26 21:43:47,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L861-->L861-2: Formula: (let ((.cse2 (= 0 (mod ~y$w_buff0_used~0_In555448231 256))) (.cse3 (= (mod ~y$r_buff0_thd0~0_In555448231 256) 0)) (.cse0 (= 0 (mod ~y$r_buff1_thd0~0_In555448231 256))) (.cse1 (= 0 (mod ~y$w_buff1_used~0_In555448231 256)))) (or (and (= ~y$r_buff1_thd0~0_In555448231 |ULTIMATE.start_main_#t~ite47_Out555448231|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite47_Out555448231|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~y$w_buff0_used~0=~y$w_buff0_used~0_In555448231, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In555448231, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In555448231, ~y$w_buff1_used~0=~y$w_buff1_used~0_In555448231} OutVars{~y$w_buff0_used~0=~y$w_buff0_used~0_In555448231, ~y$r_buff0_thd0~0=~y$r_buff0_thd0~0_In555448231, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out555448231|, ~y$r_buff1_thd0~0=~y$r_buff1_thd0~0_In555448231, ~y$w_buff1_used~0=~y$w_buff1_used~0_In555448231} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47] because there is no mapped edge [2019-12-26 21:43:47,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [849] [849] L861-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_~y$r_buff1_thd0~0_133 |v_ULTIMATE.start_main_#t~ite47_73|) (= 0 v_~__unbuffered_p2_EAX~0_78) (= 0 v_~__unbuffered_p1_EAX~0_32) (= 0 v_~__unbuffered_p3_EBX~0_31) (= 0 v_~__unbuffered_p0_EAX~0_46) (= 1 v_~__unbuffered_p3_EAX~0_31) (= v_~main$tmp_guard1~0_29 0) (= (mod v_~main$tmp_guard1~0_29 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_21 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_31, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_73|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_78, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_46, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_21, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_32, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_31, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_72|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_29, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_78, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_31, ~y$r_buff1_thd0~0=v_~y$r_buff1_thd0~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~main$tmp_guard1~0, ~y$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 21:43:47,824 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 09:43:47 BasicIcfg [2019-12-26 21:43:47,824 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 21:43:47,826 INFO L168 Benchmark]: Toolchain (without parser) took 158842.34 ms. Allocated memory was 146.3 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 102.1 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-26 21:43:47,826 INFO L168 Benchmark]: CDTParser took 0.48 ms. Allocated memory is still 146.3 MB. Free memory is still 122.2 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-12-26 21:43:47,827 INFO L168 Benchmark]: CACSL2BoogieTranslator took 703.46 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 101.7 MB in the beginning and 157.4 MB in the end (delta: -55.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. [2019-12-26 21:43:47,827 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.24 ms. Allocated memory is still 204.5 MB. Free memory was 157.4 MB in the beginning and 154.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 21:43:47,828 INFO L168 Benchmark]: Boogie Preprocessor took 61.83 ms. Allocated memory is still 204.5 MB. Free memory was 154.5 MB in the beginning and 152.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-12-26 21:43:47,828 INFO L168 Benchmark]: RCFGBuilder took 805.79 ms. Allocated memory is still 204.5 MB. Free memory was 152.7 MB in the beginning and 103.0 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-26 21:43:47,829 INFO L168 Benchmark]: TraceAbstraction took 157204.50 ms. Allocated memory was 204.5 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 103.0 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 945.9 MB. Max. memory is 7.1 GB. [2019-12-26 21:43:47,831 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.48 ms. Allocated memory is still 146.3 MB. Free memory is still 122.2 MB. There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 703.46 ms. Allocated memory was 146.3 MB in the beginning and 204.5 MB in the end (delta: 58.2 MB). Free memory was 101.7 MB in the beginning and 157.4 MB in the end (delta: -55.7 MB). Peak memory consumption was 21.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 61.24 ms. Allocated memory is still 204.5 MB. Free memory was 157.4 MB in the beginning and 154.5 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 61.83 ms. Allocated memory is still 204.5 MB. Free memory was 154.5 MB in the beginning and 152.7 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 805.79 ms. Allocated memory is still 204.5 MB. Free memory was 152.7 MB in the beginning and 103.0 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 157204.50 ms. Allocated memory was 204.5 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 103.0 MB in the beginning and 1.6 GB in the end (delta: -1.5 GB). Peak memory consumption was 945.9 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.4s, 182 ProgramPointsBefore, 88 ProgramPointsAfterwards, 210 TransitionsBefore, 92 TransitionsAfterwards, 18126 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 30 ConcurrentYvCompositions, 29 ChoiceCompositions, 7271 VarBasedMoverChecksPositive, 240 VarBasedMoverChecksNegative, 64 SemBasedMoverChecksPositive, 256 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.9s, 0 MoverChecksTotal, 72619 CheckedPairsTotal, 123 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L845] FCALL, FORK 0 pthread_create(&t453, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L847] FCALL, FORK 0 pthread_create(&t454, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L849] FCALL, FORK 0 pthread_create(&t455, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=0, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=0, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=0] [L788] 3 y$r_buff1_thd0 = y$r_buff0_thd0 [L789] 3 y$r_buff1_thd1 = y$r_buff0_thd1 [L790] 3 y$r_buff1_thd2 = y$r_buff0_thd2 [L791] 3 y$r_buff1_thd3 = y$r_buff0_thd3 [L792] 3 y$r_buff1_thd4 = y$r_buff0_thd4 [L793] 3 y$r_buff0_thd3 = (_Bool)1 [L796] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L799] EXPR 3 y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L851] FCALL, FORK 0 pthread_create(&t456, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=0] [L813] 4 z = 1 [L816] 4 __unbuffered_p3_EAX = z [L819] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0: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=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L822] EXPR 4 y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L799] 3 y = y$w_buff0_used && y$r_buff0_thd3 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd3 ? y$w_buff1 : y) [L822] 4 y = y$w_buff0_used && y$r_buff0_thd4 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd4 ? y$w_buff1 : y) [L755] 2 x = 1 [L758] 2 weak$$choice0 = __VERIFIER_nondet_bool() [L759] 2 weak$$choice2 = __VERIFIER_nondet_bool() [L760] 2 y$flush_delayed = weak$$choice2 [L761] 2 y$mem_tmp = y VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=1, y$w_buff1=0, y$w_buff1_used=0, z=1] [L800] 3 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd3 ? (_Bool)0 : y$w_buff0_used [L762] EXPR 2 !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) VAL [!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1)=0, \result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L801] 3 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd3 || y$w_buff1_used && y$r_buff1_thd3 ? (_Bool)0 : y$w_buff1_used [L762] 2 y = !y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff1) [L763] 2 y$w_buff0 = weak$$choice2 ? y$w_buff0 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff0 : y$w_buff0)) [L823] 4 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$w_buff0_used [L824] 4 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd4 || y$w_buff1_used && y$r_buff1_thd4 ? (_Bool)0 : y$w_buff1_used [L825] 4 y$r_buff0_thd4 = y$w_buff0_used && y$r_buff0_thd4 ? (_Bool)0 : y$r_buff0_thd4 [L764] 2 y$w_buff1 = weak$$choice2 ? y$w_buff1 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1 : (y$w_buff0_used && y$r_buff0_thd2 ? y$w_buff1 : y$w_buff1)) [L765] 2 y$w_buff0_used = weak$$choice2 ? y$w_buff0_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff0_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : y$w_buff0_used)) [L766] EXPR 2 weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0))=0, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L766] 2 y$w_buff1_used = weak$$choice2 ? y$w_buff1_used : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$w_buff1_used : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L768] 2 y$r_buff1_thd2 = weak$$choice2 ? y$r_buff1_thd2 : (!y$w_buff0_used || !y$r_buff0_thd2 && !y$w_buff1_used || !y$r_buff0_thd2 && !y$r_buff1_thd2 ? y$r_buff1_thd2 : (y$w_buff0_used && y$r_buff0_thd2 ? (_Bool)0 : (_Bool)0)) [L769] 2 __unbuffered_p1_EAX = y VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=1, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L857] 0 y$w_buff0_used && y$r_buff0_thd0 ? y$w_buff0 : (y$w_buff1_used && y$r_buff1_thd0 ? y$w_buff1 : y) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=0, y$flush_delayed=0, y$mem_tmp=0, y$r_buff0_thd0=0, y$r_buff0_thd1=0, y$r_buff0_thd2=0, y$r_buff0_thd3=1, y$r_buff0_thd4=0, y$r_buff1_thd0=0, y$r_buff1_thd1=0, y$r_buff1_thd2=0, y$r_buff1_thd3=0, y$r_buff1_thd4=0, y$read_delayed=0, y$read_delayed_var={0:0}, y$w_buff0=1, y$w_buff0_used=0, y$w_buff1=0, y$w_buff1_used=0, z=1] [L858] 0 y$w_buff0_used = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$w_buff0_used [L859] 0 y$w_buff1_used = y$w_buff0_used && y$r_buff0_thd0 || y$w_buff1_used && y$r_buff1_thd0 ? (_Bool)0 : y$w_buff1_used [L860] 0 y$r_buff0_thd0 = y$w_buff0_used && y$r_buff0_thd0 ? (_Bool)0 : y$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 156.9s, OverallIterations: 27, TraceHistogramMax: 1, AutomataDifference: 42.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 6209 SDtfs, 9735 SDslu, 24038 SDs, 0 SdLazy, 13297 SolverSat, 485 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 12.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 447 GetRequests, 53 SyntacticMatches, 16 SemanticMatches, 378 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2888 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=218838occurred 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: 69.8s AutomataMinimizationTime, 26 MinimizatonAttempts, 283672 StatesRemovedByMinimization, 22 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 1195 NumberOfCodeBlocks, 1195 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 1110 ConstructedInterpolants, 0 QuantifiedInterpolants, 216528 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 26 InterpolantComputations, 26 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...