/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/podwr001_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 21:46:29,593 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 21:46:29,595 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 21:46:29,608 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 21:46:29,608 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 21:46:29,609 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 21:46:29,611 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 21:46:29,613 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 21:46:29,615 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 21:46:29,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 21:46:29,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 21:46:29,618 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 21:46:29,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 21:46:29,619 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 21:46:29,620 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 21:46:29,623 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 21:46:29,624 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 21:46:29,625 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 21:46:29,629 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 21:46:29,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 21:46:29,635 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 21:46:29,642 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 21:46:29,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 21:46:29,644 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 21:46:29,649 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 21:46:29,649 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 21:46:29,649 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 21:46:29,651 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 21:46:29,651 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 21:46:29,652 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 21:46:29,652 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 21:46:29,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 21:46:29,657 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 21:46:29,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 21:46:29,660 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 21:46:29,660 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 21:46:29,661 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 21:46:29,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 21:46:29,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 21:46:29,664 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 21:46:29,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 21:46:29,666 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 21:46:29,688 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 21:46:29,688 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 21:46:29,690 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 21:46:29,690 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 21:46:29,690 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 21:46:29,691 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 21:46:29,691 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 21:46:29,691 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 21:46:29,691 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 21:46:29,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 21:46:29,693 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 21:46:29,693 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 21:46:29,693 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 21:46:29,694 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 21:46:29,694 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 21:46:29,694 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 21:46:29,694 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 21:46:29,694 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 21:46:29,695 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 21:46:29,695 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 21:46:29,695 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 21:46:29,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:46:29,696 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 21:46:29,696 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 21:46:29,696 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 21:46:29,696 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 21:46:29,697 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 21:46:29,697 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 21:46:29,697 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 21:46:29,697 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 21:46:29,698 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 21:46:29,698 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 21:46:30,048 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 21:46:30,071 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 21:46:30,074 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 21:46:30,076 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 21:46:30,077 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 21:46:30,077 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr001_rmo.oepc.i [2019-12-27 21:46:30,158 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61ed88547/31be6a4e8f9e44c68b22cb02de149ad4/FLAG6ed3805ec [2019-12-27 21:46:30,769 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 21:46:30,769 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr001_rmo.oepc.i [2019-12-27 21:46:30,796 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61ed88547/31be6a4e8f9e44c68b22cb02de149ad4/FLAG6ed3805ec [2019-12-27 21:46:30,973 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/61ed88547/31be6a4e8f9e44c68b22cb02de149ad4 [2019-12-27 21:46:30,985 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 21:46:30,987 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 21:46:30,992 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 21:46:30,992 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 21:46:30,996 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 21:46:30,997 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:46:30" (1/1) ... [2019-12-27 21:46:31,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3a9b46 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:30, skipping insertion in model container [2019-12-27 21:46:31,000 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 09:46:30" (1/1) ... [2019-12-27 21:46:31,006 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 21:46:31,071 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 21:46:31,675 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:46:31,687 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 21:46:31,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 21:46:31,844 INFO L208 MainTranslator]: Completed translation [2019-12-27 21:46:31,845 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:31 WrapperNode [2019-12-27 21:46:31,845 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 21:46:31,846 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 21:46:31,846 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 21:46:31,848 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 21:46:31,856 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:31" (1/1) ... [2019-12-27 21:46:31,878 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:31" (1/1) ... [2019-12-27 21:46:31,915 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 21:46:31,915 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 21:46:31,915 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 21:46:31,915 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 21:46:31,924 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:31" (1/1) ... [2019-12-27 21:46:31,924 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:31" (1/1) ... [2019-12-27 21:46:31,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:31" (1/1) ... [2019-12-27 21:46:31,930 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:31" (1/1) ... [2019-12-27 21:46:31,941 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:31" (1/1) ... [2019-12-27 21:46:31,946 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:31" (1/1) ... [2019-12-27 21:46:31,950 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:31" (1/1) ... [2019-12-27 21:46:31,955 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 21:46:31,956 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 21:46:31,956 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 21:46:31,956 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 21:46:31,957 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:31" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 21:46:32,022 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 21:46:32,022 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 21:46:32,023 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 21:46:32,023 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 21:46:32,023 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 21:46:32,023 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 21:46:32,023 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 21:46:32,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 21:46:32,024 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 21:46:32,024 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 21:46:32,024 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 21:46:32,024 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 21:46:32,025 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 21:46:32,027 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 21:46:32,794 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 21:46:32,795 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 21:46:32,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:46:32 BoogieIcfgContainer [2019-12-27 21:46:32,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 21:46:32,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 21:46:32,798 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 21:46:32,801 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 21:46:32,802 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 09:46:30" (1/3) ... [2019-12-27 21:46:32,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e723d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:46:32, skipping insertion in model container [2019-12-27 21:46:32,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 09:46:31" (2/3) ... [2019-12-27 21:46:32,804 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@8e723d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 09:46:32, skipping insertion in model container [2019-12-27 21:46:32,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 09:46:32" (3/3) ... [2019-12-27 21:46:32,806 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr001_rmo.oepc.i [2019-12-27 21:46:32,816 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 21:46:32,816 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 21:46:32,824 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 21:46:32,826 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 21:46:32,869 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,870 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,870 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,870 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,870 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,871 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,872 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,890 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,891 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,892 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,893 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,894 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,895 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,896 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,897 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,897 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,898 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,898 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,899 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,900 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,901 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,902 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,903 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,904 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,905 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,905 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,905 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,906 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,907 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,908 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,909 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,910 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,911 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,912 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,913 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,914 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,915 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,916 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,917 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,918 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,919 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,920 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,921 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,922 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,923 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,924 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,925 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,926 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,927 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,928 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,931 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,932 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,932 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,933 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,934 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,935 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,935 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,936 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,937 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,941 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,942 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,942 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,943 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,943 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,943 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,945 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,945 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,946 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,947 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 21:46:32,963 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 21:46:32,984 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 21:46:32,984 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 21:46:32,984 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 21:46:32,984 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 21:46:32,984 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 21:46:32,985 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 21:46:32,985 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 21:46:32,985 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 21:46:33,001 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-27 21:46:33,004 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 21:46:33,112 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 21:46:33,112 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:46:33,129 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:46:33,154 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-27 21:46:33,208 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-27 21:46:33,208 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 21:46:33,216 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 21:46:33,237 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 21:46:33,238 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 21:46:36,641 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 21:46:36,792 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 21:46:36,818 INFO L206 etLargeBlockEncoding]: Checked pairs total: 85326 [2019-12-27 21:46:36,818 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 21:46:36,822 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 96 places, 108 transitions [2019-12-27 21:47:00,460 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 129058 states. [2019-12-27 21:47:00,462 INFO L276 IsEmpty]: Start isEmpty. Operand 129058 states. [2019-12-27 21:47:00,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 21:47:00,469 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:00,469 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 21:47:00,470 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:47:00,475 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:00,475 INFO L82 PathProgramCache]: Analyzing trace with hash 910080, now seen corresponding path program 1 times [2019-12-27 21:47:00,483 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:00,483 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [91930147] [2019-12-27 21:47:00,484 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:00,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:00,686 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:47:00,687 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [91930147] [2019-12-27 21:47:00,687 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:00,688 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 21:47:00,688 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [687296878] [2019-12-27 21:47:00,689 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:00,694 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:00,706 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 21:47:00,707 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:00,711 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:47:00,711 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:47:00,711 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:00,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:47:00,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:47:00,728 INFO L87 Difference]: Start difference. First operand 129058 states. Second operand 3 states. [2019-12-27 21:47:02,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:02,056 INFO L93 Difference]: Finished difference Result 120110 states and 517368 transitions. [2019-12-27 21:47:02,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:47:02,058 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 21:47:02,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:02,661 INFO L225 Difference]: With dead ends: 120110 [2019-12-27 21:47:02,661 INFO L226 Difference]: Without dead ends: 112648 [2019-12-27 21:47:02,663 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:47:10,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112648 states. [2019-12-27 21:47:13,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112648 to 112648. [2019-12-27 21:47:13,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112648 states. [2019-12-27 21:47:14,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112648 states to 112648 states and 484580 transitions. [2019-12-27 21:47:14,101 INFO L78 Accepts]: Start accepts. Automaton has 112648 states and 484580 transitions. Word has length 3 [2019-12-27 21:47:14,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:14,101 INFO L462 AbstractCegarLoop]: Abstraction has 112648 states and 484580 transitions. [2019-12-27 21:47:14,101 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:47:14,101 INFO L276 IsEmpty]: Start isEmpty. Operand 112648 states and 484580 transitions. [2019-12-27 21:47:14,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 21:47:14,106 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:14,106 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:47:14,106 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:47:14,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:14,107 INFO L82 PathProgramCache]: Analyzing trace with hash 459684969, now seen corresponding path program 1 times [2019-12-27 21:47:14,107 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:14,107 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159289744] [2019-12-27 21:47:14,107 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:14,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:47:14,251 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159289744] [2019-12-27 21:47:14,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:14,252 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:47:14,252 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1433399407] [2019-12-27 21:47:14,252 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:14,254 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:14,257 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 21:47:14,257 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:14,257 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:47:14,259 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:47:14,259 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:14,259 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:47:14,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:47:14,260 INFO L87 Difference]: Start difference. First operand 112648 states and 484580 transitions. Second operand 4 states. [2019-12-27 21:47:19,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:19,895 INFO L93 Difference]: Finished difference Result 175220 states and 723657 transitions. [2019-12-27 21:47:19,896 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:47:19,896 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 21:47:19,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:20,723 INFO L225 Difference]: With dead ends: 175220 [2019-12-27 21:47:20,723 INFO L226 Difference]: Without dead ends: 175171 [2019-12-27 21:47:20,724 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:47:30,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175171 states. [2019-12-27 21:47:33,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175171 to 161661. [2019-12-27 21:47:33,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 161661 states. [2019-12-27 21:47:34,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161661 states to 161661 states and 675776 transitions. [2019-12-27 21:47:34,868 INFO L78 Accepts]: Start accepts. Automaton has 161661 states and 675776 transitions. Word has length 11 [2019-12-27 21:47:34,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:34,869 INFO L462 AbstractCegarLoop]: Abstraction has 161661 states and 675776 transitions. [2019-12-27 21:47:34,869 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:47:34,869 INFO L276 IsEmpty]: Start isEmpty. Operand 161661 states and 675776 transitions. [2019-12-27 21:47:34,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 21:47:34,874 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:34,874 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:47:34,875 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:47:34,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:34,875 INFO L82 PathProgramCache]: Analyzing trace with hash 8923152, now seen corresponding path program 1 times [2019-12-27 21:47:34,875 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:34,876 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727180250] [2019-12-27 21:47:34,876 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:34,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:34,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:47:34,931 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727180250] [2019-12-27 21:47:34,931 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:34,931 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:47:34,932 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1685695549] [2019-12-27 21:47:34,932 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:34,933 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:34,935 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 21:47:34,936 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:34,936 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:47:34,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:47:34,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:34,937 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:47:34,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:47:34,937 INFO L87 Difference]: Start difference. First operand 161661 states and 675776 transitions. Second operand 3 states. [2019-12-27 21:47:35,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:35,086 INFO L93 Difference]: Finished difference Result 34935 states and 114696 transitions. [2019-12-27 21:47:35,086 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:47:35,087 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 21:47:35,087 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:35,146 INFO L225 Difference]: With dead ends: 34935 [2019-12-27 21:47:35,146 INFO L226 Difference]: Without dead ends: 34935 [2019-12-27 21:47:35,146 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:47:35,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34935 states. [2019-12-27 21:47:35,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34935 to 34935. [2019-12-27 21:47:35,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34935 states. [2019-12-27 21:47:35,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34935 states to 34935 states and 114696 transitions. [2019-12-27 21:47:35,823 INFO L78 Accepts]: Start accepts. Automaton has 34935 states and 114696 transitions. Word has length 13 [2019-12-27 21:47:35,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:35,823 INFO L462 AbstractCegarLoop]: Abstraction has 34935 states and 114696 transitions. [2019-12-27 21:47:35,824 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:47:35,824 INFO L276 IsEmpty]: Start isEmpty. Operand 34935 states and 114696 transitions. [2019-12-27 21:47:35,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:47:35,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:35,826 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:47:35,827 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:47:35,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:35,827 INFO L82 PathProgramCache]: Analyzing trace with hash 846496093, now seen corresponding path program 1 times [2019-12-27 21:47:35,827 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:35,827 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621689476] [2019-12-27 21:47:35,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:35,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:35,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:47:35,881 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621689476] [2019-12-27 21:47:35,881 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:35,882 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:47:35,882 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [52636774] [2019-12-27 21:47:35,882 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:35,884 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:35,886 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:47:35,887 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:35,887 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:47:35,887 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:47:35,887 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:35,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:47:35,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:47:35,888 INFO L87 Difference]: Start difference. First operand 34935 states and 114696 transitions. Second operand 3 states. [2019-12-27 21:47:36,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:36,120 INFO L93 Difference]: Finished difference Result 52469 states and 171833 transitions. [2019-12-27 21:47:36,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:47:36,121 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-27 21:47:36,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:36,226 INFO L225 Difference]: With dead ends: 52469 [2019-12-27 21:47:36,226 INFO L226 Difference]: Without dead ends: 52469 [2019-12-27 21:47:36,226 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:47:36,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52469 states. [2019-12-27 21:47:39,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52469 to 39684. [2019-12-27 21:47:39,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39684 states. [2019-12-27 21:47:39,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39684 states to 39684 states and 131828 transitions. [2019-12-27 21:47:39,822 INFO L78 Accepts]: Start accepts. Automaton has 39684 states and 131828 transitions. Word has length 16 [2019-12-27 21:47:39,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:39,823 INFO L462 AbstractCegarLoop]: Abstraction has 39684 states and 131828 transitions. [2019-12-27 21:47:39,823 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:47:39,823 INFO L276 IsEmpty]: Start isEmpty. Operand 39684 states and 131828 transitions. [2019-12-27 21:47:39,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 21:47:39,826 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:39,826 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:47:39,827 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:47:39,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:39,827 INFO L82 PathProgramCache]: Analyzing trace with hash 973495126, now seen corresponding path program 1 times [2019-12-27 21:47:39,828 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:39,828 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287399158] [2019-12-27 21:47:39,828 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:39,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:39,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:47:39,906 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287399158] [2019-12-27 21:47:39,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:39,907 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:47:39,907 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1031511732] [2019-12-27 21:47:39,907 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:39,909 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:39,911 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 21:47:39,912 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:39,912 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:47:39,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:47:39,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:39,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:47:39,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:47:39,913 INFO L87 Difference]: Start difference. First operand 39684 states and 131828 transitions. Second operand 5 states. [2019-12-27 21:47:40,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:40,435 INFO L93 Difference]: Finished difference Result 54128 states and 176711 transitions. [2019-12-27 21:47:40,436 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:47:40,436 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-27 21:47:40,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:40,539 INFO L225 Difference]: With dead ends: 54128 [2019-12-27 21:47:40,540 INFO L226 Difference]: Without dead ends: 54128 [2019-12-27 21:47:40,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:47:40,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54128 states. [2019-12-27 21:47:41,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54128 to 45196. [2019-12-27 21:47:41,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45196 states. [2019-12-27 21:47:41,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45196 states to 45196 states and 149182 transitions. [2019-12-27 21:47:41,442 INFO L78 Accepts]: Start accepts. Automaton has 45196 states and 149182 transitions. Word has length 16 [2019-12-27 21:47:41,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:41,442 INFO L462 AbstractCegarLoop]: Abstraction has 45196 states and 149182 transitions. [2019-12-27 21:47:41,442 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:47:41,442 INFO L276 IsEmpty]: Start isEmpty. Operand 45196 states and 149182 transitions. [2019-12-27 21:47:41,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 21:47:41,455 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:41,456 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:47:41,456 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:47:41,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:41,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1203621831, now seen corresponding path program 1 times [2019-12-27 21:47:41,457 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:41,457 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852114849] [2019-12-27 21:47:41,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:41,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:41,579 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:47:41,579 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852114849] [2019-12-27 21:47:41,579 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:41,580 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:47:41,580 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [351849020] [2019-12-27 21:47:41,580 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:41,586 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:41,595 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 21:47:41,595 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:41,662 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:47:41,662 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:47:41,663 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:41,663 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:47:41,663 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:47:41,663 INFO L87 Difference]: Start difference. First operand 45196 states and 149182 transitions. Second operand 7 states. [2019-12-27 21:47:43,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:43,234 INFO L93 Difference]: Finished difference Result 67629 states and 216350 transitions. [2019-12-27 21:47:43,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 21:47:43,235 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 21:47:43,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:43,355 INFO L225 Difference]: With dead ends: 67629 [2019-12-27 21:47:43,355 INFO L226 Difference]: Without dead ends: 67622 [2019-12-27 21:47:43,356 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:47:43,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67622 states. [2019-12-27 21:47:44,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67622 to 44823. [2019-12-27 21:47:44,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44823 states. [2019-12-27 21:47:44,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44823 states to 44823 states and 147733 transitions. [2019-12-27 21:47:44,279 INFO L78 Accepts]: Start accepts. Automaton has 44823 states and 147733 transitions. Word has length 22 [2019-12-27 21:47:44,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:44,279 INFO L462 AbstractCegarLoop]: Abstraction has 44823 states and 147733 transitions. [2019-12-27 21:47:44,279 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:47:44,279 INFO L276 IsEmpty]: Start isEmpty. Operand 44823 states and 147733 transitions. [2019-12-27 21:47:44,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 21:47:44,296 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:44,296 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:47:44,296 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:47:44,297 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:44,297 INFO L82 PathProgramCache]: Analyzing trace with hash -573645910, now seen corresponding path program 1 times [2019-12-27 21:47:44,297 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:44,298 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723596032] [2019-12-27 21:47:44,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:44,361 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:47:44,362 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723596032] [2019-12-27 21:47:44,363 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:44,363 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:47:44,363 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2128210023] [2019-12-27 21:47:44,363 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:44,368 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:44,379 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 21:47:44,380 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:44,411 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 21:47:44,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:47:44,412 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:44,412 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:47:44,412 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:47:44,412 INFO L87 Difference]: Start difference. First operand 44823 states and 147733 transitions. Second operand 5 states. [2019-12-27 21:47:44,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:44,504 INFO L93 Difference]: Finished difference Result 18428 states and 57604 transitions. [2019-12-27 21:47:44,505 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:47:44,505 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 21:47:44,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:44,538 INFO L225 Difference]: With dead ends: 18428 [2019-12-27 21:47:44,539 INFO L226 Difference]: Without dead ends: 18428 [2019-12-27 21:47:44,539 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:47:44,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18428 states. [2019-12-27 21:47:44,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18428 to 18100. [2019-12-27 21:47:44,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18100 states. [2019-12-27 21:47:44,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18100 states to 18100 states and 56668 transitions. [2019-12-27 21:47:44,894 INFO L78 Accepts]: Start accepts. Automaton has 18100 states and 56668 transitions. Word has length 25 [2019-12-27 21:47:44,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:44,895 INFO L462 AbstractCegarLoop]: Abstraction has 18100 states and 56668 transitions. [2019-12-27 21:47:44,895 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:47:44,895 INFO L276 IsEmpty]: Start isEmpty. Operand 18100 states and 56668 transitions. [2019-12-27 21:47:44,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 21:47:44,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:44,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:47:44,909 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:47:44,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:44,910 INFO L82 PathProgramCache]: Analyzing trace with hash -558988390, now seen corresponding path program 1 times [2019-12-27 21:47:44,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:44,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [6475284] [2019-12-27 21:47:44,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:44,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:45,002 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:47:45,003 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [6475284] [2019-12-27 21:47:45,003 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:45,003 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:47:45,003 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [247413236] [2019-12-27 21:47:45,003 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:45,008 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:45,014 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 21:47:45,014 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:45,014 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:47:45,015 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 21:47:45,015 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:45,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 21:47:45,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 21:47:45,015 INFO L87 Difference]: Start difference. First operand 18100 states and 56668 transitions. Second operand 6 states. [2019-12-27 21:47:45,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:45,645 INFO L93 Difference]: Finished difference Result 25507 states and 76943 transitions. [2019-12-27 21:47:45,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 21:47:45,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 21:47:45,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:45,700 INFO L225 Difference]: With dead ends: 25507 [2019-12-27 21:47:45,700 INFO L226 Difference]: Without dead ends: 25507 [2019-12-27 21:47:45,701 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:47:45,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25507 states. [2019-12-27 21:47:46,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25507 to 20897. [2019-12-27 21:47:46,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20897 states. [2019-12-27 21:47:46,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20897 states to 20897 states and 64463 transitions. [2019-12-27 21:47:46,455 INFO L78 Accepts]: Start accepts. Automaton has 20897 states and 64463 transitions. Word has length 27 [2019-12-27 21:47:46,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:46,455 INFO L462 AbstractCegarLoop]: Abstraction has 20897 states and 64463 transitions. [2019-12-27 21:47:46,456 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 21:47:46,456 INFO L276 IsEmpty]: Start isEmpty. Operand 20897 states and 64463 transitions. [2019-12-27 21:47:46,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 21:47:46,481 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:46,481 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:47:46,481 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:47:46,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:46,482 INFO L82 PathProgramCache]: Analyzing trace with hash -856650103, now seen corresponding path program 1 times [2019-12-27 21:47:46,482 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:46,482 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208637154] [2019-12-27 21:47:46,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:46,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:46,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:47:46,594 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208637154] [2019-12-27 21:47:46,594 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:46,594 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:47:46,594 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1998000812] [2019-12-27 21:47:46,594 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:46,600 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:46,613 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 21:47:46,613 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:46,631 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:47:46,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:47:46,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:46,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:47:46,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:47:46,632 INFO L87 Difference]: Start difference. First operand 20897 states and 64463 transitions. Second operand 8 states. [2019-12-27 21:47:47,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:47,833 INFO L93 Difference]: Finished difference Result 28486 states and 85230 transitions. [2019-12-27 21:47:47,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:47:47,834 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 33 [2019-12-27 21:47:47,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:47,875 INFO L225 Difference]: With dead ends: 28486 [2019-12-27 21:47:47,875 INFO L226 Difference]: Without dead ends: 28486 [2019-12-27 21:47:47,875 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=101, Invalid=279, Unknown=0, NotChecked=0, Total=380 [2019-12-27 21:47:47,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28486 states. [2019-12-27 21:47:48,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28486 to 19834. [2019-12-27 21:47:48,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19834 states. [2019-12-27 21:47:48,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19834 states to 19834 states and 61281 transitions. [2019-12-27 21:47:48,260 INFO L78 Accepts]: Start accepts. Automaton has 19834 states and 61281 transitions. Word has length 33 [2019-12-27 21:47:48,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:48,261 INFO L462 AbstractCegarLoop]: Abstraction has 19834 states and 61281 transitions. [2019-12-27 21:47:48,261 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:47:48,261 INFO L276 IsEmpty]: Start isEmpty. Operand 19834 states and 61281 transitions. [2019-12-27 21:47:48,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:47:48,287 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:48,287 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:47:48,287 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:47:48,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:48,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1785376658, now seen corresponding path program 1 times [2019-12-27 21:47:48,288 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:48,289 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518737827] [2019-12-27 21:47:48,289 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:48,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:48,359 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:47:48,360 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518737827] [2019-12-27 21:47:48,360 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:48,360 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 21:47:48,361 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1525980508] [2019-12-27 21:47:48,361 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:48,368 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:48,413 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 147 states and 287 transitions. [2019-12-27 21:47:48,413 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:48,513 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:47:48,514 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:47:48,514 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:48,514 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:47:48,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:47:48,514 INFO L87 Difference]: Start difference. First operand 19834 states and 61281 transitions. Second operand 8 states. [2019-12-27 21:47:49,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:49,668 INFO L93 Difference]: Finished difference Result 28283 states and 86522 transitions. [2019-12-27 21:47:49,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 21:47:49,669 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 39 [2019-12-27 21:47:49,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:49,711 INFO L225 Difference]: With dead ends: 28283 [2019-12-27 21:47:49,711 INFO L226 Difference]: Without dead ends: 28283 [2019-12-27 21:47:49,711 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 21:47:49,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28283 states. [2019-12-27 21:47:50,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28283 to 26386. [2019-12-27 21:47:50,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26386 states. [2019-12-27 21:47:50,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26386 states to 26386 states and 81240 transitions. [2019-12-27 21:47:50,173 INFO L78 Accepts]: Start accepts. Automaton has 26386 states and 81240 transitions. Word has length 39 [2019-12-27 21:47:50,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:50,173 INFO L462 AbstractCegarLoop]: Abstraction has 26386 states and 81240 transitions. [2019-12-27 21:47:50,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:47:50,174 INFO L276 IsEmpty]: Start isEmpty. Operand 26386 states and 81240 transitions. [2019-12-27 21:47:50,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 21:47:50,204 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:50,204 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:47:50,205 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:47:50,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:50,205 INFO L82 PathProgramCache]: Analyzing trace with hash -967157718, now seen corresponding path program 2 times [2019-12-27 21:47:50,205 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:50,206 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574069688] [2019-12-27 21:47:50,206 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:50,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:50,307 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:47:50,307 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574069688] [2019-12-27 21:47:50,308 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:50,308 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:47:50,308 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [15454122] [2019-12-27 21:47:50,308 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:50,315 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:50,380 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 331 transitions. [2019-12-27 21:47:50,380 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:50,382 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:47:50,382 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:47:50,382 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:50,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:47:50,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:47:50,383 INFO L87 Difference]: Start difference. First operand 26386 states and 81240 transitions. Second operand 3 states. [2019-12-27 21:47:50,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:50,544 INFO L93 Difference]: Finished difference Result 26386 states and 81161 transitions. [2019-12-27 21:47:50,545 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:47:50,545 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 21:47:50,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:50,608 INFO L225 Difference]: With dead ends: 26386 [2019-12-27 21:47:50,608 INFO L226 Difference]: Without dead ends: 26386 [2019-12-27 21:47:50,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:47:50,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26386 states. [2019-12-27 21:47:51,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26386 to 22631. [2019-12-27 21:47:51,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22631 states. [2019-12-27 21:47:51,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22631 states to 22631 states and 70743 transitions. [2019-12-27 21:47:51,490 INFO L78 Accepts]: Start accepts. Automaton has 22631 states and 70743 transitions. Word has length 39 [2019-12-27 21:47:51,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:51,490 INFO L462 AbstractCegarLoop]: Abstraction has 22631 states and 70743 transitions. [2019-12-27 21:47:51,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:47:51,490 INFO L276 IsEmpty]: Start isEmpty. Operand 22631 states and 70743 transitions. [2019-12-27 21:47:51,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 21:47:51,515 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:51,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] [2019-12-27 21:47:51,516 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:47:51,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:51,516 INFO L82 PathProgramCache]: Analyzing trace with hash -1172451276, now seen corresponding path program 1 times [2019-12-27 21:47:51,517 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:51,517 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907319515] [2019-12-27 21:47:51,517 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:51,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:47:51,582 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907319515] [2019-12-27 21:47:51,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:51,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:47:51,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1553797900] [2019-12-27 21:47:51,582 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:51,590 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:51,655 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 329 transitions. [2019-12-27 21:47:51,656 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:51,707 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:47:51,709 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:47:51,709 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:51,709 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:47:51,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:47:51,710 INFO L87 Difference]: Start difference. First operand 22631 states and 70743 transitions. Second operand 7 states. [2019-12-27 21:47:51,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:51,817 INFO L93 Difference]: Finished difference Result 21311 states and 67738 transitions. [2019-12-27 21:47:51,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:47:51,817 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 21:47:51,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:51,852 INFO L225 Difference]: With dead ends: 21311 [2019-12-27 21:47:51,852 INFO L226 Difference]: Without dead ends: 21311 [2019-12-27 21:47:51,852 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:47:51,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21311 states. [2019-12-27 21:47:52,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21311 to 21311. [2019-12-27 21:47:52,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21311 states. [2019-12-27 21:47:52,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21311 states to 21311 states and 67738 transitions. [2019-12-27 21:47:52,201 INFO L78 Accepts]: Start accepts. Automaton has 21311 states and 67738 transitions. Word has length 40 [2019-12-27 21:47:52,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:52,201 INFO L462 AbstractCegarLoop]: Abstraction has 21311 states and 67738 transitions. [2019-12-27 21:47:52,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:47:52,202 INFO L276 IsEmpty]: Start isEmpty. Operand 21311 states and 67738 transitions. [2019-12-27 21:47:52,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:47:52,233 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:52,233 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:47:52,233 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:47:52,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:52,233 INFO L82 PathProgramCache]: Analyzing trace with hash 236633210, now seen corresponding path program 1 times [2019-12-27 21:47:52,234 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:52,234 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396705458] [2019-12-27 21:47:52,234 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:52,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:52,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:47:52,332 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396705458] [2019-12-27 21:47:52,332 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:52,333 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:47:52,333 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1927983782] [2019-12-27 21:47:52,333 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:52,353 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:52,490 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 186 states and 322 transitions. [2019-12-27 21:47:52,491 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:52,524 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:47:52,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:47:52,525 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:52,525 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:47:52,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:47:52,525 INFO L87 Difference]: Start difference. First operand 21311 states and 67738 transitions. Second operand 8 states. [2019-12-27 21:47:53,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:53,412 INFO L93 Difference]: Finished difference Result 72190 states and 228328 transitions. [2019-12-27 21:47:53,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 21:47:53,413 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 21:47:53,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:53,509 INFO L225 Difference]: With dead ends: 72190 [2019-12-27 21:47:53,509 INFO L226 Difference]: Without dead ends: 59049 [2019-12-27 21:47:53,510 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 7 SyntacticMatches, 2 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=263, Unknown=0, NotChecked=0, Total=342 [2019-12-27 21:47:53,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59049 states. [2019-12-27 21:47:54,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59049 to 24967. [2019-12-27 21:47:54,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24967 states. [2019-12-27 21:47:54,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24967 states to 24967 states and 79925 transitions. [2019-12-27 21:47:54,280 INFO L78 Accepts]: Start accepts. Automaton has 24967 states and 79925 transitions. Word has length 65 [2019-12-27 21:47:54,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:54,281 INFO L462 AbstractCegarLoop]: Abstraction has 24967 states and 79925 transitions. [2019-12-27 21:47:54,281 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:47:54,281 INFO L276 IsEmpty]: Start isEmpty. Operand 24967 states and 79925 transitions. [2019-12-27 21:47:54,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:47:54,320 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:54,320 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:47:54,320 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:47:54,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:54,321 INFO L82 PathProgramCache]: Analyzing trace with hash 896785052, now seen corresponding path program 2 times [2019-12-27 21:47:54,322 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:54,322 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1274180367] [2019-12-27 21:47:54,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:54,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:54,546 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:47:54,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1274180367] [2019-12-27 21:47:54,547 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:54,547 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:47:54,547 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [478732325] [2019-12-27 21:47:54,547 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:54,568 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:54,724 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 163 states and 276 transitions. [2019-12-27 21:47:54,724 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:54,782 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:47:54,782 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 21:47:54,782 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:54,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 21:47:54,783 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2019-12-27 21:47:54,784 INFO L87 Difference]: Start difference. First operand 24967 states and 79925 transitions. Second operand 10 states. [2019-12-27 21:47:56,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:47:56,942 INFO L93 Difference]: Finished difference Result 76936 states and 243966 transitions. [2019-12-27 21:47:56,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 21:47:56,943 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 21:47:56,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:47:57,047 INFO L225 Difference]: With dead ends: 76936 [2019-12-27 21:47:57,047 INFO L226 Difference]: Without dead ends: 57435 [2019-12-27 21:47:57,047 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=431, Unknown=0, NotChecked=0, Total=552 [2019-12-27 21:47:57,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57435 states. [2019-12-27 21:47:57,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57435 to 29639. [2019-12-27 21:47:57,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29639 states. [2019-12-27 21:47:57,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29639 states to 29639 states and 94665 transitions. [2019-12-27 21:47:57,816 INFO L78 Accepts]: Start accepts. Automaton has 29639 states and 94665 transitions. Word has length 65 [2019-12-27 21:47:57,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:47:57,816 INFO L462 AbstractCegarLoop]: Abstraction has 29639 states and 94665 transitions. [2019-12-27 21:47:57,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 21:47:57,816 INFO L276 IsEmpty]: Start isEmpty. Operand 29639 states and 94665 transitions. [2019-12-27 21:47:57,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:47:57,855 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:47:57,855 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:47:57,855 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:47:57,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:47:57,855 INFO L82 PathProgramCache]: Analyzing trace with hash -1620990666, now seen corresponding path program 3 times [2019-12-27 21:47:57,856 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:47:57,856 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19816979] [2019-12-27 21:47:57,856 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:47:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:47:57,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:47:57,952 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19816979] [2019-12-27 21:47:57,952 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:47:57,952 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:47:57,952 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [282947574] [2019-12-27 21:47:57,953 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:47:57,973 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:47:58,125 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 202 states and 362 transitions. [2019-12-27 21:47:58,125 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:47:58,179 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:47:58,179 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 21:47:58,180 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:47:58,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 21:47:58,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 21:47:58,180 INFO L87 Difference]: Start difference. First operand 29639 states and 94665 transitions. Second operand 8 states. [2019-12-27 21:48:00,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:00,032 INFO L93 Difference]: Finished difference Result 79319 states and 248856 transitions. [2019-12-27 21:48:00,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:48:00,033 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2019-12-27 21:48:00,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:00,169 INFO L225 Difference]: With dead ends: 79319 [2019-12-27 21:48:00,169 INFO L226 Difference]: Without dead ends: 70462 [2019-12-27 21:48:00,170 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 7 SyntacticMatches, 3 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2019-12-27 21:48:00,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70462 states. [2019-12-27 21:48:00,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70462 to 29947. [2019-12-27 21:48:00,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29947 states. [2019-12-27 21:48:01,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29947 states to 29947 states and 95616 transitions. [2019-12-27 21:48:01,042 INFO L78 Accepts]: Start accepts. Automaton has 29947 states and 95616 transitions. Word has length 65 [2019-12-27 21:48:01,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:01,042 INFO L462 AbstractCegarLoop]: Abstraction has 29947 states and 95616 transitions. [2019-12-27 21:48:01,042 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 21:48:01,042 INFO L276 IsEmpty]: Start isEmpty. Operand 29947 states and 95616 transitions. [2019-12-27 21:48:01,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 21:48:01,075 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:01,076 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:48:01,076 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:48:01,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:01,076 INFO L82 PathProgramCache]: Analyzing trace with hash 691532486, now seen corresponding path program 4 times [2019-12-27 21:48:01,076 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:01,077 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729844616] [2019-12-27 21:48:01,077 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:01,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:48:01,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:48:01,151 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729844616] [2019-12-27 21:48:01,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:48:01,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:48:01,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1269966161] [2019-12-27 21:48:01,152 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:48:01,171 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:48:01,459 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 278 states and 501 transitions. [2019-12-27 21:48:01,459 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:48:01,460 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:48:01,460 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:48:01,460 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:48:01,461 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:48:01,461 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:48:01,461 INFO L87 Difference]: Start difference. First operand 29947 states and 95616 transitions. Second operand 3 states. [2019-12-27 21:48:01,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:01,631 INFO L93 Difference]: Finished difference Result 34953 states and 110763 transitions. [2019-12-27 21:48:01,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:48:01,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 21:48:01,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:01,683 INFO L225 Difference]: With dead ends: 34953 [2019-12-27 21:48:01,683 INFO L226 Difference]: Without dead ends: 34953 [2019-12-27 21:48:01,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:48:01,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34953 states. [2019-12-27 21:48:02,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34953 to 30783. [2019-12-27 21:48:02,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30783 states. [2019-12-27 21:48:02,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30783 states to 30783 states and 98542 transitions. [2019-12-27 21:48:02,497 INFO L78 Accepts]: Start accepts. Automaton has 30783 states and 98542 transitions. Word has length 65 [2019-12-27 21:48:02,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:02,497 INFO L462 AbstractCegarLoop]: Abstraction has 30783 states and 98542 transitions. [2019-12-27 21:48:02,498 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:48:02,498 INFO L276 IsEmpty]: Start isEmpty. Operand 30783 states and 98542 transitions. [2019-12-27 21:48:02,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:48:02,537 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:02,537 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:48:02,538 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:48:02,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:02,538 INFO L82 PathProgramCache]: Analyzing trace with hash 868435461, now seen corresponding path program 1 times [2019-12-27 21:48:02,538 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:02,539 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891011917] [2019-12-27 21:48:02,539 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:48:02,595 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:48:02,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [891011917] [2019-12-27 21:48:02,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:48:02,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 21:48:02,596 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [121391435] [2019-12-27 21:48:02,596 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:48:02,619 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:48:02,869 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 178 states and 305 transitions. [2019-12-27 21:48:02,869 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:48:02,892 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 21:48:02,892 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 21:48:02,893 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:48:02,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 21:48:02,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:48:02,893 INFO L87 Difference]: Start difference. First operand 30783 states and 98542 transitions. Second operand 5 states. [2019-12-27 21:48:03,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:03,697 INFO L93 Difference]: Finished difference Result 53671 states and 170907 transitions. [2019-12-27 21:48:03,697 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 21:48:03,698 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 66 [2019-12-27 21:48:03,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:03,829 INFO L225 Difference]: With dead ends: 53671 [2019-12-27 21:48:03,829 INFO L226 Difference]: Without dead ends: 53671 [2019-12-27 21:48:03,829 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:48:04,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53671 states. [2019-12-27 21:48:04,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53671 to 34219. [2019-12-27 21:48:04,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34219 states. [2019-12-27 21:48:04,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34219 states to 34219 states and 110736 transitions. [2019-12-27 21:48:04,963 INFO L78 Accepts]: Start accepts. Automaton has 34219 states and 110736 transitions. Word has length 66 [2019-12-27 21:48:04,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:04,964 INFO L462 AbstractCegarLoop]: Abstraction has 34219 states and 110736 transitions. [2019-12-27 21:48:04,964 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 21:48:04,964 INFO L276 IsEmpty]: Start isEmpty. Operand 34219 states and 110736 transitions. [2019-12-27 21:48:05,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:48:05,000 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:05,000 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:48:05,000 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:48:05,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:05,000 INFO L82 PathProgramCache]: Analyzing trace with hash -909174781, now seen corresponding path program 2 times [2019-12-27 21:48:05,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:05,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375729221] [2019-12-27 21:48:05,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:05,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:48:05,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:48:05,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375729221] [2019-12-27 21:48:05,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:48:05,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:48:05,044 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1913425962] [2019-12-27 21:48:05,045 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:48:05,066 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:48:05,272 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 174 states and 297 transitions. [2019-12-27 21:48:05,273 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:48:05,280 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:48:05,280 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 21:48:05,281 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:48:05,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 21:48:05,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:48:05,281 INFO L87 Difference]: Start difference. First operand 34219 states and 110736 transitions. Second operand 3 states. [2019-12-27 21:48:05,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:05,743 INFO L93 Difference]: Finished difference Result 47990 states and 153962 transitions. [2019-12-27 21:48:05,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 21:48:05,743 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 21:48:05,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:05,816 INFO L225 Difference]: With dead ends: 47990 [2019-12-27 21:48:05,816 INFO L226 Difference]: Without dead ends: 47990 [2019-12-27 21:48:05,816 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 21:48:05,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47990 states. [2019-12-27 21:48:06,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47990 to 34147. [2019-12-27 21:48:06,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34147 states. [2019-12-27 21:48:06,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34147 states to 34147 states and 110505 transitions. [2019-12-27 21:48:06,491 INFO L78 Accepts]: Start accepts. Automaton has 34147 states and 110505 transitions. Word has length 66 [2019-12-27 21:48:06,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:06,492 INFO L462 AbstractCegarLoop]: Abstraction has 34147 states and 110505 transitions. [2019-12-27 21:48:06,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 21:48:06,492 INFO L276 IsEmpty]: Start isEmpty. Operand 34147 states and 110505 transitions. [2019-12-27 21:48:06,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:48:06,532 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:06,532 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:48:06,532 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:48:06,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:06,532 INFO L82 PathProgramCache]: Analyzing trace with hash -909555473, now seen corresponding path program 3 times [2019-12-27 21:48:06,533 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:06,533 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644611862] [2019-12-27 21:48:06,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:06,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:48:06,626 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:48:06,627 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644611862] [2019-12-27 21:48:06,627 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:48:06,627 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:48:06,627 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [356892964] [2019-12-27 21:48:06,628 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:48:06,648 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:48:06,821 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 167 states and 280 transitions. [2019-12-27 21:48:06,821 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:48:06,841 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 21:48:06,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:48:06,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:48:06,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:48:06,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:48:06,843 INFO L87 Difference]: Start difference. First operand 34147 states and 110505 transitions. Second operand 7 states. [2019-12-27 21:48:07,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:07,384 INFO L93 Difference]: Finished difference Result 70843 states and 225594 transitions. [2019-12-27 21:48:07,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 21:48:07,384 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 21:48:07,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:07,487 INFO L225 Difference]: With dead ends: 70843 [2019-12-27 21:48:07,487 INFO L226 Difference]: Without dead ends: 65288 [2019-12-27 21:48:07,488 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-27 21:48:07,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65288 states. [2019-12-27 21:48:08,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65288 to 34211. [2019-12-27 21:48:08,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34211 states. [2019-12-27 21:48:08,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34211 states to 34211 states and 110723 transitions. [2019-12-27 21:48:08,296 INFO L78 Accepts]: Start accepts. Automaton has 34211 states and 110723 transitions. Word has length 66 [2019-12-27 21:48:08,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:08,296 INFO L462 AbstractCegarLoop]: Abstraction has 34211 states and 110723 transitions. [2019-12-27 21:48:08,296 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:48:08,297 INFO L276 IsEmpty]: Start isEmpty. Operand 34211 states and 110723 transitions. [2019-12-27 21:48:08,332 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:48:08,333 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:08,333 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:48:08,333 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:48:08,333 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:08,333 INFO L82 PathProgramCache]: Analyzing trace with hash 862222067, now seen corresponding path program 4 times [2019-12-27 21:48:08,334 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:08,334 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469830577] [2019-12-27 21:48:08,334 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:08,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:48:08,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:48:08,586 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469830577] [2019-12-27 21:48:08,586 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:48:08,586 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 21:48:08,586 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [882688188] [2019-12-27 21:48:08,586 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:48:08,607 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:48:08,822 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 229 states and 388 transitions. [2019-12-27 21:48:08,822 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:48:08,840 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:48:08,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 21:48:08,841 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:48:08,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 21:48:08,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-27 21:48:08,842 INFO L87 Difference]: Start difference. First operand 34211 states and 110723 transitions. Second operand 7 states. [2019-12-27 21:48:10,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:10,088 INFO L93 Difference]: Finished difference Result 68058 states and 217802 transitions. [2019-12-27 21:48:10,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-12-27 21:48:10,089 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-27 21:48:10,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:10,203 INFO L225 Difference]: With dead ends: 68058 [2019-12-27 21:48:10,203 INFO L226 Difference]: Without dead ends: 68058 [2019-12-27 21:48:10,204 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 6 SyntacticMatches, 2 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=181, Unknown=0, NotChecked=0, Total=272 [2019-12-27 21:48:10,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68058 states. [2019-12-27 21:48:11,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68058 to 35149. [2019-12-27 21:48:11,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35149 states. [2019-12-27 21:48:11,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35149 states to 35149 states and 113605 transitions. [2019-12-27 21:48:11,102 INFO L78 Accepts]: Start accepts. Automaton has 35149 states and 113605 transitions. Word has length 66 [2019-12-27 21:48:11,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:11,102 INFO L462 AbstractCegarLoop]: Abstraction has 35149 states and 113605 transitions. [2019-12-27 21:48:11,102 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 21:48:11,102 INFO L276 IsEmpty]: Start isEmpty. Operand 35149 states and 113605 transitions. [2019-12-27 21:48:11,140 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:48:11,140 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:11,140 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:48:11,140 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:48:11,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:11,140 INFO L82 PathProgramCache]: Analyzing trace with hash 605319499, now seen corresponding path program 5 times [2019-12-27 21:48:11,141 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:11,141 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377573062] [2019-12-27 21:48:11,141 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:48:11,208 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:48:11,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377573062] [2019-12-27 21:48:11,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:48:11,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 21:48:11,209 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [132455508] [2019-12-27 21:48:11,209 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:48:11,229 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:48:11,438 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 238 states and 415 transitions. [2019-12-27 21:48:11,438 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:48:11,439 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 21:48:11,439 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:48:11,439 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:48:11,439 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:48:11,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:48:11,440 INFO L87 Difference]: Start difference. First operand 35149 states and 113605 transitions. Second operand 4 states. [2019-12-27 21:48:11,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:11,812 INFO L93 Difference]: Finished difference Result 41357 states and 133048 transitions. [2019-12-27 21:48:11,812 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 21:48:11,812 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 21:48:11,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:11,873 INFO L225 Difference]: With dead ends: 41357 [2019-12-27 21:48:11,873 INFO L226 Difference]: Without dead ends: 41357 [2019-12-27 21:48:11,874 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:48:12,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41357 states. [2019-12-27 21:48:12,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41357 to 31976. [2019-12-27 21:48:12,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31976 states. [2019-12-27 21:48:12,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31976 states to 31976 states and 102860 transitions. [2019-12-27 21:48:12,484 INFO L78 Accepts]: Start accepts. Automaton has 31976 states and 102860 transitions. Word has length 66 [2019-12-27 21:48:12,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:12,484 INFO L462 AbstractCegarLoop]: Abstraction has 31976 states and 102860 transitions. [2019-12-27 21:48:12,484 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:48:12,484 INFO L276 IsEmpty]: Start isEmpty. Operand 31976 states and 102860 transitions. [2019-12-27 21:48:12,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 21:48:12,519 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:12,519 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:48:12,519 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:48:12,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:12,520 INFO L82 PathProgramCache]: Analyzing trace with hash 747197170, now seen corresponding path program 1 times [2019-12-27 21:48:12,520 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:12,521 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711482309] [2019-12-27 21:48:12,521 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:12,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:48:12,581 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:48:12,581 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711482309] [2019-12-27 21:48:12,582 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:48:12,582 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 21:48:12,582 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1836313148] [2019-12-27 21:48:12,582 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:48:12,601 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:48:12,872 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 280 states and 502 transitions. [2019-12-27 21:48:12,873 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:48:12,884 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 21:48:12,884 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 21:48:12,885 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:48:12,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 21:48:12,885 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 21:48:12,885 INFO L87 Difference]: Start difference. First operand 31976 states and 102860 transitions. Second operand 4 states. [2019-12-27 21:48:13,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:13,218 INFO L93 Difference]: Finished difference Result 34683 states and 108446 transitions. [2019-12-27 21:48:13,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 21:48:13,219 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-27 21:48:13,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:13,267 INFO L225 Difference]: With dead ends: 34683 [2019-12-27 21:48:13,267 INFO L226 Difference]: Without dead ends: 34683 [2019-12-27 21:48:13,268 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 21:48:13,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34683 states. [2019-12-27 21:48:13,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34683 to 24273. [2019-12-27 21:48:13,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24273 states. [2019-12-27 21:48:13,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24273 states to 24273 states and 76412 transitions. [2019-12-27 21:48:13,715 INFO L78 Accepts]: Start accepts. Automaton has 24273 states and 76412 transitions. Word has length 66 [2019-12-27 21:48:13,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:13,715 INFO L462 AbstractCegarLoop]: Abstraction has 24273 states and 76412 transitions. [2019-12-27 21:48:13,715 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 21:48:13,715 INFO L276 IsEmpty]: Start isEmpty. Operand 24273 states and 76412 transitions. [2019-12-27 21:48:13,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:48:13,739 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:13,739 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:48:13,739 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:48:13,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:13,740 INFO L82 PathProgramCache]: Analyzing trace with hash 863231349, now seen corresponding path program 1 times [2019-12-27 21:48:13,740 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:13,741 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1334620911] [2019-12-27 21:48:13,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:13,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:48:13,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:48:13,900 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1334620911] [2019-12-27 21:48:13,901 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:48:13,901 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:48:13,901 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [663819118] [2019-12-27 21:48:13,901 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:48:13,921 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:48:14,358 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 187 states and 322 transitions. [2019-12-27 21:48:14,359 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:48:14,454 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 21:48:14,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 21:48:14,455 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:48:14,455 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 21:48:14,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-27 21:48:14,455 INFO L87 Difference]: Start difference. First operand 24273 states and 76412 transitions. Second operand 12 states. [2019-12-27 21:48:16,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:16,033 INFO L93 Difference]: Finished difference Result 35523 states and 111659 transitions. [2019-12-27 21:48:16,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 21:48:16,033 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-27 21:48:16,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:16,077 INFO L225 Difference]: With dead ends: 35523 [2019-12-27 21:48:16,077 INFO L226 Difference]: Without dead ends: 28791 [2019-12-27 21:48:16,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 0 SyntacticMatches, 3 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=86, Invalid=334, Unknown=0, NotChecked=0, Total=420 [2019-12-27 21:48:16,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28791 states. [2019-12-27 21:48:16,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28791 to 24621. [2019-12-27 21:48:16,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24621 states. [2019-12-27 21:48:16,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24621 states to 24621 states and 77383 transitions. [2019-12-27 21:48:16,521 INFO L78 Accepts]: Start accepts. Automaton has 24621 states and 77383 transitions. Word has length 67 [2019-12-27 21:48:16,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:16,521 INFO L462 AbstractCegarLoop]: Abstraction has 24621 states and 77383 transitions. [2019-12-27 21:48:16,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 21:48:16,521 INFO L276 IsEmpty]: Start isEmpty. Operand 24621 states and 77383 transitions. [2019-12-27 21:48:16,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:48:16,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:16,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:48:16,552 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:48:16,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:16,553 INFO L82 PathProgramCache]: Analyzing trace with hash -783490325, now seen corresponding path program 2 times [2019-12-27 21:48:16,553 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:16,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172407462] [2019-12-27 21:48:16,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:16,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:48:16,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:48:16,761 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172407462] [2019-12-27 21:48:16,761 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:48:16,761 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 21:48:16,761 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1036927278] [2019-12-27 21:48:16,761 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:48:16,778 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:48:17,037 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 197 states and 341 transitions. [2019-12-27 21:48:17,038 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:48:17,218 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 13 times. [2019-12-27 21:48:17,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-27 21:48:17,219 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:48:17,219 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-27 21:48:17,220 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2019-12-27 21:48:17,222 INFO L87 Difference]: Start difference. First operand 24621 states and 77383 transitions. Second operand 13 states. [2019-12-27 21:48:19,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:19,195 INFO L93 Difference]: Finished difference Result 45644 states and 141958 transitions. [2019-12-27 21:48:19,196 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-27 21:48:19,196 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 67 [2019-12-27 21:48:19,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:19,255 INFO L225 Difference]: With dead ends: 45644 [2019-12-27 21:48:19,255 INFO L226 Difference]: Without dead ends: 40426 [2019-12-27 21:48:19,255 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 7 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=574, Unknown=0, NotChecked=0, Total=702 [2019-12-27 21:48:19,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40426 states. [2019-12-27 21:48:19,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40426 to 25169. [2019-12-27 21:48:19,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25169 states. [2019-12-27 21:48:19,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25169 states to 25169 states and 78786 transitions. [2019-12-27 21:48:19,824 INFO L78 Accepts]: Start accepts. Automaton has 25169 states and 78786 transitions. Word has length 67 [2019-12-27 21:48:19,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:19,825 INFO L462 AbstractCegarLoop]: Abstraction has 25169 states and 78786 transitions. [2019-12-27 21:48:19,825 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-27 21:48:19,825 INFO L276 IsEmpty]: Start isEmpty. Operand 25169 states and 78786 transitions. [2019-12-27 21:48:19,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:48:19,851 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:19,851 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:48:19,852 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:48:19,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:19,852 INFO L82 PathProgramCache]: Analyzing trace with hash 17868619, now seen corresponding path program 3 times [2019-12-27 21:48:19,853 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:19,853 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054069510] [2019-12-27 21:48:19,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:19,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:48:19,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:48:19,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054069510] [2019-12-27 21:48:19,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:48:19,994 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:48:19,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [492048769] [2019-12-27 21:48:19,994 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:48:20,010 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:48:20,669 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 302 states and 617 transitions. [2019-12-27 21:48:20,670 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:48:20,745 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:48:20,883 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 21:48:21,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 6 terms [2019-12-27 21:48:21,419 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 21:48:21,420 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-27 21:48:21,420 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:48:21,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-27 21:48:21,421 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=284, Unknown=0, NotChecked=0, Total=342 [2019-12-27 21:48:21,421 INFO L87 Difference]: Start difference. First operand 25169 states and 78786 transitions. Second operand 19 states. [2019-12-27 21:48:25,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:25,637 INFO L93 Difference]: Finished difference Result 34459 states and 107407 transitions. [2019-12-27 21:48:25,637 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 21:48:25,637 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 67 [2019-12-27 21:48:25,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:25,680 INFO L225 Difference]: With dead ends: 34459 [2019-12-27 21:48:25,680 INFO L226 Difference]: Without dead ends: 30448 [2019-12-27 21:48:25,681 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=139, Invalid=617, Unknown=0, NotChecked=0, Total=756 [2019-12-27 21:48:25,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30448 states. [2019-12-27 21:48:26,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30448 to 24805. [2019-12-27 21:48:26,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24805 states. [2019-12-27 21:48:26,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24805 states to 24805 states and 77645 transitions. [2019-12-27 21:48:26,119 INFO L78 Accepts]: Start accepts. Automaton has 24805 states and 77645 transitions. Word has length 67 [2019-12-27 21:48:26,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:26,119 INFO L462 AbstractCegarLoop]: Abstraction has 24805 states and 77645 transitions. [2019-12-27 21:48:26,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-27 21:48:26,120 INFO L276 IsEmpty]: Start isEmpty. Operand 24805 states and 77645 transitions. [2019-12-27 21:48:26,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:48:26,145 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:26,145 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:48:26,145 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:48:26,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:26,146 INFO L82 PathProgramCache]: Analyzing trace with hash 455548979, now seen corresponding path program 4 times [2019-12-27 21:48:26,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:26,146 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153674930] [2019-12-27 21:48:26,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:48:26,329 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:48:26,329 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153674930] [2019-12-27 21:48:26,329 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:48:26,330 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:48:26,330 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [808974798] [2019-12-27 21:48:26,330 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:48:26,340 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:48:26,478 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 188 states and 324 transitions. [2019-12-27 21:48:26,478 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:48:26,652 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 21:48:26,652 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 21:48:26,653 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:48:26,653 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 21:48:26,653 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 21:48:26,653 INFO L87 Difference]: Start difference. First operand 24805 states and 77645 transitions. Second operand 15 states. [2019-12-27 21:48:28,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:28,819 INFO L93 Difference]: Finished difference Result 50603 states and 158867 transitions. [2019-12-27 21:48:28,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2019-12-27 21:48:28,819 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2019-12-27 21:48:28,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:28,888 INFO L225 Difference]: With dead ends: 50603 [2019-12-27 21:48:28,888 INFO L226 Difference]: Without dead ends: 48055 [2019-12-27 21:48:28,889 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 4 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=234, Invalid=1026, Unknown=0, NotChecked=0, Total=1260 [2019-12-27 21:48:29,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48055 states. [2019-12-27 21:48:29,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48055 to 28332. [2019-12-27 21:48:29,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28332 states. [2019-12-27 21:48:29,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28332 states to 28332 states and 88818 transitions. [2019-12-27 21:48:29,514 INFO L78 Accepts]: Start accepts. Automaton has 28332 states and 88818 transitions. Word has length 67 [2019-12-27 21:48:29,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:29,514 INFO L462 AbstractCegarLoop]: Abstraction has 28332 states and 88818 transitions. [2019-12-27 21:48:29,514 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 21:48:29,514 INFO L276 IsEmpty]: Start isEmpty. Operand 28332 states and 88818 transitions. [2019-12-27 21:48:29,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:48:29,544 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:29,544 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:48:29,544 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:48:29,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:29,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1142961965, now seen corresponding path program 5 times [2019-12-27 21:48:29,545 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:29,545 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724876312] [2019-12-27 21:48:29,545 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:48:29,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:48:29,685 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724876312] [2019-12-27 21:48:29,685 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:48:29,685 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 21:48:29,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [720092849] [2019-12-27 21:48:29,685 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:48:29,703 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:48:29,998 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 323 states and 677 transitions. [2019-12-27 21:48:29,999 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:48:30,266 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 21:48:30,266 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 21:48:30,266 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:48:30,266 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 21:48:30,266 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-12-27 21:48:30,267 INFO L87 Difference]: Start difference. First operand 28332 states and 88818 transitions. Second operand 16 states. [2019-12-27 21:48:33,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:33,398 INFO L93 Difference]: Finished difference Result 61293 states and 191152 transitions. [2019-12-27 21:48:33,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-12-27 21:48:33,399 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 21:48:33,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:33,477 INFO L225 Difference]: With dead ends: 61293 [2019-12-27 21:48:33,477 INFO L226 Difference]: Without dead ends: 52880 [2019-12-27 21:48:33,478 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 9 SyntacticMatches, 10 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 369 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=308, Invalid=1332, Unknown=0, NotChecked=0, Total=1640 [2019-12-27 21:48:33,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52880 states. [2019-12-27 21:48:34,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52880 to 23379. [2019-12-27 21:48:34,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23379 states. [2019-12-27 21:48:34,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23379 states to 23379 states and 72980 transitions. [2019-12-27 21:48:34,322 INFO L78 Accepts]: Start accepts. Automaton has 23379 states and 72980 transitions. Word has length 67 [2019-12-27 21:48:34,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:34,322 INFO L462 AbstractCegarLoop]: Abstraction has 23379 states and 72980 transitions. [2019-12-27 21:48:34,322 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 21:48:34,322 INFO L276 IsEmpty]: Start isEmpty. Operand 23379 states and 72980 transitions. [2019-12-27 21:48:34,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:48:34,348 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:34,348 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:48:34,348 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:48:34,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:34,349 INFO L82 PathProgramCache]: Analyzing trace with hash -1730024245, now seen corresponding path program 6 times [2019-12-27 21:48:34,349 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:34,350 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298564819] [2019-12-27 21:48:34,350 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 21:48:34,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 21:48:34,684 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298564819] [2019-12-27 21:48:34,684 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 21:48:34,684 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 21:48:34,685 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1349777687] [2019-12-27 21:48:34,685 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 21:48:34,713 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 21:48:35,105 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 310 states and 633 transitions. [2019-12-27 21:48:35,105 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 21:48:35,434 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 22 times. [2019-12-27 21:48:35,434 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 21:48:35,435 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 21:48:35,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 21:48:35,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 21:48:35,435 INFO L87 Difference]: Start difference. First operand 23379 states and 72980 transitions. Second operand 16 states. [2019-12-27 21:48:36,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 21:48:36,707 INFO L93 Difference]: Finished difference Result 40285 states and 125634 transitions. [2019-12-27 21:48:36,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-27 21:48:36,708 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 67 [2019-12-27 21:48:36,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 21:48:36,764 INFO L225 Difference]: With dead ends: 40285 [2019-12-27 21:48:36,764 INFO L226 Difference]: Without dead ends: 40042 [2019-12-27 21:48:36,764 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 10 SyntacticMatches, 9 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 173 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=168, Invalid=762, Unknown=0, NotChecked=0, Total=930 [2019-12-27 21:48:36,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40042 states. [2019-12-27 21:48:37,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40042 to 23203. [2019-12-27 21:48:37,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23203 states. [2019-12-27 21:48:37,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23203 states to 23203 states and 72508 transitions. [2019-12-27 21:48:37,261 INFO L78 Accepts]: Start accepts. Automaton has 23203 states and 72508 transitions. Word has length 67 [2019-12-27 21:48:37,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 21:48:37,262 INFO L462 AbstractCegarLoop]: Abstraction has 23203 states and 72508 transitions. [2019-12-27 21:48:37,262 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 21:48:37,262 INFO L276 IsEmpty]: Start isEmpty. Operand 23203 states and 72508 transitions. [2019-12-27 21:48:37,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 21:48:37,284 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 21:48:37,285 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 21:48:37,285 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 21:48:37,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 21:48:37,285 INFO L82 PathProgramCache]: Analyzing trace with hash 1929562173, now seen corresponding path program 7 times [2019-12-27 21:48:37,286 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 21:48:37,286 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725165078] [2019-12-27 21:48:37,286 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 21:48:37,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:48:37,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 21:48:37,401 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 21:48:37,402 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 21:48:37,406 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [891] [891] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_61| 0 0))) (and (= v_~main$tmp_guard1~0_17 0) (= v_~main$tmp_guard0~0_10 0) (= |v_ULTIMATE.start_main_~#t1573~0.offset_16| 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t1573~0.base_21|) 0) (= 0 v_~z$r_buff1_thd0~0_24) (= v_~z$r_buff0_thd3~0_78 0) (= 0 v_~__unbuffered_p1_EAX~0_14) (= v_~z$w_buff0_used~0_113 0) (= |v_#memory_int_17| (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1573~0.base_21| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1573~0.base_21|) |v_ULTIMATE.start_main_~#t1573~0.offset_16| 0))) (= v_~z$read_delayed_var~0.offset_6 0) (= 0 v_~__unbuffered_p0_EAX~0_15) (= |v_#NULL.offset_7| 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1573~0.base_21|) (= 0 v_~z$w_buff0~0_27) (= 0 v_~z$r_buff1_thd2~0_17) (= 0 v_~z$flush_delayed~0_13) (= v_~z$r_buff0_thd2~0_20 0) (= 0 v_~__unbuffered_cnt~0_21) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~weak$$choice2~0_32) (= v_~x~0_10 0) (= 0 v_~z$r_buff1_thd1~0_17) (= v_~z$r_buff0_thd1~0_24 0) (= v_~z$read_delayed_var~0.base_6 0) (= 0 v_~__unbuffered_p2_EAX~0_16) (= 0 v_~z$w_buff1_used~0_72) (= 0 v_~weak$$choice0~0_7) (= |v_#valid_59| (store .cse0 |v_ULTIMATE.start_main_~#t1573~0.base_21| 1)) (= v_~z$read_delayed~0_7 0) (= v_~z$mem_tmp~0_10 0) (= v_~z$r_buff0_thd0~0_18 0) (= 0 |v_#NULL.base_7|) (= v_~z~0_27 0) (= 0 v_~z$r_buff1_thd3~0_50) (= 0 v_~z$w_buff1~0_26) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1573~0.base_21| 4) |v_#length_21|) (= 0 v_~y~0_9))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_61|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_17, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_11|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_9|, ULTIMATE.start_main_~#t1574~0.offset=|v_ULTIMATE.start_main_~#t1574~0.offset_13|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_9|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_22|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_18, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_15, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, ULTIMATE.start_main_~#t1574~0.base=|v_ULTIMATE.start_main_~#t1574~0.base_19|, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_16, ~z$mem_tmp~0=v_~z$mem_tmp~0_10, ULTIMATE.start_main_~#t1575~0.offset=|v_ULTIMATE.start_main_~#t1575~0.offset_15|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_72, ~z$flush_delayed~0=v_~z$flush_delayed~0_13, ~weak$$choice0~0=v_~weak$$choice0~0_7, ULTIMATE.start_main_~#t1573~0.base=|v_ULTIMATE.start_main_~#t1573~0.base_21|, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_17, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_78, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_21, ~x~0=v_~x~0_10, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_26, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_17, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_11|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_9|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_24, ULTIMATE.start_main_~#t1573~0.offset=|v_ULTIMATE.start_main_~#t1573~0.offset_16|, ~y~0=v_~y~0_9, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_20, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ULTIMATE.start_main_~#t1575~0.base=|v_ULTIMATE.start_main_~#t1575~0.base_19|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_113, ~z$w_buff0~0=v_~z$w_buff0~0_27, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_50, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_17|, #valid=|v_#valid_59|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_27, ~weak$$choice2~0=v_~weak$$choice2~0_32, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_24} AuxVars[] AssignedVars[~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_~#t1574~0.offset, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ULTIMATE.start_main_~#t1574~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_~#t1575~0.offset, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t1573~0.base, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ULTIMATE.start_main_~#t1573~0.offset, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_~#t1575~0.base, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, #NULL.base, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:48:37,407 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L822-1-->L824: Formula: (and (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1574~0.base_11| 1)) (= (store |v_#length_18| |v_ULTIMATE.start_main_~#t1574~0.base_11| 4) |v_#length_17|) (= |v_ULTIMATE.start_main_~#t1574~0.offset_9| 0) (= (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1574~0.base_11|) 0) (not (= 0 |v_ULTIMATE.start_main_~#t1574~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1574~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1574~0.base_11|) |v_ULTIMATE.start_main_~#t1574~0.offset_9| 1)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1574~0.base_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t1574~0.base=|v_ULTIMATE.start_main_~#t1574~0.base_11|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1574~0.offset=|v_ULTIMATE.start_main_~#t1574~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, ULTIMATE.start_main_~#t1574~0.base, #length, ULTIMATE.start_main_~#t1574~0.offset] because there is no mapped edge [2019-12-27 21:48:37,408 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd1~0_16 1) (not (= 0 v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8)) (= v_~z$r_buff0_thd2~0_15 v_~z$r_buff1_thd2~0_11) (= v_~z$r_buff0_thd1~0_17 v_~z$r_buff1_thd1~0_11) (= v_~z$r_buff0_thd3~0_52 v_~z$r_buff1_thd3~0_33) (= v_~__unbuffered_p0_EAX~0_4 v_~x~0_4) (= v_~z$r_buff0_thd0~0_15 v_~z$r_buff1_thd0~0_10)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_17, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_4, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_15, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_33, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_10, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_11, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_11, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_52, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_8, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_16, ~x~0=v_~x~0_4, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_15} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:48:37,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1979469369 256))) (.cse1 (= (mod ~z$r_buff1_thd2~0_In1979469369 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In1979469369 |P1Thread1of1ForFork2_#t~ite9_Out1979469369|)) (and (or .cse0 .cse1) (= ~z~0_In1979469369 |P1Thread1of1ForFork2_#t~ite9_Out1979469369|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1979469369, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1979469369, ~z$w_buff1~0=~z$w_buff1~0_In1979469369, ~z~0=~z~0_In1979469369} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out1979469369|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1979469369, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1979469369, ~z$w_buff1~0=~z$w_buff1~0_In1979469369, ~z~0=~z~0_In1979469369} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 21:48:37,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-27 21:48:37,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [869] [869] L824-1-->L826: Formula: (and (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1575~0.base_13|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1575~0.base_13| 4)) (= |v_#valid_36| (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1575~0.base_13| 1)) (not (= |v_ULTIMATE.start_main_~#t1575~0.base_13| 0)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1575~0.base_13|) (= |v_ULTIMATE.start_main_~#t1575~0.offset_11| 0) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1575~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1575~0.base_13|) |v_ULTIMATE.start_main_~#t1575~0.offset_11| 2)) |v_#memory_int_11|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1575~0.offset=|v_ULTIMATE.start_main_~#t1575~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1575~0.base=|v_ULTIMATE.start_main_~#t1575~0.base_13|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1575~0.offset, ULTIMATE.start_main_~#t1575~0.base, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length] because there is no mapped edge [2019-12-27 21:48:37,410 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-1722110415 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1722110415 256)))) (or (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-1722110415|) (not .cse1)) (and (or .cse1 .cse0) (= ~z$w_buff0_used~0_In-1722110415 |P1Thread1of1ForFork2_#t~ite11_Out-1722110415|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1722110415, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1722110415} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1722110415, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1722110415|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1722110415} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 21:48:37,411 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In-624778604 256))) (.cse3 (= (mod ~z$r_buff1_thd2~0_In-624778604 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In-624778604 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-624778604 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In-624778604 |P1Thread1of1ForFork2_#t~ite12_Out-624778604|) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0))) (= |P1Thread1of1ForFork2_#t~ite12_Out-624778604| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-624778604, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-624778604, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-624778604, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-624778604} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-624778604, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-624778604, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-624778604, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-624778604|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-624778604} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 21:48:37,414 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1845327733 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1845327733 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In1845327733 |P1Thread1of1ForFork2_#t~ite13_Out1845327733|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1845327733|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1845327733, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1845327733} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1845327733, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1845327733|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1845327733} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 21:48:37,416 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [873] [873] L790-->L790-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1062832802 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite27_Out1062832802| ~z$w_buff0_used~0_In1062832802) (not .cse0) (= |P2Thread1of1ForFork0_#t~ite26_In1062832802| |P2Thread1of1ForFork0_#t~ite26_Out1062832802|)) (and (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1062832802 256)))) (or (and .cse1 (= (mod ~z$w_buff1_used~0_In1062832802 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In1062832802 256)) (and (= 0 (mod ~z$r_buff1_thd3~0_In1062832802 256)) .cse1))) (= |P2Thread1of1ForFork0_#t~ite26_Out1062832802| |P2Thread1of1ForFork0_#t~ite27_Out1062832802|) .cse0 (= |P2Thread1of1ForFork0_#t~ite26_Out1062832802| ~z$w_buff0_used~0_In1062832802)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In1062832802|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1062832802, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1062832802, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1062832802, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1062832802, ~weak$$choice2~0=~weak$$choice2~0_In1062832802} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out1062832802|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out1062832802|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1062832802, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In1062832802, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1062832802, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1062832802, ~weak$$choice2~0=~weak$$choice2~0_In1062832802} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 21:48:37,417 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_63 v_~z$r_buff0_thd3~0_62) (not (= 0 (mod v_~weak$$choice2~0_24 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_63, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_9|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_62, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 21:48:37,419 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In1452111878 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1452111878 256)))) (or (and (= ~z$w_buff0_used~0_In1452111878 |P0Thread1of1ForFork1_#t~ite5_Out1452111878|) (or .cse0 .cse1)) (and (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out1452111878|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1452111878, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1452111878} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out1452111878|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1452111878, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1452111878} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 21:48:37,420 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_22 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_22} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-27 21:48:37,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff1_used~0_In259173334 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In259173334 256))) (.cse0 (= |P2Thread1of1ForFork0_#t~ite39_Out259173334| |P2Thread1of1ForFork0_#t~ite38_Out259173334|))) (or (and (= ~z~0_In259173334 |P2Thread1of1ForFork0_#t~ite38_Out259173334|) .cse0 (or .cse1 .cse2)) (and (not .cse2) (not .cse1) (= ~z$w_buff1~0_In259173334 |P2Thread1of1ForFork0_#t~ite38_Out259173334|) .cse0))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In259173334, ~z$w_buff1_used~0=~z$w_buff1_used~0_In259173334, ~z$w_buff1~0=~z$w_buff1~0_In259173334, ~z~0=~z~0_In259173334} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out259173334|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out259173334|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In259173334, ~z$w_buff1_used~0=~z$w_buff1_used~0_In259173334, ~z$w_buff1~0=~z$w_buff1~0_In259173334, ~z~0=~z~0_In259173334} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 21:48:37,421 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In937258314 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In937258314 256) 0))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite40_Out937258314|) (not .cse0) (not .cse1)) (and (= ~z$w_buff0_used~0_In937258314 |P2Thread1of1ForFork0_#t~ite40_Out937258314|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In937258314, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In937258314} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In937258314, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out937258314|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In937258314} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 21:48:37,422 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In-398494097 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-398494097 256) 0)) (.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-398494097 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-398494097 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-398494097|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-398494097 |P2Thread1of1ForFork0_#t~ite41_Out-398494097|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-398494097, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-398494097, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-398494097, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-398494097} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-398494097, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-398494097, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-398494097, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-398494097, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-398494097|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 21:48:37,423 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In1319024848 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In1319024848 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out1319024848|) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite42_Out1319024848| ~z$r_buff0_thd3~0_In1319024848)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1319024848, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1319024848} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1319024848, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In1319024848, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out1319024848|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 21:48:37,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd3~0_In-410136254 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-410136254 256))) (.cse0 (= 0 (mod ~z$r_buff1_thd3~0_In-410136254 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In-410136254 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd3~0_In-410136254 |P2Thread1of1ForFork0_#t~ite43_Out-410136254|)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P2Thread1of1ForFork0_#t~ite43_Out-410136254|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-410136254, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-410136254, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-410136254, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-410136254} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out-410136254|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-410136254, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-410136254, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-410136254, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-410136254} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 21:48:37,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~z$r_buff1_thd3~0_44 |v_P2Thread1of1ForFork0_#t~ite43_8|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_7|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_44, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 21:48:37,425 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In796136134 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In796136134 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In796136134 256))) (.cse2 (= (mod ~z$r_buff0_thd1~0_In796136134 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In796136134 |P0Thread1of1ForFork1_#t~ite6_Out796136134|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2))) (= |P0Thread1of1ForFork1_#t~ite6_Out796136134| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In796136134, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In796136134, ~z$w_buff1_used~0=~z$w_buff1_used~0_In796136134, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In796136134} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In796136134, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out796136134|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In796136134, ~z$w_buff1_used~0=~z$w_buff1_used~0_In796136134, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In796136134} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 21:48:37,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd1~0_In231329871 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In231329871 256)))) (or (and (not .cse0) (= 0 ~z$r_buff0_thd1~0_Out231329871) (not .cse1)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_In231329871 ~z$r_buff0_thd1~0_Out231329871)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In231329871, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In231329871} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In231329871, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out231329871|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out231329871} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 21:48:37,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-144727885 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-144727885 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-144727885 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-144727885 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out-144727885| ~z$r_buff1_thd1~0_In-144727885) (or .cse2 .cse3)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork1_#t~ite8_Out-144727885| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-144727885, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-144727885, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-144727885, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-144727885} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-144727885|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-144727885, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-144727885, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-144727885, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-144727885} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 21:48:37,427 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [865] [865] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_12 |v_P0Thread1of1ForFork1_#t~ite8_8|) (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_7|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_12, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 21:48:37,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In-2129569255 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In-2129569255 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-2129569255 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In-2129569255 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite14_Out-2129569255| ~z$r_buff1_thd2~0_In-2129569255) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out-2129569255| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2129569255, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2129569255, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2129569255, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2129569255} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2129569255, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-2129569255, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-2129569255, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-2129569255|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2129569255} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 21:48:37,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [870] [870] L770-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_8| v_~z$r_buff1_thd2~0_13) (= (+ v_~__unbuffered_cnt~0_17 1) v_~__unbuffered_cnt~0_16) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_17, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_8|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_13, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_16, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_7|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 21:48:37,429 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_10) (= v_~main$tmp_guard0~0_5 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_4|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 21:48:37,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff1_used~0_In-739689872 256))) (.cse2 (= |ULTIMATE.start_main_#t~ite48_Out-739689872| |ULTIMATE.start_main_#t~ite47_Out-739689872|)) (.cse0 (= (mod ~z$r_buff1_thd0~0_In-739689872 256) 0))) (or (and (or .cse0 .cse1) (= ~z~0_In-739689872 |ULTIMATE.start_main_#t~ite47_Out-739689872|) .cse2) (and (not .cse1) .cse2 (= ~z$w_buff1~0_In-739689872 |ULTIMATE.start_main_#t~ite47_Out-739689872|) (not .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-739689872, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-739689872, ~z$w_buff1~0=~z$w_buff1~0_In-739689872, ~z~0=~z~0_In-739689872} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-739689872, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-739689872|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-739689872, ~z$w_buff1~0=~z$w_buff1~0_In-739689872, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-739689872|, ~z~0=~z~0_In-739689872} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 21:48:37,431 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In1298858867 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1298858867 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out1298858867|)) (and (= ~z$w_buff0_used~0_In1298858867 |ULTIMATE.start_main_#t~ite49_Out1298858867|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1298858867, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1298858867} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1298858867, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1298858867, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1298858867|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 21:48:37,433 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1383295755 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1383295755 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In1383295755 256))) (.cse3 (= 0 (mod ~z$w_buff1_used~0_In1383295755 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In1383295755 |ULTIMATE.start_main_#t~ite50_Out1383295755|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out1383295755|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1383295755, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1383295755, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1383295755, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1383295755} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out1383295755|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1383295755, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1383295755, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1383295755, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1383295755} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 21:48:37,434 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd0~0_In-179822701 256) 0)) (.cse0 (= (mod ~z$w_buff0_used~0_In-179822701 256) 0))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd0~0_In-179822701 |ULTIMATE.start_main_#t~ite51_Out-179822701|)) (and (not .cse1) (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite51_Out-179822701|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-179822701, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-179822701} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-179822701, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out-179822701|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-179822701} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 21:48:37,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse2 (= (mod ~z$w_buff1_used~0_In-1131985471 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd0~0_In-1131985471 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1131985471 256))) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1131985471 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite52_Out-1131985471| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite52_Out-1131985471| ~z$r_buff1_thd0~0_In-1131985471) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1131985471, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1131985471, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1131985471, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1131985471} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-1131985471|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1131985471, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1131985471, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1131985471, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1131985471} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 21:48:37,436 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [876] [876] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p2_EAX~0_10) (= v_~main$tmp_guard1~0_10 0) (= v_~__unbuffered_p0_EAX~0_9 0) (= |v_ULTIMATE.start_main_#t~ite52_15| v_~z$r_buff1_thd0~0_17) (= v_ULTIMATE.start___VERIFIER_assert_~expression_17 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|) (= 0 v_~__unbuffered_p1_EAX~0_8) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_11| (mod v_~main$tmp_guard1~0_10 256))) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_15|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_9, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_14|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_17, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_8, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_17, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_10, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_10, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_11|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 21:48:37,568 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 09:48:37 BasicIcfg [2019-12-27 21:48:37,568 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 21:48:37,571 INFO L168 Benchmark]: Toolchain (without parser) took 126583.47 ms. Allocated memory was 146.8 MB in the beginning and 3.4 GB in the end (delta: 3.3 GB). Free memory was 103.1 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-27 21:48:37,572 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 21:48:37,573 INFO L168 Benchmark]: CACSL2BoogieTranslator took 853.49 ms. Allocated memory was 146.8 MB in the beginning and 202.4 MB in the end (delta: 55.6 MB). Free memory was 102.9 MB in the beginning and 155.8 MB in the end (delta: -52.9 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. [2019-12-27 21:48:37,578 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.96 ms. Allocated memory is still 202.4 MB. Free memory was 155.8 MB in the beginning and 153.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:48:37,579 INFO L168 Benchmark]: Boogie Preprocessor took 40.10 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 150.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-12-27 21:48:37,579 INFO L168 Benchmark]: RCFGBuilder took 840.94 ms. Allocated memory is still 202.4 MB. Free memory was 150.8 MB in the beginning and 100.6 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-27 21:48:37,580 INFO L168 Benchmark]: TraceAbstraction took 124770.63 ms. Allocated memory was 202.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 100.6 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-27 21:48:37,586 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.23 ms. Allocated memory is still 146.8 MB. Free memory was 123.1 MB in the beginning and 122.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 853.49 ms. Allocated memory was 146.8 MB in the beginning and 202.4 MB in the end (delta: 55.6 MB). Free memory was 102.9 MB in the beginning and 155.8 MB in the end (delta: -52.9 MB). Peak memory consumption was 22.4 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.96 ms. Allocated memory is still 202.4 MB. Free memory was 155.8 MB in the beginning and 153.3 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.10 ms. Allocated memory is still 202.4 MB. Free memory was 153.3 MB in the beginning and 150.8 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 840.94 ms. Allocated memory is still 202.4 MB. Free memory was 150.8 MB in the beginning and 100.6 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 124770.63 ms. Allocated memory was 202.4 MB in the beginning and 3.4 GB in the end (delta: 3.2 GB). Free memory was 100.6 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 3.8s, 176 ProgramPointsBefore, 96 ProgramPointsAfterwards, 213 TransitionsBefore, 108 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 29 ChoiceCompositions, 6738 VarBasedMoverChecksPositive, 208 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 85326 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1573, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1574, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1575, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 124.4s, OverallIterations: 29, TraceHistogramMax: 1, AutomataDifference: 39.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7100 SDtfs, 10918 SDslu, 30732 SDs, 0 SdLazy, 18853 SolverSat, 426 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 17.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 492 GetRequests, 100 SyntacticMatches, 58 SemanticMatches, 334 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1335 ImplicationChecksByTransitivity, 5.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=161661occurred 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: 46.0s AutomataMinimizationTime, 28 MinimizatonAttempts, 392036 StatesRemovedByMinimization, 25 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 1409 NumberOfCodeBlocks, 1409 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 1314 ConstructedInterpolants, 0 QuantifiedInterpolants, 262216 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 28 InterpolantComputations, 28 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...