./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label51.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/eca-rers2012/Problem13_label51.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'c60e1c745de50239709fa60c913e491a1f371528f5baa59b32c10ff978467292'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label51.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c60e1c745de50239709fa60c913e491a1f371528f5baa59b32c10ff978467292 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:51:02,429 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:51:02,522 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 19:51:02,528 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:51:02,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:51:02,557 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:51:02,557 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:51:02,558 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:51:02,558 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:51:02,558 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:51:02,558 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:51:02,559 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:51:02,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:51:02,560 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:51:02,560 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:51:02,560 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:51:02,560 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:51:02,560 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:51:02,561 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:51:02,561 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:51:02,561 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:51:02,561 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:51:02,562 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:51:02,562 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:51:02,562 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:51:02,562 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:51:02,562 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:51:02,562 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:51:02,562 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:51:02,562 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:51:02,562 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:51:02,562 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:51:02,562 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:51:02,562 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:51:02,562 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:51:02,563 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:51:02,563 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:51:02,563 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:51:02,563 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:51:02,563 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:51:02,563 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:51:02,563 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:51:02,563 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c60e1c745de50239709fa60c913e491a1f371528f5baa59b32c10ff978467292 [2024-11-06 19:51:02,842 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:51:02,851 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:51:02,854 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:51:02,855 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:51:02,855 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:51:02,857 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label51.c [2024-11-06 19:51:04,165 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:51:04,772 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:51:04,774 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label51.c [2024-11-06 19:51:04,819 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/abc7b40a0/106b6c2ad5c444578ccd346a8c09606a/FLAGba608f1a6 [2024-11-06 19:51:04,840 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/abc7b40a0/106b6c2ad5c444578ccd346a8c09606a [2024-11-06 19:51:04,842 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:51:04,844 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:51:04,847 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:51:04,848 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:51:04,852 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:51:04,853 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:51:04" (1/1) ... [2024-11-06 19:51:04,855 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3534c2da and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:04, skipping insertion in model container [2024-11-06 19:51:04,856 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:51:04" (1/1) ... [2024-11-06 19:51:04,985 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:51:05,210 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label51.c[3668,3681] [2024-11-06 19:51:05,908 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:51:05,917 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:51:05,936 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label51.c[3668,3681] [2024-11-06 19:51:06,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:51:06,362 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:51:06,364 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:06 WrapperNode [2024-11-06 19:51:06,364 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:51:06,365 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:51:06,365 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:51:06,366 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:51:06,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:06" (1/1) ... [2024-11-06 19:51:06,437 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:06" (1/1) ... [2024-11-06 19:51:06,929 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-11-06 19:51:06,930 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:51:06,931 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:51:06,934 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:51:06,934 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:51:06,950 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:06" (1/1) ... [2024-11-06 19:51:06,954 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:06" (1/1) ... [2024-11-06 19:51:07,133 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:06" (1/1) ... [2024-11-06 19:51:07,402 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-06 19:51:07,403 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:06" (1/1) ... [2024-11-06 19:51:07,403 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:06" (1/1) ... [2024-11-06 19:51:07,555 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:06" (1/1) ... [2024-11-06 19:51:07,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:06" (1/1) ... [2024-11-06 19:51:07,649 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:06" (1/1) ... [2024-11-06 19:51:07,676 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:06" (1/1) ... [2024-11-06 19:51:07,803 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:51:07,805 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:51:07,805 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:51:07,806 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:51:07,807 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:06" (1/1) ... [2024-11-06 19:51:07,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:51:07,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:51:07,841 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 19:51:07,844 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 19:51:07,867 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:51:07,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:51:07,867 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:51:07,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:51:07,946 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:51:07,948 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:51:15,027 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-11-06 19:51:15,027 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:51:15,070 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:51:15,073 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:51:15,073 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:51:15 BoogieIcfgContainer [2024-11-06 19:51:15,073 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:51:15,076 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:51:15,076 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:51:15,080 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:51:15,080 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:51:04" (1/3) ... [2024-11-06 19:51:15,081 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ccfd0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:51:15, skipping insertion in model container [2024-11-06 19:51:15,081 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:51:06" (2/3) ... [2024-11-06 19:51:15,082 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ccfd0e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:51:15, skipping insertion in model container [2024-11-06 19:51:15,082 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:51:15" (3/3) ... [2024-11-06 19:51:15,083 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label51.c [2024-11-06 19:51:15,096 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:51:15,097 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:51:15,187 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:51:15,198 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@71dbe96b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:51:15,199 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:51:15,210 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:15,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-06 19:51:15,217 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:51:15,218 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:51:15,218 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:51:15,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:51:15,224 INFO L85 PathProgramCache]: Analyzing trace with hash -593706766, now seen corresponding path program 1 times [2024-11-06 19:51:15,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:51:15,231 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1003778325] [2024-11-06 19:51:15,231 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:15,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:51:15,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:15,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:51:15,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:51:15,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1003778325] [2024-11-06 19:51:15,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1003778325] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:51:15,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:51:15,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:51:15,490 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085652228] [2024-11-06 19:51:15,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:51:15,494 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:51:15,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:51:15,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:51:15,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:51:15,518 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:19,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:51:19,428 INFO L93 Difference]: Finished difference Result 3147 states and 5806 transitions. [2024-11-06 19:51:19,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:51:19,430 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2024-11-06 19:51:19,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:51:19,459 INFO L225 Difference]: With dead ends: 3147 [2024-11-06 19:51:19,459 INFO L226 Difference]: Without dead ends: 1964 [2024-11-06 19:51:19,467 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:51:19,471 INFO L432 NwaCegarLoop]: 764 mSDtfsCounter, 1155 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 2714 mSolverCounterSat, 584 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1155 SdHoareTripleChecker+Valid, 992 SdHoareTripleChecker+Invalid, 3298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 584 IncrementalHoareTripleChecker+Valid, 2714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:51:19,473 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1155 Valid, 992 Invalid, 3298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [584 Valid, 2714 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-06 19:51:19,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1964 states. [2024-11-06 19:51:19,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1964 to 1951. [2024-11-06 19:51:19,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1951 states, 1950 states have (on average 1.6538461538461537) internal successors, (3225), 1950 states have internal predecessors, (3225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:19,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1951 states to 1951 states and 3225 transitions. [2024-11-06 19:51:19,614 INFO L78 Accepts]: Start accepts. Automaton has 1951 states and 3225 transitions. Word has length 24 [2024-11-06 19:51:19,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:51:19,615 INFO L471 AbstractCegarLoop]: Abstraction has 1951 states and 3225 transitions. [2024-11-06 19:51:19,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 2 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:19,616 INFO L276 IsEmpty]: Start isEmpty. Operand 1951 states and 3225 transitions. [2024-11-06 19:51:19,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-11-06 19:51:19,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:51:19,618 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:51:19,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:51:19,619 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:51:19,621 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:51:19,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1083970155, now seen corresponding path program 1 times [2024-11-06 19:51:19,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:51:19,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1397707869] [2024-11-06 19:51:19,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:19,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:51:19,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:19,893 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:51:19,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:51:19,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1397707869] [2024-11-06 19:51:19,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1397707869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:51:19,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:51:19,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:51:19,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [800426511] [2024-11-06 19:51:19,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:51:19,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:51:19,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:51:19,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:51:19,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:51:19,898 INFO L87 Difference]: Start difference. First operand 1951 states and 3225 transitions. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:23,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:51:23,982 INFO L93 Difference]: Finished difference Result 5542 states and 9222 transitions. [2024-11-06 19:51:23,982 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:51:23,983 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 95 [2024-11-06 19:51:23,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:51:23,998 INFO L225 Difference]: With dead ends: 5542 [2024-11-06 19:51:23,998 INFO L226 Difference]: Without dead ends: 3593 [2024-11-06 19:51:24,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:51:24,005 INFO L432 NwaCegarLoop]: 872 mSDtfsCounter, 924 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2592 mSolverCounterSat, 749 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 3341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 749 IncrementalHoareTripleChecker+Valid, 2592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:51:24,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 1009 Invalid, 3341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [749 Valid, 2592 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2024-11-06 19:51:24,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3593 states. [2024-11-06 19:51:24,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3593 to 3581. [2024-11-06 19:51:24,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3581 states, 3580 states have (on average 1.5050279329608938) internal successors, (5388), 3580 states have internal predecessors, (5388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:24,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3581 states to 3581 states and 5388 transitions. [2024-11-06 19:51:24,089 INFO L78 Accepts]: Start accepts. Automaton has 3581 states and 5388 transitions. Word has length 95 [2024-11-06 19:51:24,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:51:24,090 INFO L471 AbstractCegarLoop]: Abstraction has 3581 states and 5388 transitions. [2024-11-06 19:51:24,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 2 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:24,091 INFO L276 IsEmpty]: Start isEmpty. Operand 3581 states and 5388 transitions. [2024-11-06 19:51:24,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2024-11-06 19:51:24,099 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:51:24,099 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:51:24,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:51:24,100 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:51:24,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:51:24,103 INFO L85 PathProgramCache]: Analyzing trace with hash 19544424, now seen corresponding path program 1 times [2024-11-06 19:51:24,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:51:24,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1399707383] [2024-11-06 19:51:24,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:24,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:51:24,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:24,283 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:51:24,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:51:24,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1399707383] [2024-11-06 19:51:24,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1399707383] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:51:24,285 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:51:24,285 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:51:24,285 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265570189] [2024-11-06 19:51:24,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:51:24,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:51:24,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:51:24,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:51:24,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:51:24,287 INFO L87 Difference]: Start difference. First operand 3581 states and 5388 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:27,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:51:27,358 INFO L93 Difference]: Finished difference Result 10352 states and 15625 transitions. [2024-11-06 19:51:27,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:51:27,358 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 109 [2024-11-06 19:51:27,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:51:27,383 INFO L225 Difference]: With dead ends: 10352 [2024-11-06 19:51:27,383 INFO L226 Difference]: Without dead ends: 6773 [2024-11-06 19:51:27,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:51:27,389 INFO L432 NwaCegarLoop]: 1021 mSDtfsCounter, 785 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 786 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1172 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 786 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:51:27,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1172 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [786 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-06 19:51:27,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6773 states. [2024-11-06 19:51:27,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6773 to 6749. [2024-11-06 19:51:27,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6749 states, 6748 states have (on average 1.3252815649081209) internal successors, (8943), 6748 states have internal predecessors, (8943), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:27,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6749 states to 6749 states and 8943 transitions. [2024-11-06 19:51:27,509 INFO L78 Accepts]: Start accepts. Automaton has 6749 states and 8943 transitions. Word has length 109 [2024-11-06 19:51:27,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:51:27,510 INFO L471 AbstractCegarLoop]: Abstraction has 6749 states and 8943 transitions. [2024-11-06 19:51:27,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:27,510 INFO L276 IsEmpty]: Start isEmpty. Operand 6749 states and 8943 transitions. [2024-11-06 19:51:27,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-06 19:51:27,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:51:27,511 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:51:27,512 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:51:27,512 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:51:27,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:51:27,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1515792606, now seen corresponding path program 1 times [2024-11-06 19:51:27,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:51:27,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806633859] [2024-11-06 19:51:27,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:27,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:51:27,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:27,733 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:51:27,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:51:27,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806633859] [2024-11-06 19:51:27,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806633859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:51:27,738 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:51:27,738 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:51:27,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874824594] [2024-11-06 19:51:27,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:51:27,739 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:51:27,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:51:27,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:51:27,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:51:27,739 INFO L87 Difference]: Start difference. First operand 6749 states and 8943 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:30,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:51:30,515 INFO L93 Difference]: Finished difference Result 19804 states and 26220 transitions. [2024-11-06 19:51:30,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:51:30,516 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2024-11-06 19:51:30,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:51:30,625 INFO L225 Difference]: With dead ends: 19804 [2024-11-06 19:51:30,625 INFO L226 Difference]: Without dead ends: 13057 [2024-11-06 19:51:30,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:51:30,632 INFO L432 NwaCegarLoop]: 883 mSDtfsCounter, 865 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 2330 mSolverCounterSat, 875 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 865 SdHoareTripleChecker+Valid, 1035 SdHoareTripleChecker+Invalid, 3205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 875 IncrementalHoareTripleChecker+Valid, 2330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:51:30,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [865 Valid, 1035 Invalid, 3205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [875 Valid, 2330 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-06 19:51:30,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13057 states. [2024-11-06 19:51:30,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13057 to 13052. [2024-11-06 19:51:30,881 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13052 states, 13051 states have (on average 1.217914336066202) internal successors, (15895), 13051 states have internal predecessors, (15895), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:30,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13052 states to 13052 states and 15895 transitions. [2024-11-06 19:51:30,918 INFO L78 Accepts]: Start accepts. Automaton has 13052 states and 15895 transitions. Word has length 138 [2024-11-06 19:51:30,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:51:30,919 INFO L471 AbstractCegarLoop]: Abstraction has 13052 states and 15895 transitions. [2024-11-06 19:51:30,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 2 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:30,919 INFO L276 IsEmpty]: Start isEmpty. Operand 13052 states and 15895 transitions. [2024-11-06 19:51:30,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-06 19:51:30,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:51:30,926 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:51:30,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:51:30,926 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:51:30,927 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:51:30,927 INFO L85 PathProgramCache]: Analyzing trace with hash 1481177967, now seen corresponding path program 1 times [2024-11-06 19:51:30,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:51:30,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669378213] [2024-11-06 19:51:30,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:30,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:51:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:31,524 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 109 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-06 19:51:31,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:51:31,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669378213] [2024-11-06 19:51:31,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669378213] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:51:31,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:51:31,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:51:31,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470346654] [2024-11-06 19:51:31,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:51:31,527 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:51:31,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:51:31,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:51:31,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:51:31,529 INFO L87 Difference]: Start difference. First operand 13052 states and 15895 transitions. Second operand has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:34,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:51:34,179 INFO L93 Difference]: Finished difference Result 26889 states and 32590 transitions. [2024-11-06 19:51:34,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:51:34,179 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 216 [2024-11-06 19:51:34,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:51:34,209 INFO L225 Difference]: With dead ends: 26889 [2024-11-06 19:51:34,210 INFO L226 Difference]: Without dead ends: 13839 [2024-11-06 19:51:34,220 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:51:34,221 INFO L432 NwaCegarLoop]: 1084 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2521 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 2530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:51:34,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1213 Invalid, 2530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2521 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 19:51:34,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13839 states. [2024-11-06 19:51:34,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13839 to 13839. [2024-11-06 19:51:34,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13839 states, 13838 states have (on average 1.2058823529411764) internal successors, (16687), 13838 states have internal predecessors, (16687), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:34,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13839 states to 13839 states and 16687 transitions. [2024-11-06 19:51:34,432 INFO L78 Accepts]: Start accepts. Automaton has 13839 states and 16687 transitions. Word has length 216 [2024-11-06 19:51:34,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:51:34,432 INFO L471 AbstractCegarLoop]: Abstraction has 13839 states and 16687 transitions. [2024-11-06 19:51:34,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 65.0) internal successors, (195), 2 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:34,433 INFO L276 IsEmpty]: Start isEmpty. Operand 13839 states and 16687 transitions. [2024-11-06 19:51:34,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2024-11-06 19:51:34,435 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:51:34,435 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:51:34,435 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:51:34,436 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:51:34,436 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:51:34,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1840123782, now seen corresponding path program 1 times [2024-11-06 19:51:34,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:51:34,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785433044] [2024-11-06 19:51:34,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:34,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:51:34,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:34,637 INFO L134 CoverageAnalysis]: Checked inductivity of 138 backedges. 138 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:51:34,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:51:34,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785433044] [2024-11-06 19:51:34,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785433044] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:51:34,638 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:51:34,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:51:34,638 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488465551] [2024-11-06 19:51:34,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:51:34,639 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:51:34,639 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:51:34,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:51:34,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:51:34,640 INFO L87 Difference]: Start difference. First operand 13839 states and 16687 transitions. Second operand has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:37,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:51:37,987 INFO L93 Difference]: Finished difference Result 33200 states and 41058 transitions. [2024-11-06 19:51:37,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:51:37,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 223 [2024-11-06 19:51:37,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:51:38,030 INFO L225 Difference]: With dead ends: 33200 [2024-11-06 19:51:38,030 INFO L226 Difference]: Without dead ends: 20150 [2024-11-06 19:51:38,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:51:38,047 INFO L432 NwaCegarLoop]: 823 mSDtfsCounter, 861 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 2388 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 861 SdHoareTripleChecker+Valid, 943 SdHoareTripleChecker+Invalid, 3306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 2388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:51:38,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [861 Valid, 943 Invalid, 3306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 2388 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-06 19:51:38,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20150 states. [2024-11-06 19:51:38,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20150 to 20140. [2024-11-06 19:51:38,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20140 states, 20139 states have (on average 1.1898803316947217) internal successors, (23963), 20139 states have internal predecessors, (23963), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:38,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20140 states to 20140 states and 23963 transitions. [2024-11-06 19:51:38,313 INFO L78 Accepts]: Start accepts. Automaton has 20140 states and 23963 transitions. Word has length 223 [2024-11-06 19:51:38,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:51:38,315 INFO L471 AbstractCegarLoop]: Abstraction has 20140 states and 23963 transitions. [2024-11-06 19:51:38,315 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.33333333333333) internal successors, (223), 3 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:38,316 INFO L276 IsEmpty]: Start isEmpty. Operand 20140 states and 23963 transitions. [2024-11-06 19:51:38,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2024-11-06 19:51:38,320 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:51:38,321 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:51:38,321 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:51:38,321 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:51:38,321 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:51:38,321 INFO L85 PathProgramCache]: Analyzing trace with hash -175401069, now seen corresponding path program 1 times [2024-11-06 19:51:38,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:51:38,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241466941] [2024-11-06 19:51:38,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:38,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:51:38,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:38,470 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:51:38,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:51:38,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241466941] [2024-11-06 19:51:38,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241466941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:51:38,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:51:38,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:51:38,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803865375] [2024-11-06 19:51:38,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:51:38,474 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:51:38,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:51:38,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:51:38,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:51:38,475 INFO L87 Difference]: Start difference. First operand 20140 states and 23963 transitions. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:41,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:51:41,762 INFO L93 Difference]: Finished difference Result 39361 states and 46953 transitions. [2024-11-06 19:51:41,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:51:41,762 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 238 [2024-11-06 19:51:41,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:51:41,803 INFO L225 Difference]: With dead ends: 39361 [2024-11-06 19:51:41,803 INFO L226 Difference]: Without dead ends: 20010 [2024-11-06 19:51:41,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:51:41,820 INFO L432 NwaCegarLoop]: 1505 mSDtfsCounter, 1037 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2350 mSolverCounterSat, 602 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1037 SdHoareTripleChecker+Valid, 1642 SdHoareTripleChecker+Invalid, 2952 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 602 IncrementalHoareTripleChecker+Valid, 2350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:51:41,820 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1037 Valid, 1642 Invalid, 2952 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [602 Valid, 2350 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-06 19:51:41,835 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20010 states. [2024-11-06 19:51:41,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20010 to 19220. [2024-11-06 19:51:42,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19220 states, 19219 states have (on average 1.1321608824600655) internal successors, (21759), 19219 states have internal predecessors, (21759), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:42,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19220 states to 19220 states and 21759 transitions. [2024-11-06 19:51:42,044 INFO L78 Accepts]: Start accepts. Automaton has 19220 states and 21759 transitions. Word has length 238 [2024-11-06 19:51:42,044 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:51:42,044 INFO L471 AbstractCegarLoop]: Abstraction has 19220 states and 21759 transitions. [2024-11-06 19:51:42,044 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:42,045 INFO L276 IsEmpty]: Start isEmpty. Operand 19220 states and 21759 transitions. [2024-11-06 19:51:42,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 313 [2024-11-06 19:51:42,049 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:51:42,050 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:51:42,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:51:42,050 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:51:42,050 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:51:42,050 INFO L85 PathProgramCache]: Analyzing trace with hash -523861264, now seen corresponding path program 1 times [2024-11-06 19:51:42,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:51:42,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774485873] [2024-11-06 19:51:42,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:42,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:51:42,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:42,278 INFO L134 CoverageAnalysis]: Checked inductivity of 337 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-06 19:51:42,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:51:42,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774485873] [2024-11-06 19:51:42,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774485873] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:51:42,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:51:42,278 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:51:42,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493274015] [2024-11-06 19:51:42,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:51:42,279 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:51:42,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:51:42,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:51:42,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:51:42,279 INFO L87 Difference]: Start difference. First operand 19220 states and 21759 transitions. Second operand has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:45,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:51:45,385 INFO L93 Difference]: Finished difference Result 43955 states and 50452 transitions. [2024-11-06 19:51:45,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:51:45,385 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 312 [2024-11-06 19:51:45,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:51:45,442 INFO L225 Difference]: With dead ends: 43955 [2024-11-06 19:51:45,442 INFO L226 Difference]: Without dead ends: 25524 [2024-11-06 19:51:45,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:51:45,462 INFO L432 NwaCegarLoop]: 1777 mSDtfsCounter, 844 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 2531 mSolverCounterSat, 721 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 1919 SdHoareTripleChecker+Invalid, 3252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 721 IncrementalHoareTripleChecker+Valid, 2531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:51:45,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 1919 Invalid, 3252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [721 Valid, 2531 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-06 19:51:45,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25524 states. [2024-11-06 19:51:45,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25524 to 24733. [2024-11-06 19:51:45,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24733 states, 24732 states have (on average 1.118591298722303) internal successors, (27665), 24732 states have internal predecessors, (27665), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:45,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24733 states to 24733 states and 27665 transitions. [2024-11-06 19:51:45,876 INFO L78 Accepts]: Start accepts. Automaton has 24733 states and 27665 transitions. Word has length 312 [2024-11-06 19:51:45,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:51:45,877 INFO L471 AbstractCegarLoop]: Abstraction has 24733 states and 27665 transitions. [2024-11-06 19:51:45,877 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.333333333333336) internal successors, (130), 3 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:45,877 INFO L276 IsEmpty]: Start isEmpty. Operand 24733 states and 27665 transitions. [2024-11-06 19:51:45,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2024-11-06 19:51:45,882 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:51:45,883 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:51:45,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:51:45,884 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:51:45,884 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:51:45,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1968174890, now seen corresponding path program 1 times [2024-11-06 19:51:45,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:51:45,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022407601] [2024-11-06 19:51:45,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:45,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:51:45,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:46,169 INFO L134 CoverageAnalysis]: Checked inductivity of 355 backedges. 333 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-06 19:51:46,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:51:46,170 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022407601] [2024-11-06 19:51:46,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022407601] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:51:46,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:51:46,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:51:46,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1246805201] [2024-11-06 19:51:46,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:51:46,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:51:46,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:51:46,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:51:46,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:51:46,173 INFO L87 Difference]: Start difference. First operand 24733 states and 27665 transitions. Second operand has 4 states, 4 states have (on average 75.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:52,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:51:52,280 INFO L93 Difference]: Finished difference Result 91374 states and 102286 transitions. [2024-11-06 19:51:52,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:51:52,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 321 [2024-11-06 19:51:52,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:51:52,385 INFO L225 Difference]: With dead ends: 91374 [2024-11-06 19:51:52,385 INFO L226 Difference]: Without dead ends: 67430 [2024-11-06 19:51:52,403 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:51:52,405 INFO L432 NwaCegarLoop]: 573 mSDtfsCounter, 1714 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 5999 mSolverCounterSat, 1098 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 764 SdHoareTripleChecker+Invalid, 7097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1098 IncrementalHoareTripleChecker+Valid, 5999 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:51:52,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1714 Valid, 764 Invalid, 7097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1098 Valid, 5999 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2024-11-06 19:51:52,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67430 states. [2024-11-06 19:51:52,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67430 to 64161. [2024-11-06 19:51:52,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64161 states, 64160 states have (on average 1.1056577306733166) internal successors, (70939), 64160 states have internal predecessors, (70939), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:52,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64161 states to 64161 states and 70939 transitions. [2024-11-06 19:51:52,998 INFO L78 Accepts]: Start accepts. Automaton has 64161 states and 70939 transitions. Word has length 321 [2024-11-06 19:51:52,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:51:52,998 INFO L471 AbstractCegarLoop]: Abstraction has 64161 states and 70939 transitions. [2024-11-06 19:51:52,999 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 75.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:52,999 INFO L276 IsEmpty]: Start isEmpty. Operand 64161 states and 70939 transitions. [2024-11-06 19:51:53,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 351 [2024-11-06 19:51:53,006 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:51:53,006 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:51:53,006 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 19:51:53,007 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:51:53,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:51:53,007 INFO L85 PathProgramCache]: Analyzing trace with hash -752409273, now seen corresponding path program 1 times [2024-11-06 19:51:53,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:51:53,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314320337] [2024-11-06 19:51:53,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:53,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:51:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:53,376 INFO L134 CoverageAnalysis]: Checked inductivity of 367 backedges. 250 proven. 0 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2024-11-06 19:51:53,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:51:53,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314320337] [2024-11-06 19:51:53,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1314320337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:51:53,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:51:53,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:51:53,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968313147] [2024-11-06 19:51:53,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:51:53,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:51:53,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:51:53,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:51:53,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:51:53,379 INFO L87 Difference]: Start difference. First operand 64161 states and 70939 transitions. Second operand has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:56,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:51:56,827 INFO L93 Difference]: Finished difference Result 140934 states and 155366 transitions. [2024-11-06 19:51:56,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:51:56,828 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 350 [2024-11-06 19:51:56,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:51:56,940 INFO L225 Difference]: With dead ends: 140934 [2024-11-06 19:51:56,940 INFO L226 Difference]: Without dead ends: 76775 [2024-11-06 19:51:56,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:51:56,986 INFO L432 NwaCegarLoop]: 1000 mSDtfsCounter, 728 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 2689 mSolverCounterSat, 180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1175 SdHoareTripleChecker+Invalid, 2869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 180 IncrementalHoareTripleChecker+Valid, 2689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:51:56,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1175 Invalid, 2869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [180 Valid, 2689 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-06 19:51:57,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76775 states. [2024-11-06 19:51:57,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76775 to 75190. [2024-11-06 19:51:57,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75190 states, 75189 states have (on average 1.0959847850084454) internal successors, (82406), 75189 states have internal predecessors, (82406), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:57,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75190 states to 75190 states and 82406 transitions. [2024-11-06 19:51:57,776 INFO L78 Accepts]: Start accepts. Automaton has 75190 states and 82406 transitions. Word has length 350 [2024-11-06 19:51:57,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:51:57,776 INFO L471 AbstractCegarLoop]: Abstraction has 75190 states and 82406 transitions. [2024-11-06 19:51:57,777 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.33333333333333) internal successors, (235), 2 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:51:57,777 INFO L276 IsEmpty]: Start isEmpty. Operand 75190 states and 82406 transitions. [2024-11-06 19:51:57,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 380 [2024-11-06 19:51:57,782 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:51:57,783 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:51:57,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:51:57,783 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:51:57,783 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:51:57,784 INFO L85 PathProgramCache]: Analyzing trace with hash -1408305103, now seen corresponding path program 1 times [2024-11-06 19:51:57,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:51:57,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754058990] [2024-11-06 19:51:57,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:57,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:51:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 266 proven. 113 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-06 19:51:59,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:51:59,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754058990] [2024-11-06 19:51:59,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1754058990] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:51:59,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [147439746] [2024-11-06 19:51:59,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:51:59,320 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:51:59,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:51:59,325 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:51:59,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 19:51:59,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:51:59,506 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:51:59,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:51:59,601 INFO L134 CoverageAnalysis]: Checked inductivity of 401 backedges. 65 proven. 0 refuted. 0 times theorem prover too weak. 336 trivial. 0 not checked. [2024-11-06 19:51:59,601 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:51:59,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [147439746] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:51:59,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:51:59,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-06 19:51:59,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665308760] [2024-11-06 19:51:59,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:51:59,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:51:59,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:51:59,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:51:59,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:51:59,603 INFO L87 Difference]: Start difference. First operand 75190 states and 82406 transitions. Second operand has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:52:02,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:52:02,635 INFO L93 Difference]: Finished difference Result 151934 states and 166950 transitions. [2024-11-06 19:52:02,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:52:02,636 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 379 [2024-11-06 19:52:02,637 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:52:02,757 INFO L225 Difference]: With dead ends: 151934 [2024-11-06 19:52:02,757 INFO L226 Difference]: Without dead ends: 88562 [2024-11-06 19:52:02,797 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 385 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:52:02,798 INFO L432 NwaCegarLoop]: 1739 mSDtfsCounter, 872 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 464 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1868 SdHoareTripleChecker+Invalid, 2855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 464 IncrementalHoareTripleChecker+Valid, 2391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:52:02,798 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1868 Invalid, 2855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [464 Valid, 2391 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 19:52:02,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88562 states. [2024-11-06 19:52:03,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88562 to 79901. [2024-11-06 19:52:03,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79901 states, 79900 states have (on average 1.0907259073842304) internal successors, (87149), 79900 states have internal predecessors, (87149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:52:03,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79901 states to 79901 states and 87149 transitions. [2024-11-06 19:52:03,845 INFO L78 Accepts]: Start accepts. Automaton has 79901 states and 87149 transitions. Word has length 379 [2024-11-06 19:52:03,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:52:03,846 INFO L471 AbstractCegarLoop]: Abstraction has 79901 states and 87149 transitions. [2024-11-06 19:52:03,847 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.0) internal successors, (156), 3 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:52:03,847 INFO L276 IsEmpty]: Start isEmpty. Operand 79901 states and 87149 transitions. [2024-11-06 19:52:03,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 455 [2024-11-06 19:52:03,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:52:03,859 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:52:03,878 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 19:52:04,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-06 19:52:04,064 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:52:04,064 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:52:04,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1885680466, now seen corresponding path program 1 times [2024-11-06 19:52:04,065 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:52:04,065 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192852544] [2024-11-06 19:52:04,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:52:04,065 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:52:04,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:52:05,840 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 281 proven. 113 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2024-11-06 19:52:05,840 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:52:05,840 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192852544] [2024-11-06 19:52:05,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192852544] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:52:05,841 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [213625546] [2024-11-06 19:52:05,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:52:05,841 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:52:05,841 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:52:05,843 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:52:05,846 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 19:52:06,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:52:06,033 INFO L255 TraceCheckSpWp]: Trace formula consists of 590 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:52:06,040 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:52:06,306 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 303 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-06 19:52:06,307 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:52:06,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [213625546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:52:06,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:52:06,307 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-06 19:52:06,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349437823] [2024-11-06 19:52:06,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:52:06,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:52:06,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:52:06,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:52:06,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:52:06,310 INFO L87 Difference]: Start difference. First operand 79901 states and 87149 transitions. Second operand has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:52:10,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:52:10,175 INFO L93 Difference]: Finished difference Result 158209 states and 174493 transitions. [2024-11-06 19:52:10,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:52:10,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 454 [2024-11-06 19:52:10,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:52:10,271 INFO L225 Difference]: With dead ends: 158209 [2024-11-06 19:52:10,271 INFO L226 Difference]: Without dead ends: 90126 [2024-11-06 19:52:10,288 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 460 GetRequests, 453 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:52:10,288 INFO L432 NwaCegarLoop]: 385 mSDtfsCounter, 1134 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 1172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1134 SdHoareTripleChecker+Valid, 400 SdHoareTripleChecker+Invalid, 3438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1172 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:52:10,288 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1134 Valid, 400 Invalid, 3438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1172 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-06 19:52:10,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90126 states. [2024-11-06 19:52:10,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90126 to 90126. [2024-11-06 19:52:10,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90126 states, 90125 states have (on average 1.094868238557559) internal successors, (98675), 90125 states have internal predecessors, (98675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:52:11,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90126 states to 90126 states and 98675 transitions. [2024-11-06 19:52:11,075 INFO L78 Accepts]: Start accepts. Automaton has 90126 states and 98675 transitions. Word has length 454 [2024-11-06 19:52:11,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:52:11,076 INFO L471 AbstractCegarLoop]: Abstraction has 90126 states and 98675 transitions. [2024-11-06 19:52:11,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.0) internal successors, (342), 3 states have internal predecessors, (342), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:52:11,076 INFO L276 IsEmpty]: Start isEmpty. Operand 90126 states and 98675 transitions. [2024-11-06 19:52:11,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 469 [2024-11-06 19:52:11,085 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:52:11,086 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:52:11,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 19:52:11,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:52:11,286 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:52:11,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:52:11,287 INFO L85 PathProgramCache]: Analyzing trace with hash -32966867, now seen corresponding path program 1 times [2024-11-06 19:52:11,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:52:11,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [10401459] [2024-11-06 19:52:11,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:52:11,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:52:11,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:52:11,693 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 416 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-11-06 19:52:11,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:52:11,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [10401459] [2024-11-06 19:52:11,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [10401459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:52:11,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:52:11,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:52:11,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799265583] [2024-11-06 19:52:11,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:52:11,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:52:11,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:52:11,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:52:11,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:52:11,696 INFO L87 Difference]: Start difference. First operand 90126 states and 98675 transitions. Second operand has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:52:15,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:52:15,121 INFO L93 Difference]: Finished difference Result 199926 states and 220123 transitions. [2024-11-06 19:52:15,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:52:15,122 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 468 [2024-11-06 19:52:15,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:52:15,286 INFO L225 Difference]: With dead ends: 199926 [2024-11-06 19:52:15,286 INFO L226 Difference]: Without dead ends: 110589 [2024-11-06 19:52:15,333 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:52:15,333 INFO L432 NwaCegarLoop]: 798 mSDtfsCounter, 799 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2421 mSolverCounterSat, 888 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 799 SdHoareTripleChecker+Valid, 880 SdHoareTripleChecker+Invalid, 3309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 888 IncrementalHoareTripleChecker+Valid, 2421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:52:15,333 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [799 Valid, 880 Invalid, 3309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [888 Valid, 2421 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-06 19:52:15,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110589 states. [2024-11-06 19:52:16,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110589 to 108212. [2024-11-06 19:52:16,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108212 states, 108211 states have (on average 1.092301152378224) internal successors, (118199), 108211 states have internal predecessors, (118199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:52:16,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108212 states to 108212 states and 118199 transitions. [2024-11-06 19:52:16,297 INFO L78 Accepts]: Start accepts. Automaton has 108212 states and 118199 transitions. Word has length 468 [2024-11-06 19:52:16,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:52:16,298 INFO L471 AbstractCegarLoop]: Abstraction has 108212 states and 118199 transitions. [2024-11-06 19:52:16,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:52:16,298 INFO L276 IsEmpty]: Start isEmpty. Operand 108212 states and 118199 transitions. [2024-11-06 19:52:16,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 473 [2024-11-06 19:52:16,304 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:52:16,304 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:52:16,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 19:52:16,305 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:52:16,305 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:52:16,305 INFO L85 PathProgramCache]: Analyzing trace with hash 1893972176, now seen corresponding path program 1 times [2024-11-06 19:52:16,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:52:16,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994600570] [2024-11-06 19:52:16,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:52:16,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:52:16,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:52:16,554 INFO L134 CoverageAnalysis]: Checked inductivity of 672 backedges. 400 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-06 19:52:16,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:52:16,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994600570] [2024-11-06 19:52:16,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994600570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:52:16,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:52:16,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:52:16,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296089430] [2024-11-06 19:52:16,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:52:16,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:52:16,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:52:16,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:52:16,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:52:16,556 INFO L87 Difference]: Start difference. First operand 108212 states and 118199 transitions. Second operand has 3 states, 3 states have (on average 96.66666666666667) internal successors, (290), 3 states have internal predecessors, (290), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)