/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/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe001_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-b09bf87 [2020-10-16 12:07:11,582 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-10-16 12:07:11,585 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-10-16 12:07:11,628 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-10-16 12:07:11,628 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-10-16 12:07:11,640 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-10-16 12:07:11,641 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-10-16 12:07:11,645 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-10-16 12:07:11,648 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-10-16 12:07:11,651 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-10-16 12:07:11,652 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-10-16 12:07:11,656 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-10-16 12:07:11,656 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-10-16 12:07:11,659 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-10-16 12:07:11,662 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-10-16 12:07:11,663 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-10-16 12:07:11,665 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-10-16 12:07:11,666 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-10-16 12:07:11,669 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-10-16 12:07:11,676 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-10-16 12:07:11,678 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-10-16 12:07:11,680 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-10-16 12:07:11,681 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-10-16 12:07:11,681 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-10-16 12:07:11,687 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-10-16 12:07:11,687 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-10-16 12:07:11,688 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-10-16 12:07:11,691 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-10-16 12:07:11,691 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-10-16 12:07:11,693 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-10-16 12:07:11,694 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-10-16 12:07:11,694 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-10-16 12:07:11,695 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-10-16 12:07:11,696 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-10-16 12:07:11,697 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-10-16 12:07:11,697 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-10-16 12:07:11,698 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-10-16 12:07:11,698 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-10-16 12:07:11,699 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-10-16 12:07:11,700 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-10-16 12:07:11,701 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-10-16 12:07:11,702 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/mcr/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA.epf [2020-10-16 12:07:11,749 INFO L113 SettingsManager]: Loading preferences was successful [2020-10-16 12:07:11,750 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-10-16 12:07:11,752 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-10-16 12:07:11,752 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-10-16 12:07:11,752 INFO L138 SettingsManager]: * Use SBE=true [2020-10-16 12:07:11,752 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-10-16 12:07:11,752 INFO L138 SettingsManager]: * sizeof long=4 [2020-10-16 12:07:11,753 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-10-16 12:07:11,753 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-10-16 12:07:11,753 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-10-16 12:07:11,754 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-10-16 12:07:11,754 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-10-16 12:07:11,755 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-10-16 12:07:11,755 INFO L138 SettingsManager]: * sizeof long double=12 [2020-10-16 12:07:11,755 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-10-16 12:07:11,756 INFO L138 SettingsManager]: * Use constant arrays=true [2020-10-16 12:07:11,756 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-10-16 12:07:11,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-10-16 12:07:11,756 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-10-16 12:07:11,756 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-10-16 12:07:11,757 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-10-16 12:07:11,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-10-16 12:07:11,757 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-10-16 12:07:11,757 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2020-10-16 12:07:11,757 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-10-16 12:07:11,758 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-10-16 12:07:11,758 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-10-16 12:07:11,758 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2020-10-16 12:07:11,758 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-10-16 12:07:12,055 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-10-16 12:07:12,070 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-10-16 12:07:12,074 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-10-16 12:07:12,075 INFO L271 PluginConnector]: Initializing CDTParser... [2020-10-16 12:07:12,076 INFO L275 PluginConnector]: CDTParser initialized [2020-10-16 12:07:12,076 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe001_rmo.opt.i [2020-10-16 12:07:12,133 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cedefc14a/18f8c3eb2fe14a4a8c5eaca36175b7f7/FLAGa541f31ef [2020-10-16 12:07:12,644 INFO L306 CDTParser]: Found 1 translation units. [2020-10-16 12:07:12,645 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/pthread-wmm/safe001_rmo.opt.i [2020-10-16 12:07:12,674 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cedefc14a/18f8c3eb2fe14a4a8c5eaca36175b7f7/FLAGa541f31ef [2020-10-16 12:07:12,913 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/cedefc14a/18f8c3eb2fe14a4a8c5eaca36175b7f7 [2020-10-16 12:07:12,922 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-10-16 12:07:12,924 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2020-10-16 12:07:12,925 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-10-16 12:07:12,925 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-10-16 12:07:12,928 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-10-16 12:07:12,929 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:07:12" (1/1) ... [2020-10-16 12:07:12,932 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@230a6e65 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:12, skipping insertion in model container [2020-10-16 12:07:12,933 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.10 12:07:12" (1/1) ... [2020-10-16 12:07:12,940 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-10-16 12:07:12,991 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-10-16 12:07:13,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:07:13,585 INFO L203 MainTranslator]: Completed pre-run [2020-10-16 12:07:13,644 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-10-16 12:07:13,731 INFO L208 MainTranslator]: Completed translation [2020-10-16 12:07:13,731 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:13 WrapperNode [2020-10-16 12:07:13,731 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-10-16 12:07:13,732 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-10-16 12:07:13,732 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-10-16 12:07:13,733 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-10-16 12:07:13,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:13" (1/1) ... [2020-10-16 12:07:13,763 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:13" (1/1) ... [2020-10-16 12:07:13,804 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-10-16 12:07:13,804 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-10-16 12:07:13,804 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-10-16 12:07:13,805 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-10-16 12:07:13,820 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:13" (1/1) ... [2020-10-16 12:07:13,821 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:13" (1/1) ... [2020-10-16 12:07:13,826 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:13" (1/1) ... [2020-10-16 12:07:13,826 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:13" (1/1) ... [2020-10-16 12:07:13,837 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:13" (1/1) ... [2020-10-16 12:07:13,842 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:13" (1/1) ... [2020-10-16 12:07:13,846 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:13" (1/1) ... [2020-10-16 12:07:13,852 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-10-16 12:07:13,853 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-10-16 12:07:13,853 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-10-16 12:07:13,853 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-10-16 12:07:13,854 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:13" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/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 [2020-10-16 12:07:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-10-16 12:07:13,931 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2020-10-16 12:07:13,932 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-10-16 12:07:13,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-10-16 12:07:13,932 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2020-10-16 12:07:13,932 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2020-10-16 12:07:13,932 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2020-10-16 12:07:13,932 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2020-10-16 12:07:13,933 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2020-10-16 12:07:13,933 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2020-10-16 12:07:13,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2020-10-16 12:07:13,933 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-10-16 12:07:13,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-10-16 12:07:13,935 WARN L208 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2020-10-16 12:07:16,207 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-10-16 12:07:16,207 INFO L298 CfgBuilder]: Removed 10 assume(true) statements. [2020-10-16 12:07:16,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:07:16 BoogieIcfgContainer [2020-10-16 12:07:16,210 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-10-16 12:07:16,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-10-16 12:07:16,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-10-16 12:07:16,215 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-10-16 12:07:16,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.10 12:07:12" (1/3) ... [2020-10-16 12:07:16,216 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e108513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:07:16, skipping insertion in model container [2020-10-16 12:07:16,216 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.10 12:07:13" (2/3) ... [2020-10-16 12:07:16,217 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@e108513 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.10 12:07:16, skipping insertion in model container [2020-10-16 12:07:16,217 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.10 12:07:16" (3/3) ... [2020-10-16 12:07:16,219 INFO L111 eAbstractionObserver]: Analyzing ICFG safe001_rmo.opt.i [2020-10-16 12:07:16,231 WARN L153 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2020-10-16 12:07:16,231 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-10-16 12:07:16,239 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2020-10-16 12:07:16,240 INFO L348 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2020-10-16 12:07:16,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,269 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,269 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,270 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,270 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,271 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,272 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,273 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,273 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,274 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,274 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,274 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,274 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,275 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,276 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,277 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,278 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,278 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,278 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,279 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,280 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,280 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,284 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,285 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,285 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,286 WARN L313 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,286 WARN L313 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,293 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite2| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,294 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,295 WARN L313 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,295 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,296 WARN L313 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,302 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,304 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,305 WARN L313 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,305 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,306 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,307 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,309 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,310 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,311 WARN L313 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2020-10-16 12:07:16,314 INFO L149 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2020-10-16 12:07:16,329 INFO L253 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2020-10-16 12:07:16,351 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-10-16 12:07:16,351 INFO L378 AbstractCegarLoop]: Hoare is true [2020-10-16 12:07:16,351 INFO L379 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-10-16 12:07:16,351 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-10-16 12:07:16,351 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-10-16 12:07:16,351 INFO L382 AbstractCegarLoop]: Difference is false [2020-10-16 12:07:16,352 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-10-16 12:07:16,352 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-10-16 12:07:16,366 INFO L137 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2020-10-16 12:07:16,367 INFO L144 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-16 12:07:16,369 INFO L111 LiptonReduction]: Starting Lipton reduction on Petri net that has 100 places, 92 transitions, 199 flow [2020-10-16 12:07:16,371 INFO L71 FinitePrefix]: Start finitePrefix. Operand has 100 places, 92 transitions, 199 flow [2020-10-16 12:07:16,417 INFO L129 PetriNetUnfolder]: 2/89 cut-off events. [2020-10-16 12:07:16,418 INFO L130 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2020-10-16 12:07:16,423 INFO L80 FinitePrefix]: Finished finitePrefix Result has 99 conditions, 89 events. 2/89 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 66 event pairs, 0 based on Foata normal form. 0/85 useless extension candidates. Maximal degree in co-relation 60. Up to 2 conditions per place. [2020-10-16 12:07:16,426 INFO L117 LiptonReduction]: Number of co-enabled transitions 1642 [2020-10-16 12:07:17,942 WARN L193 SmtUtils]: Spent 1.28 s on a formula simplification. DAG size of input: 228 DAG size of output: 188 [2020-10-16 12:07:17,983 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 2, 2, 1] term [2020-10-16 12:07:17,983 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:07:17,985 INFO L375 QuantifierPusher]: Applying distributivity to a CONJUNCTION[3, 2, 5, 4, 1] term [2020-10-16 12:07:17,986 INFO L603 QuantifierPusher]: Distributing 2 conjuncts over 3 disjuncts [2020-10-16 12:07:19,190 WARN L193 SmtUtils]: Spent 1.17 s on a formula simplification. DAG size of input: 145 DAG size of output: 124 [2020-10-16 12:07:20,140 WARN L193 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 60 [2020-10-16 12:07:20,731 WARN L193 SmtUtils]: Spent 343.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-16 12:07:21,120 WARN L193 SmtUtils]: Spent 385.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2020-10-16 12:07:22,001 WARN L193 SmtUtils]: Spent 878.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 110 [2020-10-16 12:07:22,315 WARN L193 SmtUtils]: Spent 310.00 ms on a formula simplification that was a NOOP. DAG size: 107 [2020-10-16 12:07:23,572 WARN L193 SmtUtils]: Spent 999.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 130 [2020-10-16 12:07:23,861 WARN L193 SmtUtils]: Spent 282.00 ms on a formula simplification that was a NOOP. DAG size: 127 [2020-10-16 12:07:24,299 WARN L193 SmtUtils]: Spent 321.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-16 12:07:24,652 WARN L193 SmtUtils]: Spent 350.00 ms on a formula simplification that was a NOOP. DAG size: 129 [2020-10-16 12:07:24,872 WARN L193 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2020-10-16 12:07:24,980 WARN L193 SmtUtils]: Spent 104.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2020-10-16 12:07:25,005 INFO L132 LiptonReduction]: Checked pairs total: 4586 [2020-10-16 12:07:25,005 INFO L134 LiptonReduction]: Total number of compositions: 77 [2020-10-16 12:07:25,011 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 36 places, 26 transitions, 67 flow [2020-10-16 12:07:25,075 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 822 states. [2020-10-16 12:07:25,077 INFO L276 IsEmpty]: Start isEmpty. Operand 822 states. [2020-10-16 12:07:25,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2020-10-16 12:07:25,084 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:25,085 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2020-10-16 12:07:25,085 INFO L429 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:25,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:25,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1000627320, now seen corresponding path program 1 times [2020-10-16 12:07:25,102 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:25,103 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530986950] [2020-10-16 12:07:25,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:25,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:25,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:25,336 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530986950] [2020-10-16 12:07:25,337 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:25,337 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:07:25,338 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984985609] [2020-10-16 12:07:25,343 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:07:25,343 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:25,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:07:25,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:07:25,361 INFO L87 Difference]: Start difference. First operand 822 states. Second operand 3 states. [2020-10-16 12:07:25,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:25,476 INFO L93 Difference]: Finished difference Result 687 states and 2150 transitions. [2020-10-16 12:07:25,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:07:25,479 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2020-10-16 12:07:25,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:25,504 INFO L225 Difference]: With dead ends: 687 [2020-10-16 12:07:25,504 INFO L226 Difference]: Without dead ends: 562 [2020-10-16 12:07:25,506 INFO L677 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 [2020-10-16 12:07:25,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 562 states. [2020-10-16 12:07:25,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 562 to 562. [2020-10-16 12:07:25,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 562 states. [2020-10-16 12:07:25,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 562 states to 562 states and 1725 transitions. [2020-10-16 12:07:25,605 INFO L78 Accepts]: Start accepts. Automaton has 562 states and 1725 transitions. Word has length 5 [2020-10-16 12:07:25,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:25,606 INFO L481 AbstractCegarLoop]: Abstraction has 562 states and 1725 transitions. [2020-10-16 12:07:25,606 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:07:25,606 INFO L276 IsEmpty]: Start isEmpty. Operand 562 states and 1725 transitions. [2020-10-16 12:07:25,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2020-10-16 12:07:25,608 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:25,608 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:25,608 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-10-16 12:07:25,609 INFO L429 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:25,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:25,609 INFO L82 PathProgramCache]: Analyzing trace with hash -486051602, now seen corresponding path program 1 times [2020-10-16 12:07:25,609 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:25,610 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579862746] [2020-10-16 12:07:25,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:25,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:25,778 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:25,779 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579862746] [2020-10-16 12:07:25,779 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:25,779 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:07:25,780 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562150591] [2020-10-16 12:07:25,782 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:07:25,782 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:25,783 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:07:25,785 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:07:25,785 INFO L87 Difference]: Start difference. First operand 562 states and 1725 transitions. Second operand 3 states. [2020-10-16 12:07:25,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:25,855 INFO L93 Difference]: Finished difference Result 552 states and 1687 transitions. [2020-10-16 12:07:25,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:07:25,859 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2020-10-16 12:07:25,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:25,864 INFO L225 Difference]: With dead ends: 552 [2020-10-16 12:07:25,865 INFO L226 Difference]: Without dead ends: 552 [2020-10-16 12:07:25,866 INFO L677 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 [2020-10-16 12:07:25,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 552 states. [2020-10-16 12:07:25,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 552 to 552. [2020-10-16 12:07:25,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 552 states. [2020-10-16 12:07:25,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 1687 transitions. [2020-10-16 12:07:25,892 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 1687 transitions. Word has length 9 [2020-10-16 12:07:25,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:25,893 INFO L481 AbstractCegarLoop]: Abstraction has 552 states and 1687 transitions. [2020-10-16 12:07:25,893 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:07:25,893 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 1687 transitions. [2020-10-16 12:07:25,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-10-16 12:07:25,895 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:25,895 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:25,896 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-10-16 12:07:25,896 INFO L429 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:25,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:25,896 INFO L82 PathProgramCache]: Analyzing trace with hash 2146239772, now seen corresponding path program 1 times [2020-10-16 12:07:25,896 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:25,897 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1663930347] [2020-10-16 12:07:25,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:25,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:26,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:26,007 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1663930347] [2020-10-16 12:07:26,007 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:26,007 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2020-10-16 12:07:26,007 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221379163] [2020-10-16 12:07:26,008 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-10-16 12:07:26,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:26,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-10-16 12:07:26,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-10-16 12:07:26,009 INFO L87 Difference]: Start difference. First operand 552 states and 1687 transitions. Second operand 3 states. [2020-10-16 12:07:26,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:26,038 INFO L93 Difference]: Finished difference Result 542 states and 1649 transitions. [2020-10-16 12:07:26,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-10-16 12:07:26,039 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2020-10-16 12:07:26,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:26,045 INFO L225 Difference]: With dead ends: 542 [2020-10-16 12:07:26,045 INFO L226 Difference]: Without dead ends: 542 [2020-10-16 12:07:26,045 INFO L677 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 [2020-10-16 12:07:26,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2020-10-16 12:07:26,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2020-10-16 12:07:26,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 542 states. [2020-10-16 12:07:26,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 1649 transitions. [2020-10-16 12:07:26,063 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 1649 transitions. Word has length 10 [2020-10-16 12:07:26,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:26,064 INFO L481 AbstractCegarLoop]: Abstraction has 542 states and 1649 transitions. [2020-10-16 12:07:26,064 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-10-16 12:07:26,064 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 1649 transitions. [2020-10-16 12:07:26,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2020-10-16 12:07:26,066 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:26,066 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:26,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-10-16 12:07:26,067 INFO L429 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:26,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:26,067 INFO L82 PathProgramCache]: Analyzing trace with hash 2094870650, now seen corresponding path program 1 times [2020-10-16 12:07:26,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:26,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [749404252] [2020-10-16 12:07:26,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:26,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:26,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:26,151 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [749404252] [2020-10-16 12:07:26,151 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:26,151 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:07:26,151 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1372983231] [2020-10-16 12:07:26,152 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:07:26,152 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:26,152 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:07:26,152 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:07:26,153 INFO L87 Difference]: Start difference. First operand 542 states and 1649 transitions. Second operand 4 states. [2020-10-16 12:07:26,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:26,244 INFO L93 Difference]: Finished difference Result 521 states and 1575 transitions. [2020-10-16 12:07:26,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:07:26,245 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2020-10-16 12:07:26,245 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:26,249 INFO L225 Difference]: With dead ends: 521 [2020-10-16 12:07:26,250 INFO L226 Difference]: Without dead ends: 521 [2020-10-16 12:07:26,250 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:07:26,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-10-16 12:07:26,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 521. [2020-10-16 12:07:26,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 521 states. [2020-10-16 12:07:26,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 1575 transitions. [2020-10-16 12:07:26,267 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 1575 transitions. Word has length 11 [2020-10-16 12:07:26,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:26,268 INFO L481 AbstractCegarLoop]: Abstraction has 521 states and 1575 transitions. [2020-10-16 12:07:26,268 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:07:26,268 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 1575 transitions. [2020-10-16 12:07:26,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:07:26,269 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:26,269 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:26,270 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-10-16 12:07:26,270 INFO L429 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:26,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:26,270 INFO L82 PathProgramCache]: Analyzing trace with hash 1669512842, now seen corresponding path program 1 times [2020-10-16 12:07:26,270 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:26,271 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824095183] [2020-10-16 12:07:26,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07: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. [2020-10-16 12:07:26,329 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824095183] [2020-10-16 12:07:26,330 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:26,330 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:07:26,330 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679551978] [2020-10-16 12:07:26,330 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:07:26,331 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:26,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:07:26,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:07:26,331 INFO L87 Difference]: Start difference. First operand 521 states and 1575 transitions. Second operand 5 states. [2020-10-16 12:07:26,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:26,428 INFO L93 Difference]: Finished difference Result 668 states and 1946 transitions. [2020-10-16 12:07:26,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:07:26,429 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 12 [2020-10-16 12:07:26,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:26,433 INFO L225 Difference]: With dead ends: 668 [2020-10-16 12:07:26,433 INFO L226 Difference]: Without dead ends: 533 [2020-10-16 12:07:26,433 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:07:26,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-10-16 12:07:26,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 497. [2020-10-16 12:07:26,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 497 states. [2020-10-16 12:07:26,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 1448 transitions. [2020-10-16 12:07:26,449 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 1448 transitions. Word has length 12 [2020-10-16 12:07:26,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:26,450 INFO L481 AbstractCegarLoop]: Abstraction has 497 states and 1448 transitions. [2020-10-16 12:07:26,450 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:07:26,450 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 1448 transitions. [2020-10-16 12:07:26,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:07:26,451 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:26,451 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:26,452 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-10-16 12:07:26,452 INFO L429 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:26,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:26,452 INFO L82 PathProgramCache]: Analyzing trace with hash 630486214, now seen corresponding path program 1 times [2020-10-16 12:07:26,453 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:26,453 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480718324] [2020-10-16 12:07:26,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:26,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:26,509 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:26,510 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480718324] [2020-10-16 12:07:26,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:26,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:07:26,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395162336] [2020-10-16 12:07:26,511 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:07:26,511 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:26,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:07:26,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:07:26,512 INFO L87 Difference]: Start difference. First operand 497 states and 1448 transitions. Second operand 4 states. [2020-10-16 12:07:26,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:26,588 INFO L93 Difference]: Finished difference Result 533 states and 1559 transitions. [2020-10-16 12:07:26,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:07:26,589 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-16 12:07:26,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:26,593 INFO L225 Difference]: With dead ends: 533 [2020-10-16 12:07:26,593 INFO L226 Difference]: Without dead ends: 533 [2020-10-16 12:07:26,594 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:07:26,596 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 533 states. [2020-10-16 12:07:26,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 533 to 533. [2020-10-16 12:07:26,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 533 states. [2020-10-16 12:07:26,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 1559 transitions. [2020-10-16 12:07:26,657 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 1559 transitions. Word has length 12 [2020-10-16 12:07:26,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:26,657 INFO L481 AbstractCegarLoop]: Abstraction has 533 states and 1559 transitions. [2020-10-16 12:07:26,657 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:07:26,657 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 1559 transitions. [2020-10-16 12:07:26,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2020-10-16 12:07:26,658 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:26,658 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:26,659 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-10-16 12:07:26,659 INFO L429 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:26,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:26,659 INFO L82 PathProgramCache]: Analyzing trace with hash -1628574476, now seen corresponding path program 2 times [2020-10-16 12:07:26,660 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:26,661 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694639505] [2020-10-16 12:07:26,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:26,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:26,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:26,758 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694639505] [2020-10-16 12:07:26,759 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:26,759 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:07:26,759 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073697096] [2020-10-16 12:07:26,759 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:07:26,760 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:26,760 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:07:26,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:07:26,760 INFO L87 Difference]: Start difference. First operand 533 states and 1559 transitions. Second operand 4 states. [2020-10-16 12:07:26,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:26,836 INFO L93 Difference]: Finished difference Result 521 states and 1518 transitions. [2020-10-16 12:07:26,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:07:26,837 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2020-10-16 12:07:26,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:26,841 INFO L225 Difference]: With dead ends: 521 [2020-10-16 12:07:26,841 INFO L226 Difference]: Without dead ends: 521 [2020-10-16 12:07:26,842 INFO L677 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 [2020-10-16 12:07:26,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 521 states. [2020-10-16 12:07:26,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 521 to 485. [2020-10-16 12:07:26,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 485 states. [2020-10-16 12:07:26,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 485 states to 485 states and 1407 transitions. [2020-10-16 12:07:26,856 INFO L78 Accepts]: Start accepts. Automaton has 485 states and 1407 transitions. Word has length 12 [2020-10-16 12:07:26,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:26,857 INFO L481 AbstractCegarLoop]: Abstraction has 485 states and 1407 transitions. [2020-10-16 12:07:26,857 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:07:26,857 INFO L276 IsEmpty]: Start isEmpty. Operand 485 states and 1407 transitions. [2020-10-16 12:07:26,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:07:26,858 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:26,858 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:26,858 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-10-16 12:07:26,858 INFO L429 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:26,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:26,859 INFO L82 PathProgramCache]: Analyzing trace with hash 650926932, now seen corresponding path program 1 times [2020-10-16 12:07:26,859 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:26,859 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [387876574] [2020-10-16 12:07:26,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:26,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:26,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:26,901 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [387876574] [2020-10-16 12:07:26,901 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:26,901 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:07:26,902 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [95746773] [2020-10-16 12:07:26,902 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:07:26,902 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:26,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:07:26,903 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:07:26,903 INFO L87 Difference]: Start difference. First operand 485 states and 1407 transitions. Second operand 4 states. [2020-10-16 12:07:26,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:26,932 INFO L93 Difference]: Finished difference Result 761 states and 2170 transitions. [2020-10-16 12:07:26,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:07:26,933 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-16 12:07:26,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:26,936 INFO L225 Difference]: With dead ends: 761 [2020-10-16 12:07:26,936 INFO L226 Difference]: Without dead ends: 413 [2020-10-16 12:07:26,936 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:07:26,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2020-10-16 12:07:26,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2020-10-16 12:07:26,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 413 states. [2020-10-16 12:07:26,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 1167 transitions. [2020-10-16 12:07:26,949 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 1167 transitions. Word has length 13 [2020-10-16 12:07:26,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:26,949 INFO L481 AbstractCegarLoop]: Abstraction has 413 states and 1167 transitions. [2020-10-16 12:07:26,949 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:07:26,949 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 1167 transitions. [2020-10-16 12:07:26,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-10-16 12:07:26,950 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:26,950 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:26,950 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-10-16 12:07:26,951 INFO L429 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:26,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:26,951 INFO L82 PathProgramCache]: Analyzing trace with hash -549142010, now seen corresponding path program 2 times [2020-10-16 12:07:26,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:26,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853982521] [2020-10-16 12:07:26,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:26,991 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:26,992 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853982521] [2020-10-16 12:07:26,992 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:26,992 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-10-16 12:07:26,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988032674] [2020-10-16 12:07:26,993 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:07:26,993 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:26,993 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:07:26,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:07:26,994 INFO L87 Difference]: Start difference. First operand 413 states and 1167 transitions. Second operand 4 states. [2020-10-16 12:07:27,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:27,019 INFO L93 Difference]: Finished difference Result 581 states and 1645 transitions. [2020-10-16 12:07:27,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:07:27,020 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2020-10-16 12:07:27,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:27,022 INFO L225 Difference]: With dead ends: 581 [2020-10-16 12:07:27,022 INFO L226 Difference]: Without dead ends: 305 [2020-10-16 12:07:27,023 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:07:27,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2020-10-16 12:07:27,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 305. [2020-10-16 12:07:27,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 305 states. [2020-10-16 12:07:27,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 867 transitions. [2020-10-16 12:07:27,032 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 867 transitions. Word has length 13 [2020-10-16 12:07:27,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:27,033 INFO L481 AbstractCegarLoop]: Abstraction has 305 states and 867 transitions. [2020-10-16 12:07:27,033 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:07:27,033 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 867 transitions. [2020-10-16 12:07:27,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:07:27,034 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:27,034 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:27,034 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-10-16 12:07:27,034 INFO L429 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:27,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:27,035 INFO L82 PathProgramCache]: Analyzing trace with hash -152913222, now seen corresponding path program 1 times [2020-10-16 12:07:27,035 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:27,035 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768859750] [2020-10-16 12:07:27,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:27,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:27,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:27,107 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768859750] [2020-10-16 12:07:27,107 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:27,107 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:07:27,108 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1546960784] [2020-10-16 12:07:27,108 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:07:27,108 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:27,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:07:27,109 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:07:27,109 INFO L87 Difference]: Start difference. First operand 305 states and 867 transitions. Second operand 6 states. [2020-10-16 12:07:27,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:27,227 INFO L93 Difference]: Finished difference Result 413 states and 1164 transitions. [2020-10-16 12:07:27,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:07:27,231 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 14 [2020-10-16 12:07:27,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:27,232 INFO L225 Difference]: With dead ends: 413 [2020-10-16 12:07:27,233 INFO L226 Difference]: Without dead ends: 209 [2020-10-16 12:07:27,233 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2020-10-16 12:07:27,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2020-10-16 12:07:27,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 209. [2020-10-16 12:07:27,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 209 states. [2020-10-16 12:07:27,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 209 states to 209 states and 563 transitions. [2020-10-16 12:07:27,239 INFO L78 Accepts]: Start accepts. Automaton has 209 states and 563 transitions. Word has length 14 [2020-10-16 12:07:27,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:27,240 INFO L481 AbstractCegarLoop]: Abstraction has 209 states and 563 transitions. [2020-10-16 12:07:27,240 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:07:27,240 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 563 transitions. [2020-10-16 12:07:27,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2020-10-16 12:07:27,241 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:27,241 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:27,241 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-10-16 12:07:27,241 INFO L429 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:27,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:27,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1878298136, now seen corresponding path program 2 times [2020-10-16 12:07:27,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:27,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450495095] [2020-10-16 12:07:27,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:27,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:27,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:27,350 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450495095] [2020-10-16 12:07:27,351 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:27,351 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:07:27,351 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807923789] [2020-10-16 12:07:27,351 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:07:27,351 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:27,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:07:27,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:07:27,352 INFO L87 Difference]: Start difference. First operand 209 states and 563 transitions. Second operand 5 states. [2020-10-16 12:07:27,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:27,433 INFO L93 Difference]: Finished difference Result 208 states and 559 transitions. [2020-10-16 12:07:27,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-10-16 12:07:27,434 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2020-10-16 12:07:27,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:27,436 INFO L225 Difference]: With dead ends: 208 [2020-10-16 12:07:27,436 INFO L226 Difference]: Without dead ends: 208 [2020-10-16 12:07:27,437 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:07:27,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-10-16 12:07:27,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2020-10-16 12:07:27,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2020-10-16 12:07:27,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 559 transitions. [2020-10-16 12:07:27,443 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 559 transitions. Word has length 14 [2020-10-16 12:07:27,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:27,444 INFO L481 AbstractCegarLoop]: Abstraction has 208 states and 559 transitions. [2020-10-16 12:07:27,444 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:07:27,444 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 559 transitions. [2020-10-16 12:07:27,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2020-10-16 12:07:27,445 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:27,445 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:27,445 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-10-16 12:07:27,445 INFO L429 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:27,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:27,446 INFO L82 PathProgramCache]: Analyzing trace with hash 1610345253, now seen corresponding path program 1 times [2020-10-16 12:07:27,446 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:27,446 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636535657] [2020-10-16 12:07:27,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:27,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:27,511 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:27,512 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636535657] [2020-10-16 12:07:27,512 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:27,512 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-10-16 12:07:27,512 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530959989] [2020-10-16 12:07:27,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-10-16 12:07:27,513 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:27,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-10-16 12:07:27,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-10-16 12:07:27,513 INFO L87 Difference]: Start difference. First operand 208 states and 559 transitions. Second operand 4 states. [2020-10-16 12:07:27,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:27,550 INFO L93 Difference]: Finished difference Result 206 states and 485 transitions. [2020-10-16 12:07:27,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-10-16 12:07:27,551 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2020-10-16 12:07:27,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:27,552 INFO L225 Difference]: With dead ends: 206 [2020-10-16 12:07:27,552 INFO L226 Difference]: Without dead ends: 153 [2020-10-16 12:07:27,553 INFO L677 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 [2020-10-16 12:07:27,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2020-10-16 12:07:27,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2020-10-16 12:07:27,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 153 states. [2020-10-16 12:07:27,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 355 transitions. [2020-10-16 12:07:27,559 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 355 transitions. Word has length 15 [2020-10-16 12:07:27,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:27,559 INFO L481 AbstractCegarLoop]: Abstraction has 153 states and 355 transitions. [2020-10-16 12:07:27,559 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-10-16 12:07:27,560 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 355 transitions. [2020-10-16 12:07:27,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2020-10-16 12:07:27,560 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:27,560 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:27,560 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-10-16 12:07:27,561 INFO L429 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:27,561 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:27,561 INFO L82 PathProgramCache]: Analyzing trace with hash 2130702573, now seen corresponding path program 1 times [2020-10-16 12:07:27,561 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:27,564 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608525614] [2020-10-16 12:07:27,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:27,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:27,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:27,688 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608525614] [2020-10-16 12:07:27,688 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:27,688 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-10-16 12:07:27,688 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [236051460] [2020-10-16 12:07:27,689 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-10-16 12:07:27,689 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:27,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-10-16 12:07:27,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-10-16 12:07:27,689 INFO L87 Difference]: Start difference. First operand 153 states and 355 transitions. Second operand 5 states. [2020-10-16 12:07:27,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:27,732 INFO L93 Difference]: Finished difference Result 124 states and 251 transitions. [2020-10-16 12:07:27,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:07:27,735 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2020-10-16 12:07:27,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:27,735 INFO L225 Difference]: With dead ends: 124 [2020-10-16 12:07:27,735 INFO L226 Difference]: Without dead ends: 93 [2020-10-16 12:07:27,736 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:07:27,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2020-10-16 12:07:27,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2020-10-16 12:07:27,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93 states. [2020-10-16 12:07:27,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 179 transitions. [2020-10-16 12:07:27,739 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 179 transitions. Word has length 16 [2020-10-16 12:07:27,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:27,739 INFO L481 AbstractCegarLoop]: Abstraction has 93 states and 179 transitions. [2020-10-16 12:07:27,739 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-10-16 12:07:27,739 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 179 transitions. [2020-10-16 12:07:27,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-10-16 12:07:27,740 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:27,740 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:27,740 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-10-16 12:07:27,740 INFO L429 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:27,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:27,741 INFO L82 PathProgramCache]: Analyzing trace with hash -2010009971, now seen corresponding path program 1 times [2020-10-16 12:07:27,741 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:27,741 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [860246954] [2020-10-16 12:07:27,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:27,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:27,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:27,814 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [860246954] [2020-10-16 12:07:27,814 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:27,815 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:07:27,815 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [511920169] [2020-10-16 12:07:27,815 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-10-16 12:07:27,815 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:27,815 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-10-16 12:07:27,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-10-16 12:07:27,816 INFO L87 Difference]: Start difference. First operand 93 states and 179 transitions. Second operand 6 states. [2020-10-16 12:07:27,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:27,863 INFO L93 Difference]: Finished difference Result 79 states and 149 transitions. [2020-10-16 12:07:27,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-10-16 12:07:27,864 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 18 [2020-10-16 12:07:27,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:27,865 INFO L225 Difference]: With dead ends: 79 [2020-10-16 12:07:27,865 INFO L226 Difference]: Without dead ends: 70 [2020-10-16 12:07:27,865 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:07:27,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2020-10-16 12:07:27,867 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2020-10-16 12:07:27,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 70 states. [2020-10-16 12:07:27,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 133 transitions. [2020-10-16 12:07:27,868 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 133 transitions. Word has length 18 [2020-10-16 12:07:27,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:27,868 INFO L481 AbstractCegarLoop]: Abstraction has 70 states and 133 transitions. [2020-10-16 12:07:27,868 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-10-16 12:07:27,868 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 133 transitions. [2020-10-16 12:07:27,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:07:27,868 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:27,869 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:27,869 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-10-16 12:07:27,869 INFO L429 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:27,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:27,869 INFO L82 PathProgramCache]: Analyzing trace with hash 1937510697, now seen corresponding path program 1 times [2020-10-16 12:07:27,870 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:27,870 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [245433101] [2020-10-16 12:07:27,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:27,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-10-16 12:07:28,092 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-10-16 12:07:28,092 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [245433101] [2020-10-16 12:07:28,092 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-10-16 12:07:28,093 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-10-16 12:07:28,093 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908605489] [2020-10-16 12:07:28,093 INFO L461 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-10-16 12:07:28,093 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-10-16 12:07:28,093 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-10-16 12:07:28,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-10-16 12:07:28,094 INFO L87 Difference]: Start difference. First operand 70 states and 133 transitions. Second operand 7 states. [2020-10-16 12:07:28,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-10-16 12:07:28,262 INFO L93 Difference]: Finished difference Result 90 states and 168 transitions. [2020-10-16 12:07:28,263 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-10-16 12:07:28,263 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 21 [2020-10-16 12:07:28,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-10-16 12:07:28,264 INFO L225 Difference]: With dead ends: 90 [2020-10-16 12:07:28,264 INFO L226 Difference]: Without dead ends: 50 [2020-10-16 12:07:28,265 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2020-10-16 12:07:28,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2020-10-16 12:07:28,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2020-10-16 12:07:28,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 50 states. [2020-10-16 12:07:28,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 85 transitions. [2020-10-16 12:07:28,267 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 85 transitions. Word has length 21 [2020-10-16 12:07:28,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-10-16 12:07:28,267 INFO L481 AbstractCegarLoop]: Abstraction has 50 states and 85 transitions. [2020-10-16 12:07:28,267 INFO L482 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-10-16 12:07:28,267 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 85 transitions. [2020-10-16 12:07:28,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2020-10-16 12:07:28,268 INFO L414 BasicCegarLoop]: Found error trace [2020-10-16 12:07:28,268 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-10-16 12:07:28,268 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-10-16 12:07:28,268 INFO L429 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-10-16 12:07:28,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-10-16 12:07:28,269 INFO L82 PathProgramCache]: Analyzing trace with hash -1137754697, now seen corresponding path program 2 times [2020-10-16 12:07:28,269 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-10-16 12:07:28,269 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788140453] [2020-10-16 12:07:28,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-10-16 12:07:28,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:07:28,305 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:07:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-10-16 12:07:28,340 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-10-16 12:07:28,380 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-10-16 12:07:28,380 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-10-16 12:07:28,381 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-10-16 12:07:28,382 WARN L264 etLargeBlockEncoding]: Failed to translate choice composition: Branch encoders not available. [2020-10-16 12:07:28,394 WARN L124 codingBacktranslator]: Skipped backtranslation of ATE [1002] [1002] L2-->L823: Formula: (let ((.cse9 (= (mod ~x$w_buff1_used~0_In-142655690 256) 0)) (.cse8 (= (mod ~x$r_buff1_thd0~0_In-142655690 256) 0)) (.cse6 (= (mod ~x$r_buff0_thd0~0_In-142655690 256) 0)) (.cse7 (= (mod ~x$w_buff0_used~0_In-142655690 256) 0))) (let ((.cse0 (or .cse6 .cse7)) (.cse5 (or .cse9 .cse8)) (.cse3 (not .cse9)) (.cse4 (not .cse8)) (.cse1 (not .cse7)) (.cse2 (not .cse6))) (and (= ~x$r_buff1_thd0~0_Out-142655690 ~x$r_buff1_thd0~0_In-142655690) (= ~x$r_buff0_thd0~0_Out-142655690 ~x$r_buff0_thd0~0_In-142655690) (not (= ULTIMATE.start_assume_abort_if_not_~cond_Out-142655690 0)) (= ULTIMATE.start_assume_abort_if_not_~cond_Out-142655690 |ULTIMATE.start_assume_abort_if_not_#in~cond_In-142655690|) (or (and .cse0 (= ~x$w_buff0_used~0_In-142655690 ~x$w_buff0_used~0_Out-142655690)) (and .cse1 .cse2 (= ~x$w_buff0_used~0_Out-142655690 0))) (or (and .cse3 .cse4 (= ~x$w_buff1_used~0_Out-142655690 0)) (and (= ~x$w_buff1_used~0_In-142655690 ~x$w_buff1_used~0_Out-142655690) .cse5)) (or (and .cse0 (or (and (= ~x~0_In-142655690 ~x~0_Out-142655690) .cse5) (and .cse3 .cse4 (= ~x$w_buff1~0_In-142655690 ~x~0_Out-142655690)))) (and (= ~x$w_buff0~0_In-142655690 ~x~0_Out-142655690) .cse1 .cse2))))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-142655690, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-142655690, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-142655690|, ~x$w_buff1~0=~x$w_buff1~0_In-142655690, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-142655690, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-142655690, ~x~0=~x~0_In-142655690, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-142655690} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-142655690, ~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_Out-142655690, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-142655690|, ~x$w_buff1~0=~x$w_buff1~0_In-142655690, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-142655690|, ~x$w_buff1_used~0=~x$w_buff1_used~0_Out-142655690, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-142655690|, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-142655690|, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out-142655690|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_Out-142655690, ~x$w_buff0_used~0=~x$w_buff0_used~0_Out-142655690, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-142655690|, ULTIMATE.start_assume_abort_if_not_#in~cond=|ULTIMATE.start_assume_abort_if_not_#in~cond_In-142655690|, ULTIMATE.start_assume_abort_if_not_~cond=ULTIMATE.start_assume_abort_if_not_~cond_Out-142655690, ~x~0=~x~0_Out-142655690} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_assume_abort_if_not_~cond, ULTIMATE.start_main_#t~ite28, ULTIMATE.start_main_#t~ite24, ~x$w_buff1_used~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite27, ~x$r_buff1_thd0~0, ~x~0, ~x$w_buff0_used~0, ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2020-10-16 12:07:28,399 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,400 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,402 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,402 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,402 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,402 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,402 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,402 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,403 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,403 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,403 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,403 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,403 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,403 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,404 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,404 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,404 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,404 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,405 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,405 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,405 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,405 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,405 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,405 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,406 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,406 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,406 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,406 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,406 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,407 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,407 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,407 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,408 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,408 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,408 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,409 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,409 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,409 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,409 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,410 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,410 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,410 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,410 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,410 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,411 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,411 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,411 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,411 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,411 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,411 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,412 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,412 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,412 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,412 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,412 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,412 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,413 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,413 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,413 WARN L219 RCFGBacktranslator]: You are using large block encoding together with an algorithm for which the backtranslation into program statements is not yet implemented. [2020-10-16 12:07:28,413 ERROR L222 RCFGBacktranslator]: unable to determine which branch was taken, unable to determine the location [2020-10-16 12:07:28,515 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.10 12:07:28 BasicIcfg [2020-10-16 12:07:28,515 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-10-16 12:07:28,518 INFO L168 Benchmark]: Toolchain (without parser) took 15594.45 ms. Allocated memory was 141.0 MB in the beginning and 393.2 MB in the end (delta: 252.2 MB). Free memory was 101.4 MB in the beginning and 307.9 MB in the end (delta: -206.5 MB). Peak memory consumption was 45.7 MB. Max. memory is 7.1 GB. [2020-10-16 12:07:28,519 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 141.0 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 12:07:28,523 INFO L168 Benchmark]: CACSL2BoogieTranslator took 807.06 ms. Allocated memory was 141.0 MB in the beginning and 205.0 MB in the end (delta: 64.0 MB). Free memory was 101.1 MB in the beginning and 159.7 MB in the end (delta: -58.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2020-10-16 12:07:28,524 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.77 ms. Allocated memory is still 205.0 MB. Free memory was 159.7 MB in the beginning and 156.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. [2020-10-16 12:07:28,525 INFO L168 Benchmark]: Boogie Preprocessor took 48.06 ms. Allocated memory is still 205.0 MB. Free memory was 156.5 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2020-10-16 12:07:28,526 INFO L168 Benchmark]: RCFGBuilder took 2357.21 ms. Allocated memory was 205.0 MB in the beginning and 245.9 MB in the end (delta: 40.9 MB). Free memory was 153.8 MB in the beginning and 158.5 MB in the end (delta: -4.6 MB). Peak memory consumption was 98.8 MB. Max. memory is 7.1 GB. [2020-10-16 12:07:28,527 INFO L168 Benchmark]: TraceAbstraction took 12304.36 ms. Allocated memory was 245.9 MB in the beginning and 393.2 MB in the end (delta: 147.3 MB). Free memory was 158.5 MB in the beginning and 307.9 MB in the end (delta: -149.4 MB). There was no memory consumed. Max. memory is 7.1 GB. [2020-10-16 12:07:28,537 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 141.0 MB. Free memory was 121.3 MB in the beginning and 121.1 MB in the end (delta: 209.8 kB). There was no memory consumed. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 807.06 ms. Allocated memory was 141.0 MB in the beginning and 205.0 MB in the end (delta: 64.0 MB). Free memory was 101.1 MB in the beginning and 159.7 MB in the end (delta: -58.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 71.77 ms. Allocated memory is still 205.0 MB. Free memory was 159.7 MB in the beginning and 156.5 MB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 48.06 ms. Allocated memory is still 205.0 MB. Free memory was 156.5 MB in the beginning and 153.8 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2357.21 ms. Allocated memory was 205.0 MB in the beginning and 245.9 MB in the end (delta: 40.9 MB). Free memory was 153.8 MB in the beginning and 158.5 MB in the end (delta: -4.6 MB). Peak memory consumption was 98.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 12304.36 ms. Allocated memory was 245.9 MB in the beginning and 393.2 MB in the end (delta: 147.3 MB). Free memory was 158.5 MB in the beginning and 307.9 MB in the end (delta: -149.4 MB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks 822 VarBasedMoverChecksPositive, 34 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 64 CheckedPairsTotal, LiptonReductionStatistics: ReductionTime: 8.6s, 100 PlacesBefore, 36 PlacesAfterwards, 92 TransitionsBefore, 26 TransitionsAfterwards, 1642 CoEnabledTransitionPairs, 6 FixpointIterations, 31 TrivialSequentialCompositions, 38 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 77 TotalNumberOfCompositions, 4586 MoverChecksTotal - CounterExampleResult [Line: 7]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L698] 0 int __unbuffered_cnt = 0; [L700] 0 int __unbuffered_p0_EAX = 0; [L702] 0 int __unbuffered_p2_EAX = 0; [L703] 0 _Bool main$tmp_guard0; [L704] 0 _Bool main$tmp_guard1; [L706] 0 int x = 0; [L707] 0 _Bool x$flush_delayed; [L708] 0 int x$mem_tmp; [L709] 0 _Bool x$r_buff0_thd0; [L710] 0 _Bool x$r_buff0_thd1; [L711] 0 _Bool x$r_buff0_thd2; [L712] 0 _Bool x$r_buff0_thd3; [L713] 0 _Bool x$r_buff1_thd0; [L714] 0 _Bool x$r_buff1_thd1; [L715] 0 _Bool x$r_buff1_thd2; [L716] 0 _Bool x$r_buff1_thd3; [L717] 0 _Bool x$read_delayed; [L718] 0 int *x$read_delayed_var; [L719] 0 int x$w_buff0; [L720] 0 _Bool x$w_buff0_used; [L721] 0 int x$w_buff1; [L722] 0 _Bool x$w_buff1_used; [L724] 0 int y = 0; [L725] 0 _Bool weak$$choice0; [L726] 0 _Bool weak$$choice2; [L807] 0 pthread_t t1816; [L808] FCALL, FORK 0 pthread_create(&t1816, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L809] 0 pthread_t t1817; [L810] FCALL, FORK 0 pthread_create(&t1817, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L811] 0 pthread_t t1818; [L750] 2 x$w_buff1 = x$w_buff0 [L751] 2 x$w_buff0 = 2 [L752] 2 x$w_buff1_used = x$w_buff0_used [L753] 2 x$w_buff0_used = (_Bool)1 [L7] COND TRUE 2 !expression [L7] 2 __VERIFIER_error() [L755] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L756] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L757] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L758] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L759] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=0] [L762] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L812] FCALL, FORK 0 pthread_create(&t1818, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L779] 3 __unbuffered_p2_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L730] 1 __unbuffered_p0_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L765] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] EXPR 2 x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x [L765] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L765] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L766] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L766] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L767] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L767] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L768] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L768] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L769] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L769] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 [L785] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L785] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L786] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L786] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L787] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L787] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L788] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L788] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L789] EXPR 3 x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L789] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 [L792] 3 __unbuffered_cnt = __unbuffered_cnt + 1 [L794] 3 return 0; [L736] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L736] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L737] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L737] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L738] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L738] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L739] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L739] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L740] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L740] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 [L743] 1 __unbuffered_cnt = __unbuffered_cnt + 1 [L745] 1 return 0; [L772] 2 __unbuffered_cnt = __unbuffered_cnt + 1 [L774] 2 return 0; [L814] 0 main$tmp_guard0 = __unbuffered_cnt == 3 [L825] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 0 x$flush_delayed = weak$$choice2 [L828] 0 x$mem_tmp = x [L829] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L829] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1 [L829] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L829] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L830] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L830] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0) [L830] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L830] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L831] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L831] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1 [L831] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1) [L831] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L831] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L832] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L832] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L832] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L832] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used) [L832] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L832] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L833] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L834] EXPR 0 weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L834] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L835] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0) [L835] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L835] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L836] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p0_EAX == 2 && __unbuffered_p2_EAX == 1) [L837] EXPR 0 x$flush_delayed ? x$mem_tmp : x [L837] 0 x = x$flush_delayed ? x$mem_tmp : x [L838] 0 x$flush_delayed = (_Bool)0 [L7] COND TRUE 0 !expression [L7] 0 __VERIFIER_error() VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=2, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=1, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 91 locations, 2 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 12.0s, OverallIterations: 16, TraceHistogramMax: 1, AutomataDifference: 1.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.7s, HoareTripleCheckerStatistics: 289 SDtfs, 366 SDslu, 428 SDs, 0 SdLazy, 344 SolverSat, 63 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 57 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=822occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 72 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 216 NumberOfCodeBlocks, 216 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 180 ConstructedInterpolants, 0 QuantifiedInterpolants, 16337 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...