./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label36.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_label36.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', 'e5aa96fbac0e92c80f1f80982b7986fb62416e04af83c742e32bbaeb89f3bf9f'] 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_label36.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 e5aa96fbac0e92c80f1f80982b7986fb62416e04af83c742e32bbaeb89f3bf9f --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:49:13,961 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:49:14,060 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:49:14,066 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:49:14,068 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:49:14,093 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:49:14,093 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:49:14,093 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:49:14,094 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:49:14,094 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:49:14,095 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:49:14,095 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:49:14,095 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:49:14,096 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:49:14,096 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:49:14,096 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:49:14,096 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:49:14,096 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:49:14,097 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:49:14,097 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:49:14,097 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:49:14,097 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:49:14,097 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:49:14,098 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:49:14,098 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:49:14,098 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:49:14,098 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:49:14,098 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:49:14,098 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:49:14,098 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:49:14,099 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:49:14,099 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:49:14,099 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:49:14,099 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:49:14,099 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:49:14,100 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:49:14,100 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:49:14,100 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:49:14,100 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:49:14,100 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:49:14,100 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:49:14,100 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:49:14,100 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 -> e5aa96fbac0e92c80f1f80982b7986fb62416e04af83c742e32bbaeb89f3bf9f [2024-11-06 19:49:14,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:49:14,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:49:14,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:49:14,393 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:49:14,394 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:49:14,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label36.c [2024-11-06 19:49:15,767 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:49:16,242 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:49:16,243 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label36.c [2024-11-06 19:49:16,280 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/546ed91cb/8b373c53a40143b592885dc60c977227/FLAGba42c5b3e [2024-11-06 19:49:16,300 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/546ed91cb/8b373c53a40143b592885dc60c977227 [2024-11-06 19:49:16,302 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:49:16,303 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:49:16,304 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:49:16,305 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:49:16,309 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:49:16,310 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:49:16" (1/1) ... [2024-11-06 19:49:16,311 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22d60fa1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:16, skipping insertion in model container [2024-11-06 19:49:16,311 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:49:16" (1/1) ... [2024-11-06 19:49:16,412 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:49:16,614 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_label36.c[1933,1946] [2024-11-06 19:49:17,280 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:49:17,297 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:49:17,312 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_label36.c[1933,1946] [2024-11-06 19:49:17,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:49:17,755 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:49:17,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:17 WrapperNode [2024-11-06 19:49:17,756 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:49:17,757 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:49:17,757 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:49:17,758 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:49:17,764 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:49:17" (1/1) ... [2024-11-06 19:49:17,817 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:49:17" (1/1) ... [2024-11-06 19:49:18,409 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-11-06 19:49:18,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:49:18,418 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:49:18,418 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:49:18,419 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:49:18,430 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:17" (1/1) ... [2024-11-06 19:49:18,430 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:17" (1/1) ... [2024-11-06 19:49:18,543 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:17" (1/1) ... [2024-11-06 19:49:18,761 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:49:18,762 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:17" (1/1) ... [2024-11-06 19:49:18,762 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:17" (1/1) ... [2024-11-06 19:49:18,948 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:17" (1/1) ... [2024-11-06 19:49:18,985 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:17" (1/1) ... [2024-11-06 19:49:19,041 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:17" (1/1) ... [2024-11-06 19:49:19,066 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:17" (1/1) ... [2024-11-06 19:49:19,128 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:49:19,129 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:49:19,130 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:49:19,130 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:49:19,131 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:17" (1/1) ... [2024-11-06 19:49:19,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:49:19,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:49:19,164 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:49:19,171 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:49:19,189 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:49:19,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:49:19,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:49:19,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:49:19,263 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:49:19,265 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:49:25,234 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-11-06 19:49:25,234 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:49:25,272 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:49:25,273 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:49:25,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:49:25 BoogieIcfgContainer [2024-11-06 19:49:25,273 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:49:25,276 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:49:25,276 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:49:25,281 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:49:25,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:49:16" (1/3) ... [2024-11-06 19:49:25,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f7e2083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:49:25, skipping insertion in model container [2024-11-06 19:49:25,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:49:17" (2/3) ... [2024-11-06 19:49:25,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f7e2083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:49:25, skipping insertion in model container [2024-11-06 19:49:25,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:49:25" (3/3) ... [2024-11-06 19:49:25,283 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label36.c [2024-11-06 19:49:25,297 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:49:25,297 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:49:25,380 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:49:25,391 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;@6c2f478c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:49:25,392 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:49:25,399 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:49:25,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-06 19:49:25,404 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:49:25,405 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:49:25,405 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:49:25,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:49:25,408 INFO L85 PathProgramCache]: Analyzing trace with hash -988188511, now seen corresponding path program 1 times [2024-11-06 19:49:25,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:49:25,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313151414] [2024-11-06 19:49:25,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:49:25,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:49:25,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:49:25,611 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:49:25,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:49:25,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313151414] [2024-11-06 19:49:25,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1313151414] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:49:25,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:49:25,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:49:25,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645087415] [2024-11-06 19:49:25,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:49:25,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:49:25,621 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:49:25,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:49:25,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:49:25,642 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 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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:49:29,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:49:29,481 INFO L93 Difference]: Finished difference Result 3035 states and 5643 transitions. [2024-11-06 19:49:29,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:49:29,483 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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 11 [2024-11-06 19:49:29,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:49:29,509 INFO L225 Difference]: With dead ends: 3035 [2024-11-06 19:49:29,513 INFO L226 Difference]: Without dead ends: 1873 [2024-11-06 19:49:29,524 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:49:29,528 INFO L432 NwaCegarLoop]: 991 mSDtfsCounter, 894 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 894 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 3363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 858 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:49:29,529 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [894 Valid, 1145 Invalid, 3363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [858 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2024-11-06 19:49:29,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2024-11-06 19:49:29,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1859. [2024-11-06 19:49:29,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1858 states have (on average 1.5441334768568353) internal successors, (2869), 1858 states have internal predecessors, (2869), 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:49:29,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2869 transitions. [2024-11-06 19:49:29,653 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2869 transitions. Word has length 11 [2024-11-06 19:49:29,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:49:29,653 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2869 transitions. [2024-11-06 19:49:29,653 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 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:49:29,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2869 transitions. [2024-11-06 19:49:29,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2024-11-06 19:49:29,656 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:49:29,657 INFO L215 NwaCegarLoop]: trace histogram [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:49:29,657 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:49:29,658 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:49:29,658 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:49:29,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1609309291, now seen corresponding path program 1 times [2024-11-06 19:49:29,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:49:29,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425725809] [2024-11-06 19:49:29,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:49:29,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:49:29,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:49:30,065 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:49:30,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:49:30,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425725809] [2024-11-06 19:49:30,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425725809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:49:30,067 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:49:30,067 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:49:30,068 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1722100133] [2024-11-06 19:49:30,068 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:49:30,069 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:49:30,069 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:49:30,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:49:30,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:49:30,070 INFO L87 Difference]: Start difference. First operand 1859 states and 2869 transitions. Second operand has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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:49:33,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:49:33,330 INFO L93 Difference]: Finished difference Result 5317 states and 8229 transitions. [2024-11-06 19:49:33,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:49:33,331 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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 83 [2024-11-06 19:49:33,331 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:49:33,345 INFO L225 Difference]: With dead ends: 5317 [2024-11-06 19:49:33,345 INFO L226 Difference]: Without dead ends: 3460 [2024-11-06 19:49:33,349 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:49:33,351 INFO L432 NwaCegarLoop]: 1039 mSDtfsCounter, 826 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:49:33,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1192 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2024-11-06 19:49:33,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2024-11-06 19:49:33,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 3459. [2024-11-06 19:49:33,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 3458 states have (on average 1.3805668016194332) internal successors, (4774), 3458 states have internal predecessors, (4774), 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:49:33,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 4774 transitions. [2024-11-06 19:49:33,431 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 4774 transitions. Word has length 83 [2024-11-06 19:49:33,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:49:33,431 INFO L471 AbstractCegarLoop]: Abstraction has 3459 states and 4774 transitions. [2024-11-06 19:49:33,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 27.666666666666668) internal successors, (83), 2 states have internal predecessors, (83), 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:49:33,432 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 4774 transitions. [2024-11-06 19:49:33,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-06 19:49:33,436 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:49:33,436 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-06 19:49:33,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:49:33,437 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:49:33,437 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:49:33,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1227644418, now seen corresponding path program 1 times [2024-11-06 19:49:33,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:49:33,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971839252] [2024-11-06 19:49:33,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:49:33,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:49:33,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:49:33,889 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:49:33,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:49:33,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971839252] [2024-11-06 19:49:33,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [971839252] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:49:33,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:49:33,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:49:33,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749908603] [2024-11-06 19:49:33,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:49:33,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:49:33,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:49:33,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:49:33,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:49:33,891 INFO L87 Difference]: Start difference. First operand 3459 states and 4774 transitions. Second operand has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 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:49:38,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:49:38,007 INFO L93 Difference]: Finished difference Result 10870 states and 14768 transitions. [2024-11-06 19:49:38,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:49:38,007 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 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 97 [2024-11-06 19:49:38,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:49:38,035 INFO L225 Difference]: With dead ends: 10870 [2024-11-06 19:49:38,036 INFO L226 Difference]: Without dead ends: 7413 [2024-11-06 19:49:38,042 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:49:38,043 INFO L432 NwaCegarLoop]: 708 mSDtfsCounter, 2584 mSDsluCounter, 293 mSDsCounter, 0 mSdLazyCounter, 4117 mSolverCounterSat, 831 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2584 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 4948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 831 IncrementalHoareTripleChecker+Valid, 4117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:49:38,043 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2584 Valid, 1001 Invalid, 4948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [831 Valid, 4117 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2024-11-06 19:49:38,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7413 states. [2024-11-06 19:49:38,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7413 to 7412. [2024-11-06 19:49:38,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7412 states, 7411 states have (on average 1.2701389825934422) internal successors, (9413), 7411 states have internal predecessors, (9413), 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:49:38,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7412 states to 7412 states and 9413 transitions. [2024-11-06 19:49:38,182 INFO L78 Accepts]: Start accepts. Automaton has 7412 states and 9413 transitions. Word has length 97 [2024-11-06 19:49:38,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:49:38,184 INFO L471 AbstractCegarLoop]: Abstraction has 7412 states and 9413 transitions. [2024-11-06 19:49:38,184 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.25) internal successors, (97), 3 states have internal predecessors, (97), 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:49:38,185 INFO L276 IsEmpty]: Start isEmpty. Operand 7412 states and 9413 transitions. [2024-11-06 19:49:38,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-06 19:49:38,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:49:38,187 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-06 19:49:38,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:49:38,187 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:49:38,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:49:38,188 INFO L85 PathProgramCache]: Analyzing trace with hash -108302625, now seen corresponding path program 1 times [2024-11-06 19:49:38,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:49:38,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913384468] [2024-11-06 19:49:38,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:49:38,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:49:38,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:49:38,469 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:49:38,469 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:49:38,469 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913384468] [2024-11-06 19:49:38,469 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913384468] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:49:38,469 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:49:38,469 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:49:38,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048819899] [2024-11-06 19:49:38,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:49:38,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:49:38,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:49:38,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:49:38,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:49:38,471 INFO L87 Difference]: Start difference. First operand 7412 states and 9413 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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:49:41,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:49:41,460 INFO L93 Difference]: Finished difference Result 17195 states and 22713 transitions. [2024-11-06 19:49:41,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:49:41,461 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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 107 [2024-11-06 19:49:41,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:49:41,492 INFO L225 Difference]: With dead ends: 17195 [2024-11-06 19:49:41,493 INFO L226 Difference]: Without dead ends: 10572 [2024-11-06 19:49:41,500 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:49:41,500 INFO L432 NwaCegarLoop]: 787 mSDtfsCounter, 957 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2374 mSolverCounterSat, 925 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 3299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 925 IncrementalHoareTripleChecker+Valid, 2374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:49:41,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 904 Invalid, 3299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [925 Valid, 2374 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-06 19:49:41,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10572 states. [2024-11-06 19:49:41,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10572 to 10564. [2024-11-06 19:49:41,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10564 states, 10563 states have (on average 1.253905140585061) internal successors, (13245), 10563 states have internal predecessors, (13245), 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:49:41,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10564 states to 10564 states and 13245 transitions. [2024-11-06 19:49:41,666 INFO L78 Accepts]: Start accepts. Automaton has 10564 states and 13245 transitions. Word has length 107 [2024-11-06 19:49:41,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:49:41,667 INFO L471 AbstractCegarLoop]: Abstraction has 10564 states and 13245 transitions. [2024-11-06 19:49:41,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 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:49:41,667 INFO L276 IsEmpty]: Start isEmpty. Operand 10564 states and 13245 transitions. [2024-11-06 19:49:41,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-06 19:49:41,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:49:41,674 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:49:41,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:49:41,675 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:49:41,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:49:41,675 INFO L85 PathProgramCache]: Analyzing trace with hash 779082744, now seen corresponding path program 1 times [2024-11-06 19:49:41,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:49:41,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1112127395] [2024-11-06 19:49:41,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:49:41,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:49:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:49:41,886 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-06 19:49:41,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:49:41,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1112127395] [2024-11-06 19:49:41,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1112127395] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:49:41,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:49:41,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:49:41,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1591708526] [2024-11-06 19:49:41,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:49:41,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:49:41,888 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:49:41,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:49:41,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:49:41,890 INFO L87 Difference]: Start difference. First operand 10564 states and 13245 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 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:49:44,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:49:44,860 INFO L93 Difference]: Finished difference Result 23508 states and 30389 transitions. [2024-11-06 19:49:44,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:49:44,860 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 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 196 [2024-11-06 19:49:44,860 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:49:44,892 INFO L225 Difference]: With dead ends: 23508 [2024-11-06 19:49:44,893 INFO L226 Difference]: Without dead ends: 13733 [2024-11-06 19:49:44,900 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:49:44,901 INFO L432 NwaCegarLoop]: 776 mSDtfsCounter, 1013 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 983 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1013 SdHoareTripleChecker+Valid, 862 SdHoareTripleChecker+Invalid, 3385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 983 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:49:44,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1013 Valid, 862 Invalid, 3385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [983 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-06 19:49:44,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13733 states. [2024-11-06 19:49:45,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13733 to 13723. [2024-11-06 19:49:45,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13723 states, 13722 states have (on average 1.2664334645095467) internal successors, (17378), 13722 states have internal predecessors, (17378), 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:49:45,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13723 states to 13723 states and 17378 transitions. [2024-11-06 19:49:45,111 INFO L78 Accepts]: Start accepts. Automaton has 13723 states and 17378 transitions. Word has length 196 [2024-11-06 19:49:45,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:49:45,111 INFO L471 AbstractCegarLoop]: Abstraction has 13723 states and 17378 transitions. [2024-11-06 19:49:45,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 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:49:45,112 INFO L276 IsEmpty]: Start isEmpty. Operand 13723 states and 17378 transitions. [2024-11-06 19:49:45,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-06 19:49:45,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:49:45,117 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-06 19:49:45,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:49:45,118 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:49:45,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:49:45,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1434792581, now seen corresponding path program 1 times [2024-11-06 19:49:45,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:49:45,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [204515080] [2024-11-06 19:49:45,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:49:45,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:49:45,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:49:45,444 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-06 19:49:45,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:49:45,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [204515080] [2024-11-06 19:49:45,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [204515080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:49:45,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:49:45,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:49:45,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1861764106] [2024-11-06 19:49:45,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:49:45,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:49:45,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:49:45,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:49:45,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:49:45,447 INFO L87 Difference]: Start difference. First operand 13723 states and 17378 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 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:49:48,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:49:48,551 INFO L93 Difference]: Finished difference Result 32945 states and 42853 transitions. [2024-11-06 19:49:48,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:49:48,551 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 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 227 [2024-11-06 19:49:48,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:49:48,589 INFO L225 Difference]: With dead ends: 32945 [2024-11-06 19:49:48,589 INFO L226 Difference]: Without dead ends: 20011 [2024-11-06 19:49:48,599 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:49:48,601 INFO L432 NwaCegarLoop]: 1463 mSDtfsCounter, 1152 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 773 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 1552 SdHoareTripleChecker+Invalid, 3175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 773 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:49:48,601 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 1552 Invalid, 3175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [773 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-06 19:49:48,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20011 states. [2024-11-06 19:49:48,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20011 to 20010. [2024-11-06 19:49:48,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20010 states, 20009 states have (on average 1.2513868759058424) internal successors, (25039), 20009 states have internal predecessors, (25039), 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:49:48,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20010 states to 20010 states and 25039 transitions. [2024-11-06 19:49:48,835 INFO L78 Accepts]: Start accepts. Automaton has 20010 states and 25039 transitions. Word has length 227 [2024-11-06 19:49:48,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:49:48,839 INFO L471 AbstractCegarLoop]: Abstraction has 20010 states and 25039 transitions. [2024-11-06 19:49:48,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 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:49:48,839 INFO L276 IsEmpty]: Start isEmpty. Operand 20010 states and 25039 transitions. [2024-11-06 19:49:48,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2024-11-06 19:49:48,847 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:49:48,847 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-06 19:49:48,848 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:49:48,848 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:49:48,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:49:48,849 INFO L85 PathProgramCache]: Analyzing trace with hash -696232707, now seen corresponding path program 1 times [2024-11-06 19:49:48,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:49:48,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537453052] [2024-11-06 19:49:48,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:49:48,849 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:49:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:49:49,371 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:49:49,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:49:49,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537453052] [2024-11-06 19:49:49,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537453052] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:49:49,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:49:49,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:49:49,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317966430] [2024-11-06 19:49:49,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:49:49,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:49:49,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:49:49,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:49:49,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:49:49,376 INFO L87 Difference]: Start difference. First operand 20010 states and 25039 transitions. Second operand has 4 states, 4 states have (on average 68.25) internal successors, (273), 3 states have internal predecessors, (273), 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:49:54,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:49:54,084 INFO L93 Difference]: Finished difference Result 54214 states and 66857 transitions. [2024-11-06 19:49:54,085 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:49:54,085 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.25) internal successors, (273), 3 states have internal predecessors, (273), 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 273 [2024-11-06 19:49:54,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:49:54,161 INFO L225 Difference]: With dead ends: 54214 [2024-11-06 19:49:54,161 INFO L226 Difference]: Without dead ends: 34993 [2024-11-06 19:49:54,180 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:49:54,181 INFO L432 NwaCegarLoop]: 695 mSDtfsCounter, 1455 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 5775 mSolverCounterSat, 497 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1455 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 6272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 497 IncrementalHoareTripleChecker+Valid, 5775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:49:54,181 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1455 Valid, 994 Invalid, 6272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [497 Valid, 5775 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-06 19:49:54,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34993 states. [2024-11-06 19:49:54,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34993 to 34983. [2024-11-06 19:49:54,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34983 states, 34982 states have (on average 1.206220341890115) internal successors, (42196), 34982 states have internal predecessors, (42196), 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:49:54,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34983 states to 34983 states and 42196 transitions. [2024-11-06 19:49:54,577 INFO L78 Accepts]: Start accepts. Automaton has 34983 states and 42196 transitions. Word has length 273 [2024-11-06 19:49:54,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:49:54,578 INFO L471 AbstractCegarLoop]: Abstraction has 34983 states and 42196 transitions. [2024-11-06 19:49:54,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.25) internal successors, (273), 3 states have internal predecessors, (273), 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:49:54,579 INFO L276 IsEmpty]: Start isEmpty. Operand 34983 states and 42196 transitions. [2024-11-06 19:49:54,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2024-11-06 19:49:54,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:49:54,584 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1] [2024-11-06 19:49:54,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:49:54,585 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:49:54,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:49:54,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1312002571, now seen corresponding path program 1 times [2024-11-06 19:49:54,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:49:54,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969446115] [2024-11-06 19:49:54,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:49:54,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:49:54,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:49:55,915 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 31 proven. 110 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:49:55,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:49:55,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969446115] [2024-11-06 19:49:55,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969446115] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:49:55,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1283976910] [2024-11-06 19:49:55,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:49:55,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:49:55,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:49:55,921 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:49:55,922 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:49:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:49:56,062 INFO L255 TraceCheckSpWp]: Trace formula consists of 410 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 19:49:56,070 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:49:56,977 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2024-11-06 19:49:56,977 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:49:56,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1283976910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:49:56,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:49:56,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [5] total 6 [2024-11-06 19:49:56,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602408676] [2024-11-06 19:49:56,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:49:56,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:49:56,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:49:56,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:49:56,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:49:56,980 INFO L87 Difference]: Start difference. First operand 34983 states and 42196 transitions. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 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:49:59,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:49:59,576 INFO L93 Difference]: Finished difference Result 71545 states and 86119 transitions. [2024-11-06 19:49:59,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:49:59,577 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 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 302 [2024-11-06 19:49:59,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:49:59,646 INFO L225 Difference]: With dead ends: 71545 [2024-11-06 19:49:59,646 INFO L226 Difference]: Without dead ends: 37351 [2024-11-06 19:49:59,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:49:59,673 INFO L432 NwaCegarLoop]: 1050 mSDtfsCounter, 643 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 2478 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 643 SdHoareTripleChecker+Valid, 1185 SdHoareTripleChecker+Invalid, 2589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 2478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:49:59,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [643 Valid, 1185 Invalid, 2589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 2478 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 19:49:59,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37351 states. [2024-11-06 19:50:00,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37351 to 36557. [2024-11-06 19:50:00,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36557 states, 36556 states have (on average 1.2000765948134369) internal successors, (43870), 36556 states have internal predecessors, (43870), 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:50:00,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36557 states to 36557 states and 43870 transitions. [2024-11-06 19:50:00,088 INFO L78 Accepts]: Start accepts. Automaton has 36557 states and 43870 transitions. Word has length 302 [2024-11-06 19:50:00,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:50:00,089 INFO L471 AbstractCegarLoop]: Abstraction has 36557 states and 43870 transitions. [2024-11-06 19:50:00,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 2 states have internal predecessors, (179), 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:50:00,089 INFO L276 IsEmpty]: Start isEmpty. Operand 36557 states and 43870 transitions. [2024-11-06 19:50:00,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2024-11-06 19:50:00,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:50:00,178 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-06 19:50:00,218 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-06 19:50:00,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:50:00,380 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:50:00,381 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:50:00,385 INFO L85 PathProgramCache]: Analyzing trace with hash -493121243, now seen corresponding path program 1 times [2024-11-06 19:50:00,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:50:00,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094705905] [2024-11-06 19:50:00,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:50:00,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:50:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:50:00,717 INFO L134 CoverageAnalysis]: Checked inductivity of 267 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-06 19:50:00,717 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:50:00,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094705905] [2024-11-06 19:50:00,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094705905] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:50:00,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:50:00,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:50:00,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [103703693] [2024-11-06 19:50:00,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:50:00,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:50:00,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:50:00,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:50:00,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:00,719 INFO L87 Difference]: Start difference. First operand 36557 states and 43870 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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:50:03,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:50:03,690 INFO L93 Difference]: Finished difference Result 71522 states and 85753 transitions. [2024-11-06 19:50:03,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:50:03,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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 305 [2024-11-06 19:50:03,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:50:03,734 INFO L225 Difference]: With dead ends: 71522 [2024-11-06 19:50:03,735 INFO L226 Difference]: Without dead ends: 35754 [2024-11-06 19:50:03,754 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:50:03,755 INFO L432 NwaCegarLoop]: 1498 mSDtfsCounter, 1026 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 2349 mSolverCounterSat, 592 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1026 SdHoareTripleChecker+Valid, 1632 SdHoareTripleChecker+Invalid, 2941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 592 IncrementalHoareTripleChecker+Valid, 2349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:50:03,755 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1026 Valid, 1632 Invalid, 2941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [592 Valid, 2349 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-06 19:50:03,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35754 states. [2024-11-06 19:50:04,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35754 to 34965. [2024-11-06 19:50:04,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34965 states, 34964 states have (on average 1.1313636883651756) internal successors, (39557), 34964 states have internal predecessors, (39557), 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:50:04,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34965 states to 34965 states and 39557 transitions. [2024-11-06 19:50:04,083 INFO L78 Accepts]: Start accepts. Automaton has 34965 states and 39557 transitions. Word has length 305 [2024-11-06 19:50:04,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:50:04,083 INFO L471 AbstractCegarLoop]: Abstraction has 34965 states and 39557 transitions. [2024-11-06 19:50:04,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 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:50:04,083 INFO L276 IsEmpty]: Start isEmpty. Operand 34965 states and 39557 transitions. [2024-11-06 19:50:04,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2024-11-06 19:50:04,089 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:50:04,089 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:50:04,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 19:50:04,089 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:50:04,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:50:04,090 INFO L85 PathProgramCache]: Analyzing trace with hash -704785122, now seen corresponding path program 1 times [2024-11-06 19:50:04,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:50:04,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911996784] [2024-11-06 19:50:04,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:50:04,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:50:04,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:50:04,410 INFO L134 CoverageAnalysis]: Checked inductivity of 112 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-06 19:50:04,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:50:04,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911996784] [2024-11-06 19:50:04,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911996784] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:50:04,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:50:04,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:50:04,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878275304] [2024-11-06 19:50:04,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:50:04,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:50:04,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:50:04,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:50:04,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:04,411 INFO L87 Difference]: Start difference. First operand 34965 states and 39557 transitions. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 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:50:07,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:50:07,788 INFO L93 Difference]: Finished difference Result 92776 states and 105171 transitions. [2024-11-06 19:50:07,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:50:07,788 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 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 309 [2024-11-06 19:50:07,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:50:07,856 INFO L225 Difference]: With dead ends: 92776 [2024-11-06 19:50:07,856 INFO L226 Difference]: Without dead ends: 57021 [2024-11-06 19:50:07,888 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:50:07,889 INFO L432 NwaCegarLoop]: 868 mSDtfsCounter, 762 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 2534 mSolverCounterSat, 733 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 990 SdHoareTripleChecker+Invalid, 3267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 733 IncrementalHoareTripleChecker+Valid, 2534 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:50:07,889 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 990 Invalid, 3267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [733 Valid, 2534 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-06 19:50:07,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57021 states. [2024-11-06 19:50:08,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57021 to 54645. [2024-11-06 19:50:08,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54645 states, 54644 states have (on average 1.0941548934924237) internal successors, (59789), 54644 states have internal predecessors, (59789), 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:50:08,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54645 states to 54645 states and 59789 transitions. [2024-11-06 19:50:08,422 INFO L78 Accepts]: Start accepts. Automaton has 54645 states and 59789 transitions. Word has length 309 [2024-11-06 19:50:08,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:50:08,423 INFO L471 AbstractCegarLoop]: Abstraction has 54645 states and 59789 transitions. [2024-11-06 19:50:08,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 2 states have internal predecessors, (215), 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:50:08,423 INFO L276 IsEmpty]: Start isEmpty. Operand 54645 states and 59789 transitions. [2024-11-06 19:50:08,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 461 [2024-11-06 19:50:08,432 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:50:08,432 INFO L215 NwaCegarLoop]: trace histogram [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, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 19:50:08,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:50:08,432 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:50:08,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:50:08,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1451394545, now seen corresponding path program 1 times [2024-11-06 19:50:08,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:50:08,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025927918] [2024-11-06 19:50:08,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:50:08,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:50:08,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:50:08,716 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 475 proven. 0 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2024-11-06 19:50:08,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:50:08,717 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025927918] [2024-11-06 19:50:08,717 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025927918] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:50:08,717 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:50:08,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:50:08,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071125010] [2024-11-06 19:50:08,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:50:08,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:50:08,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:50:08,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:50:08,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:50:08,720 INFO L87 Difference]: Start difference. First operand 54645 states and 59789 transitions. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 3 states have internal predecessors, (369), 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:50:14,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:50:14,007 INFO L93 Difference]: Finished difference Result 174782 states and 190975 transitions. [2024-11-06 19:50:14,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:50:14,008 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 3 states have internal predecessors, (369), 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 460 [2024-11-06 19:50:14,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:50:14,131 INFO L225 Difference]: With dead ends: 174782 [2024-11-06 19:50:14,131 INFO L226 Difference]: Without dead ends: 120926 [2024-11-06 19:50:14,171 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:50:14,172 INFO L432 NwaCegarLoop]: 676 mSDtfsCounter, 1682 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 5769 mSolverCounterSat, 933 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1682 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 6702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 933 IncrementalHoareTripleChecker+Valid, 5769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:50:14,172 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1682 Valid, 857 Invalid, 6702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [933 Valid, 5769 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2024-11-06 19:50:14,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120926 states. [2024-11-06 19:50:15,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120926 to 119241. [2024-11-06 19:50:15,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119241 states, 119240 states have (on average 1.0827658503857767) internal successors, (129109), 119240 states have internal predecessors, (129109), 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:50:15,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119241 states to 119241 states and 129109 transitions. [2024-11-06 19:50:15,754 INFO L78 Accepts]: Start accepts. Automaton has 119241 states and 129109 transitions. Word has length 460 [2024-11-06 19:50:15,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:50:15,755 INFO L471 AbstractCegarLoop]: Abstraction has 119241 states and 129109 transitions. [2024-11-06 19:50:15,755 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 3 states have internal predecessors, (369), 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:50:15,755 INFO L276 IsEmpty]: Start isEmpty. Operand 119241 states and 129109 transitions. [2024-11-06 19:50:15,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 472 [2024-11-06 19:50:15,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:50:15,763 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:50:15,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 19:50:15,764 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:50:15,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:50:15,764 INFO L85 PathProgramCache]: Analyzing trace with hash -1959639978, now seen corresponding path program 1 times [2024-11-06 19:50:15,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:50:15,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94854265] [2024-11-06 19:50:15,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:50:15,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:50:15,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:50:16,463 INFO L134 CoverageAnalysis]: Checked inductivity of 525 backedges. 364 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-11-06 19:50:16,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:50:16,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94854265] [2024-11-06 19:50:16,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94854265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:50:16,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:50:16,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:50:16,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679422295] [2024-11-06 19:50:16,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:50:16,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:50:16,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:50:16,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:50:16,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:16,468 INFO L87 Difference]: Start difference. First operand 119241 states and 129109 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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:50:19,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:50:19,605 INFO L93 Difference]: Finished difference Result 239272 states and 259019 transitions. [2024-11-06 19:50:19,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:50:19,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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 471 [2024-11-06 19:50:19,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:50:19,732 INFO L225 Difference]: With dead ends: 239272 [2024-11-06 19:50:19,732 INFO L226 Difference]: Without dead ends: 120820 [2024-11-06 19:50:19,777 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:50:19,777 INFO L432 NwaCegarLoop]: 1347 mSDtfsCounter, 831 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 2386 mSolverCounterSat, 575 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 831 SdHoareTripleChecker+Valid, 1427 SdHoareTripleChecker+Invalid, 2961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 575 IncrementalHoareTripleChecker+Valid, 2386 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:50:19,778 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [831 Valid, 1427 Invalid, 2961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [575 Valid, 2386 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 19:50:19,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120820 states. [2024-11-06 19:50:20,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120820 to 119234. [2024-11-06 19:50:20,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119234 states, 119233 states have (on average 1.0619627116653947) internal successors, (126621), 119233 states have internal predecessors, (126621), 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:50:20,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119234 states to 119234 states and 126621 transitions. [2024-11-06 19:50:20,920 INFO L78 Accepts]: Start accepts. Automaton has 119234 states and 126621 transitions. Word has length 471 [2024-11-06 19:50:20,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:50:20,920 INFO L471 AbstractCegarLoop]: Abstraction has 119234 states and 126621 transitions. [2024-11-06 19:50:20,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 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:50:20,921 INFO L276 IsEmpty]: Start isEmpty. Operand 119234 states and 126621 transitions. [2024-11-06 19:50:20,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 479 [2024-11-06 19:50:20,926 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:50:20,926 INFO L215 NwaCegarLoop]: trace histogram [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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:50:20,926 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:50:20,926 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:50:20,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:50:20,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1417502575, now seen corresponding path program 1 times [2024-11-06 19:50:20,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:50:20,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756112347] [2024-11-06 19:50:20,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:50:20,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:50:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:50:21,647 INFO L134 CoverageAnalysis]: Checked inductivity of 605 backedges. 324 proven. 0 refuted. 0 times theorem prover too weak. 281 trivial. 0 not checked. [2024-11-06 19:50:21,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:50:21,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756112347] [2024-11-06 19:50:21,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756112347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:50:21,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:50:21,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:50:21,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375838614] [2024-11-06 19:50:21,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:50:21,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:50:21,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:50:21,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:50:21,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:50:21,649 INFO L87 Difference]: Start difference. First operand 119234 states and 126621 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 2 states have internal predecessors, (288), 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:50:24,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:50:24,574 INFO L93 Difference]: Finished difference Result 225877 states and 240296 transitions. [2024-11-06 19:50:24,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:50:24,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 2 states have internal predecessors, (288), 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 478 [2024-11-06 19:50:24,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:50:24,747 INFO L225 Difference]: With dead ends: 225877 [2024-11-06 19:50:24,748 INFO L226 Difference]: Without dead ends: 119243 [2024-11-06 19:50:24,812 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:50:24,813 INFO L432 NwaCegarLoop]: 945 mSDtfsCounter, 720 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 2589 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 720 SdHoareTripleChecker+Valid, 1114 SdHoareTripleChecker+Invalid, 2593 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2589 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:50:24,813 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [720 Valid, 1114 Invalid, 2593 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2589 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 19:50:24,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119243 states. [2024-11-06 19:50:25,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119243 to 119234. [2024-11-06 19:50:26,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119234 states, 119233 states have (on average 1.0615852993718182) internal successors, (126576), 119233 states have internal predecessors, (126576), 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:50:26,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119234 states to 119234 states and 126576 transitions. [2024-11-06 19:50:26,173 INFO L78 Accepts]: Start accepts. Automaton has 119234 states and 126576 transitions. Word has length 478 [2024-11-06 19:50:26,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:50:26,173 INFO L471 AbstractCegarLoop]: Abstraction has 119234 states and 126576 transitions. [2024-11-06 19:50:26,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 2 states have internal predecessors, (288), 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:50:26,173 INFO L276 IsEmpty]: Start isEmpty. Operand 119234 states and 126576 transitions. [2024-11-06 19:50:26,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 503 [2024-11-06 19:50:26,179 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:50:26,179 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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] [2024-11-06 19:50:26,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 19:50:26,180 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:50:26,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:50:26,180 INFO L85 PathProgramCache]: Analyzing trace with hash 1234836487, now seen corresponding path program 1 times [2024-11-06 19:50:26,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:50:26,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1059535061] [2024-11-06 19:50:26,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:50:26,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:50:26,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:50:27,466 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 343 proven. 100 refuted. 0 times theorem prover too weak. 358 trivial. 0 not checked. [2024-11-06 19:50:27,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:50:27,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1059535061] [2024-11-06 19:50:27,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1059535061] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:50:27,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1553097945] [2024-11-06 19:50:27,467 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:50:27,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:50:27,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:50:27,469 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:50:27,472 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:50:27,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:50:27,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 19:50:27,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:50:28,307 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 594 proven. 0 refuted. 0 times theorem prover too weak. 207 trivial. 0 not checked. [2024-11-06 19:50:28,307 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:50:28,307 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1553097945] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:50:28,307 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:50:28,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 6 [2024-11-06 19:50:28,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035129100] [2024-11-06 19:50:28,308 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:50:28,308 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:50:28,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:50:28,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:50:28,309 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 19:50:28,309 INFO L87 Difference]: Start difference. First operand 119234 states and 126576 transitions. Second operand has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 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:50:31,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:50:31,702 INFO L93 Difference]: Finished difference Result 231378 states and 246089 transitions. [2024-11-06 19:50:31,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:50:31,703 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 91.0) internal successors, (364), 4 states have internal predecessors, (364), 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 502 [2024-11-06 19:50:31,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:50:31,838 INFO L225 Difference]: With dead ends: 231378 [2024-11-06 19:50:31,838 INFO L226 Difference]: Without dead ends: 124744 [2024-11-06 19:50:31,900 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 505 GetRequests, 501 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 19:50:31,900 INFO L432 NwaCegarLoop]: 608 mSDtfsCounter, 1891 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 4043 mSolverCounterSat, 472 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1891 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 4515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 472 IncrementalHoareTripleChecker+Valid, 4043 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:50:31,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1891 Valid, 780 Invalid, 4515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [472 Valid, 4043 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-06 19:50:31,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124744 states.