./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem12_label09.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/Problem12_label09.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', '3266bb9a560f42e93e7f83a070eaa64f467717133c7f2cf6394974f84eb01d92'] 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/Problem12_label09.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 3266bb9a560f42e93e7f83a070eaa64f467717133c7f2cf6394974f84eb01d92 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:40:48,383 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:40:48,493 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:40:48,498 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:40:48,498 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:40:48,523 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:40:48,524 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:40:48,524 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:40:48,524 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:40:48,524 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:40:48,524 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:40:48,525 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:40:48,525 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:40:48,525 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:40:48,526 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:40:48,526 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:40:48,526 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:40:48,526 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:40:48,527 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:40:48,527 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:40:48,527 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:40:48,527 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:40:48,527 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:40:48,527 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:40:48,527 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:40:48,527 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:40:48,527 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:40:48,527 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:40:48,528 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:40:48,528 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:40:48,528 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:40:48,528 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:40:48,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:40:48,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:40:48,528 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:40:48,528 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:40:48,528 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:40:48,528 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:40:48,528 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:40:48,528 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:40:48,528 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:40:48,529 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:40:48,529 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 -> 3266bb9a560f42e93e7f83a070eaa64f467717133c7f2cf6394974f84eb01d92 [2024-11-06 19:40:48,834 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:40:48,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:40:48,848 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:40:48,849 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:40:48,849 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:40:48,850 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem12_label09.c [2024-11-06 19:40:50,126 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:40:50,698 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:40:50,701 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem12_label09.c [2024-11-06 19:40:50,743 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d35b5b6f3/4ad4e4b267fa43f7a28896b117310649/FLAG2ff479441 [2024-11-06 19:40:51,189 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/d35b5b6f3/4ad4e4b267fa43f7a28896b117310649 [2024-11-06 19:40:51,191 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:40:51,192 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:40:51,193 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:40:51,193 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:40:51,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:40:51,196 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:40:51" (1/1) ... [2024-11-06 19:40:51,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@464548b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:51, skipping insertion in model container [2024-11-06 19:40:51,197 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:40:51" (1/1) ... [2024-11-06 19:40:51,282 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:40:51,518 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/Problem12_label09.c[8109,8122] [2024-11-06 19:40:52,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:40:52,090 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:40:52,115 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/Problem12_label09.c[8109,8122] [2024-11-06 19:40:52,444 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:40:52,467 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:40:52,468 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:52 WrapperNode [2024-11-06 19:40:52,468 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:40:52,469 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:40:52,470 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:40:52,470 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:40:52,475 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:40:52" (1/1) ... [2024-11-06 19:40:52,538 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:40:52" (1/1) ... [2024-11-06 19:40:52,892 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 4761 [2024-11-06 19:40:52,893 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:40:52,894 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:40:52,894 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:40:52,895 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:40:52,903 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:52" (1/1) ... [2024-11-06 19:40:52,904 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:52" (1/1) ... [2024-11-06 19:40:52,963 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:52" (1/1) ... [2024-11-06 19:40:53,151 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:40:53,151 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:52" (1/1) ... [2024-11-06 19:40:53,152 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:52" (1/1) ... [2024-11-06 19:40:53,248 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:52" (1/1) ... [2024-11-06 19:40:53,280 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:52" (1/1) ... [2024-11-06 19:40:53,336 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:52" (1/1) ... [2024-11-06 19:40:53,357 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:52" (1/1) ... [2024-11-06 19:40:53,425 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:40:53,426 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:40:53,427 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:40:53,427 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:40:53,428 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:52" (1/1) ... [2024-11-06 19:40:53,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:40:53,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:40:53,521 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:40:53,536 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:40:53,582 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:40:53,583 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:40:53,583 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:40:53,583 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:40:53,695 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:40:53,709 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:40:57,758 INFO L? ?]: Removed 702 outVars from TransFormulas that were not future-live. [2024-11-06 19:40:57,758 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:40:57,794 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:40:57,794 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:40:57,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:40:57 BoogieIcfgContainer [2024-11-06 19:40:57,795 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:40:57,797 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:40:57,798 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:40:57,802 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:40:57,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:40:51" (1/3) ... [2024-11-06 19:40:57,803 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:40:57, skipping insertion in model container [2024-11-06 19:40:57,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:40:52" (2/3) ... [2024-11-06 19:40:57,804 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@746790 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:40:57, skipping insertion in model container [2024-11-06 19:40:57,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:40:57" (3/3) ... [2024-11-06 19:40:57,805 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem12_label09.c [2024-11-06 19:40:57,819 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:40:57,819 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:40:57,906 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:40:57,917 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;@6aa23c91, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:40:57,918 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:40:57,927 INFO L276 IsEmpty]: Start isEmpty. Operand has 818 states, 816 states have (on average 1.9178921568627452) internal successors, (1565), 817 states have internal predecessors, (1565), 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:40:57,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2024-11-06 19:40:57,936 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:40:57,938 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:40:57,938 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:40:57,942 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:40:57,943 INFO L85 PathProgramCache]: Analyzing trace with hash -215114758, now seen corresponding path program 1 times [2024-11-06 19:40:57,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:40:57,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102286884] [2024-11-06 19:40:57,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:40:57,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:40:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:40:58,647 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:40:58,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:40:58,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102286884] [2024-11-06 19:40:58,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102286884] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:40:58,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:40:58,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:40:58,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976365252] [2024-11-06 19:40:58,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:40:58,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:40:58,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:40:58,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:40:58,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:40:58,681 INFO L87 Difference]: Start difference. First operand has 818 states, 816 states have (on average 1.9178921568627452) internal successors, (1565), 817 states have internal predecessors, (1565), 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 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 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:41:04,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:41:04,469 INFO L93 Difference]: Finished difference Result 3143 states and 6131 transitions. [2024-11-06 19:41:04,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:41:04,471 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 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 66 [2024-11-06 19:41:04,471 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:41:04,493 INFO L225 Difference]: With dead ends: 3143 [2024-11-06 19:41:04,493 INFO L226 Difference]: Without dead ends: 2257 [2024-11-06 19:41:04,499 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:41:04,501 INFO L432 NwaCegarLoop]: 755 mSDtfsCounter, 2197 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 5311 mSolverCounterSat, 1364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2197 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 6675 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1364 IncrementalHoareTripleChecker+Valid, 5311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:41:04,501 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2197 Valid, 782 Invalid, 6675 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1364 Valid, 5311 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-11-06 19:41:04,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2257 states. [2024-11-06 19:41:04,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2257 to 2257. [2024-11-06 19:41:04,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2257 states, 2256 states have (on average 1.513741134751773) internal successors, (3415), 2256 states have internal predecessors, (3415), 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:41:04,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2257 states to 2257 states and 3415 transitions. [2024-11-06 19:41:04,619 INFO L78 Accepts]: Start accepts. Automaton has 2257 states and 3415 transitions. Word has length 66 [2024-11-06 19:41:04,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:41:04,620 INFO L471 AbstractCegarLoop]: Abstraction has 2257 states and 3415 transitions. [2024-11-06 19:41:04,620 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 16.5) internal successors, (66), 3 states have internal predecessors, (66), 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:41:04,620 INFO L276 IsEmpty]: Start isEmpty. Operand 2257 states and 3415 transitions. [2024-11-06 19:41:04,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-06 19:41:04,624 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:41:04,624 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:41:04,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:41:04,625 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:41:04,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:41:04,625 INFO L85 PathProgramCache]: Analyzing trace with hash 216905129, now seen corresponding path program 1 times [2024-11-06 19:41:04,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:41:04,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991558764] [2024-11-06 19:41:04,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:41:04,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:41:04,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:41:05,110 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 63 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:41:05,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:41:05,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991558764] [2024-11-06 19:41:05,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991558764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:41:05,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:41:05,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:41:05,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511199906] [2024-11-06 19:41:05,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:41:05,114 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:41:05,115 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:41:05,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:41:05,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:41:05,116 INFO L87 Difference]: Start difference. First operand 2257 states and 3415 transitions. Second operand has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 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:41:08,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:41:08,695 INFO L93 Difference]: Finished difference Result 6051 states and 9520 transitions. [2024-11-06 19:41:08,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:41:08,696 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 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 137 [2024-11-06 19:41:08,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:41:08,712 INFO L225 Difference]: With dead ends: 6051 [2024-11-06 19:41:08,712 INFO L226 Difference]: Without dead ends: 3759 [2024-11-06 19:41:08,715 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:41:08,718 INFO L432 NwaCegarLoop]: 693 mSDtfsCounter, 688 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 3804 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 711 SdHoareTripleChecker+Invalid, 4468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 3804 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:41:08,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 711 Invalid, 4468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 3804 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-06 19:41:08,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3759 states. [2024-11-06 19:41:08,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3759 to 3759. [2024-11-06 19:41:08,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3759 states, 3758 states have (on average 1.3304949441192124) internal successors, (5000), 3758 states have internal predecessors, (5000), 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:41:08,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3759 states to 3759 states and 5000 transitions. [2024-11-06 19:41:08,790 INFO L78 Accepts]: Start accepts. Automaton has 3759 states and 5000 transitions. Word has length 137 [2024-11-06 19:41:08,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:41:08,791 INFO L471 AbstractCegarLoop]: Abstraction has 3759 states and 5000 transitions. [2024-11-06 19:41:08,791 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.25) internal successors, (137), 3 states have internal predecessors, (137), 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:41:08,792 INFO L276 IsEmpty]: Start isEmpty. Operand 3759 states and 5000 transitions. [2024-11-06 19:41:08,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2024-11-06 19:41:08,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:41:08,796 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:08,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:41:08,797 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:41:08,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:41:08,797 INFO L85 PathProgramCache]: Analyzing trace with hash 619958633, now seen corresponding path program 1 times [2024-11-06 19:41:08,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:41:08,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916812130] [2024-11-06 19:41:08,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:41:08,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:41:08,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:41:09,335 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-06 19:41:09,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:41:09,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916812130] [2024-11-06 19:41:09,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916812130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:41:09,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:41:09,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:41:09,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697453739] [2024-11-06 19:41:09,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:41:09,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:41:09,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:41:09,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:41:09,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:41:09,341 INFO L87 Difference]: Start difference. First operand 3759 states and 5000 transitions. Second operand has 4 states, 4 states have (on average 52.25) internal successors, (209), 3 states have internal predecessors, (209), 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:41:12,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:41:12,128 INFO L93 Difference]: Finished difference Result 9057 states and 12624 transitions. [2024-11-06 19:41:12,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:41:12,129 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 3 states have internal predecessors, (209), 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 278 [2024-11-06 19:41:12,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:41:12,148 INFO L225 Difference]: With dead ends: 9057 [2024-11-06 19:41:12,148 INFO L226 Difference]: Without dead ends: 5263 [2024-11-06 19:41:12,154 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:41:12,156 INFO L432 NwaCegarLoop]: 309 mSDtfsCounter, 850 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 3408 mSolverCounterSat, 553 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 850 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 3961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 553 IncrementalHoareTripleChecker+Valid, 3408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:41:12,156 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [850 Valid, 324 Invalid, 3961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [553 Valid, 3408 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-06 19:41:12,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5263 states. [2024-11-06 19:41:12,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5263 to 5261. [2024-11-06 19:41:12,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5261 states, 5260 states have (on average 1.3241444866920151) internal successors, (6965), 5260 states have internal predecessors, (6965), 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:41:12,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5261 states to 5261 states and 6965 transitions. [2024-11-06 19:41:12,247 INFO L78 Accepts]: Start accepts. Automaton has 5261 states and 6965 transitions. Word has length 278 [2024-11-06 19:41:12,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:41:12,249 INFO L471 AbstractCegarLoop]: Abstraction has 5261 states and 6965 transitions. [2024-11-06 19:41:12,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.25) internal successors, (209), 3 states have internal predecessors, (209), 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:41:12,249 INFO L276 IsEmpty]: Start isEmpty. Operand 5261 states and 6965 transitions. [2024-11-06 19:41:12,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 293 [2024-11-06 19:41:12,254 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:41:12,254 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:41:12,254 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:41:12,254 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:41:12,255 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:41:12,255 INFO L85 PathProgramCache]: Analyzing trace with hash 1562743686, now seen corresponding path program 1 times [2024-11-06 19:41:12,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:41:12,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372028341] [2024-11-06 19:41:12,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:41:12,255 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:41:12,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:41:12,576 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 211 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:41:12,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:41:12,577 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372028341] [2024-11-06 19:41:12,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372028341] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:41:12,577 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:41:12,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:41:12,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442399475] [2024-11-06 19:41:12,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:41:12,578 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:41:12,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:41:12,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:41:12,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:41:12,579 INFO L87 Difference]: Start difference. First operand 5261 states and 6965 transitions. Second operand has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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:41:15,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:41:15,281 INFO L93 Difference]: Finished difference Result 15026 states and 20134 transitions. [2024-11-06 19:41:15,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:41:15,281 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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 292 [2024-11-06 19:41:15,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:41:15,305 INFO L225 Difference]: With dead ends: 15026 [2024-11-06 19:41:15,305 INFO L226 Difference]: Without dead ends: 9767 [2024-11-06 19:41:15,315 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:41:15,316 INFO L432 NwaCegarLoop]: 1253 mSDtfsCounter, 675 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2630 mSolverCounterSat, 388 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 1261 SdHoareTripleChecker+Invalid, 3018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 388 IncrementalHoareTripleChecker+Valid, 2630 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:41:15,316 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 1261 Invalid, 3018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [388 Valid, 2630 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 19:41:15,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9767 states. [2024-11-06 19:41:15,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9767 to 9767. [2024-11-06 19:41:15,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9767 states, 9766 states have (on average 1.2974605775138235) internal successors, (12671), 9766 states have internal predecessors, (12671), 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:41:15,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9767 states to 9767 states and 12671 transitions. [2024-11-06 19:41:15,499 INFO L78 Accepts]: Start accepts. Automaton has 9767 states and 12671 transitions. Word has length 292 [2024-11-06 19:41:15,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:41:15,500 INFO L471 AbstractCegarLoop]: Abstraction has 9767 states and 12671 transitions. [2024-11-06 19:41:15,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 97.33333333333333) internal successors, (292), 3 states have internal predecessors, (292), 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:41:15,501 INFO L276 IsEmpty]: Start isEmpty. Operand 9767 states and 12671 transitions. [2024-11-06 19:41:15,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2024-11-06 19:41:15,505 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:41:15,506 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:41:15,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:41:15,506 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:41:15,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:41:15,507 INFO L85 PathProgramCache]: Analyzing trace with hash 735833552, now seen corresponding path program 1 times [2024-11-06 19:41:15,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:41:15,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104039533] [2024-11-06 19:41:15,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:41:15,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:41:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:41:15,815 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-06 19:41:15,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:41:15,816 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104039533] [2024-11-06 19:41:15,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2104039533] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:41:15,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:41:15,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:41:15,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899743910] [2024-11-06 19:41:15,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:41:15,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:41:15,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:41:15,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:41:15,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:41:15,819 INFO L87 Difference]: Start difference. First operand 9767 states and 12671 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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:41:18,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:41:18,504 INFO L93 Difference]: Finished difference Result 25540 states and 33979 transitions. [2024-11-06 19:41:18,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:41:18,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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 296 [2024-11-06 19:41:18,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:41:18,545 INFO L225 Difference]: With dead ends: 25540 [2024-11-06 19:41:18,545 INFO L226 Difference]: Without dead ends: 15775 [2024-11-06 19:41:18,554 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:41:18,555 INFO L432 NwaCegarLoop]: 522 mSDtfsCounter, 703 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2275 mSolverCounterSat, 637 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 703 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 2912 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 637 IncrementalHoareTripleChecker+Valid, 2275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:41:18,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [703 Valid, 529 Invalid, 2912 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [637 Valid, 2275 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 19:41:18,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15775 states. [2024-11-06 19:41:18,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15775 to 15775. [2024-11-06 19:41:18,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15775 states, 15774 states have (on average 1.2829339419297578) internal successors, (20237), 15774 states have internal predecessors, (20237), 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:41:18,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15775 states to 15775 states and 20237 transitions. [2024-11-06 19:41:18,831 INFO L78 Accepts]: Start accepts. Automaton has 15775 states and 20237 transitions. Word has length 296 [2024-11-06 19:41:18,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:41:18,832 INFO L471 AbstractCegarLoop]: Abstraction has 15775 states and 20237 transitions. [2024-11-06 19:41:18,832 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 3 states have internal predecessors, (213), 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:41:18,832 INFO L276 IsEmpty]: Start isEmpty. Operand 15775 states and 20237 transitions. [2024-11-06 19:41:18,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 305 [2024-11-06 19:41:18,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:41:18,837 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:41:18,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:41:18,837 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:41:18,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:41:18,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1714844996, now seen corresponding path program 1 times [2024-11-06 19:41:18,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:41:18,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621240035] [2024-11-06 19:41:18,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:41:18,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:41:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:41:19,081 INFO L134 CoverageAnalysis]: Checked inductivity of 219 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-06 19:41:19,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:41:19,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621240035] [2024-11-06 19:41:19,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1621240035] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:41:19,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:41:19,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:41:19,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369552860] [2024-11-06 19:41:19,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:41:19,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:41:19,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:41:19,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:41:19,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:41:19,084 INFO L87 Difference]: Start difference. First operand 15775 states and 20237 transitions. Second operand has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 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:41:21,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:41:21,705 INFO L93 Difference]: Finished difference Result 44315 states and 57482 transitions. [2024-11-06 19:41:21,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:41:21,705 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 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 304 [2024-11-06 19:41:21,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:41:21,768 INFO L225 Difference]: With dead ends: 44315 [2024-11-06 19:41:21,769 INFO L226 Difference]: Without dead ends: 28542 [2024-11-06 19:41:21,786 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:41:21,787 INFO L432 NwaCegarLoop]: 417 mSDtfsCounter, 689 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1967 mSolverCounterSat, 841 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 689 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 2808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 841 IncrementalHoareTripleChecker+Valid, 1967 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:41:21,787 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [689 Valid, 423 Invalid, 2808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [841 Valid, 1967 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 19:41:21,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28542 states. [2024-11-06 19:41:22,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28542 to 25538. [2024-11-06 19:41:22,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25538 states, 25537 states have (on average 1.2187022751302032) internal successors, (31122), 25537 states have internal predecessors, (31122), 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:41:22,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25538 states to 25538 states and 31122 transitions. [2024-11-06 19:41:22,110 INFO L78 Accepts]: Start accepts. Automaton has 25538 states and 31122 transitions. Word has length 304 [2024-11-06 19:41:22,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:41:22,111 INFO L471 AbstractCegarLoop]: Abstraction has 25538 states and 31122 transitions. [2024-11-06 19:41:22,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.0) internal successors, (213), 2 states have internal predecessors, (213), 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:41:22,112 INFO L276 IsEmpty]: Start isEmpty. Operand 25538 states and 31122 transitions. [2024-11-06 19:41:22,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 344 [2024-11-06 19:41:22,117 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:41:22,117 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:41:22,117 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:41:22,117 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:41:22,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:41:22,118 INFO L85 PathProgramCache]: Analyzing trace with hash 1805460738, now seen corresponding path program 1 times [2024-11-06 19:41:22,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:41:22,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1532169249] [2024-11-06 19:41:22,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:41:22,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:41:22,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:41:22,709 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 135 trivial. 0 not checked. [2024-11-06 19:41:22,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:41:22,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1532169249] [2024-11-06 19:41:22,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1532169249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:41:22,713 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:41:22,713 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:41:22,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123079739] [2024-11-06 19:41:22,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:41:22,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:41:22,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:41:22,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:41:22,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:41:22,715 INFO L87 Difference]: Start difference. First operand 25538 states and 31122 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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:41:25,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:41:25,174 INFO L93 Difference]: Finished difference Result 61588 states and 73943 transitions. [2024-11-06 19:41:25,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:41:25,174 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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 343 [2024-11-06 19:41:25,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:41:25,239 INFO L225 Difference]: With dead ends: 61588 [2024-11-06 19:41:25,239 INFO L226 Difference]: Without dead ends: 36052 [2024-11-06 19:41:25,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:41:25,271 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 768 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2318 mSolverCounterSat, 421 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 768 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 2739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 421 IncrementalHoareTripleChecker+Valid, 2318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:41:25,271 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [768 Valid, 209 Invalid, 2739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [421 Valid, 2318 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-06 19:41:25,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36052 states. [2024-11-06 19:41:25,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36052 to 31546. [2024-11-06 19:41:25,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31546 states, 31545 states have (on average 1.1842447297511491) internal successors, (37357), 31545 states have internal predecessors, (37357), 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:41:25,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31546 states to 31546 states and 37357 transitions. [2024-11-06 19:41:25,693 INFO L78 Accepts]: Start accepts. Automaton has 31546 states and 37357 transitions. Word has length 343 [2024-11-06 19:41:25,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:41:25,694 INFO L471 AbstractCegarLoop]: Abstraction has 31546 states and 37357 transitions. [2024-11-06 19:41:25,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 3 states have internal predecessors, (209), 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:41:25,694 INFO L276 IsEmpty]: Start isEmpty. Operand 31546 states and 37357 transitions. [2024-11-06 19:41:25,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 400 [2024-11-06 19:41:25,703 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:41:25,703 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-06 19:41:25,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:41:25,703 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:41:25,704 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:41:25,704 INFO L85 PathProgramCache]: Analyzing trace with hash -1248766331, now seen corresponding path program 1 times [2024-11-06 19:41:25,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:41:25,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658459758] [2024-11-06 19:41:25,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:41:25,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:41:25,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:41:26,006 INFO L134 CoverageAnalysis]: Checked inductivity of 456 backedges. 378 proven. 0 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2024-11-06 19:41:26,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:41:26,008 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658459758] [2024-11-06 19:41:26,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658459758] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:41:26,008 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:41:26,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:41:26,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2044665273] [2024-11-06 19:41:26,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:41:26,009 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:41:26,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:41:26,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:41:26,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:41:26,010 INFO L87 Difference]: Start difference. First operand 31546 states and 37357 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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:41:28,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:41:28,498 INFO L93 Difference]: Finished difference Result 78861 states and 93956 transitions. [2024-11-06 19:41:28,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:41:28,499 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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 399 [2024-11-06 19:41:28,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:41:28,579 INFO L225 Difference]: With dead ends: 78861 [2024-11-06 19:41:28,579 INFO L226 Difference]: Without dead ends: 47317 [2024-11-06 19:41:28,606 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:41:28,607 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 669 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2442 mSolverCounterSat, 462 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 669 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 2904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 462 IncrementalHoareTripleChecker+Valid, 2442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:41:28,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [669 Valid, 296 Invalid, 2904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [462 Valid, 2442 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-06 19:41:28,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47317 states. [2024-11-06 19:41:28,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47317 to 46566. [2024-11-06 19:41:29,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46566 states, 46565 states have (on average 1.1781595619027165) internal successors, (54861), 46565 states have internal predecessors, (54861), 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:41:29,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46566 states to 46566 states and 54861 transitions. [2024-11-06 19:41:29,076 INFO L78 Accepts]: Start accepts. Automaton has 46566 states and 54861 transitions. Word has length 399 [2024-11-06 19:41:29,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:41:29,077 INFO L471 AbstractCegarLoop]: Abstraction has 46566 states and 54861 transitions. [2024-11-06 19:41:29,077 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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:41:29,077 INFO L276 IsEmpty]: Start isEmpty. Operand 46566 states and 54861 transitions. [2024-11-06 19:41:29,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2024-11-06 19:41:29,083 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:41:29,084 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:29,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:41:29,084 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:41:29,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:41:29,085 INFO L85 PathProgramCache]: Analyzing trace with hash 508886644, now seen corresponding path program 1 times [2024-11-06 19:41:29,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:41:29,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452503994] [2024-11-06 19:41:29,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:41:29,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:41:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:41:29,415 INFO L134 CoverageAnalysis]: Checked inductivity of 468 backedges. 384 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-06 19:41:29,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:41:29,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452503994] [2024-11-06 19:41:29,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452503994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:41:29,415 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:41:29,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:41:29,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [635745044] [2024-11-06 19:41:29,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:41:29,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:41:29,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:41:29,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:41:29,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:41:29,417 INFO L87 Difference]: Start difference. First operand 46566 states and 54861 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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:41:32,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:41:32,406 INFO L93 Difference]: Finished difference Result 112656 states and 134696 transitions. [2024-11-06 19:41:32,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:41:32,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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 405 [2024-11-06 19:41:32,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:41:32,501 INFO L225 Difference]: With dead ends: 112656 [2024-11-06 19:41:32,501 INFO L226 Difference]: Without dead ends: 66092 [2024-11-06 19:41:32,529 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:41:32,530 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 746 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2083 mSolverCounterSat, 803 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 746 SdHoareTripleChecker+Valid, 269 SdHoareTripleChecker+Invalid, 2886 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 803 IncrementalHoareTripleChecker+Valid, 2083 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:41:32,530 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [746 Valid, 269 Invalid, 2886 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [803 Valid, 2083 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-06 19:41:32,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66092 states. [2024-11-06 19:41:33,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66092 to 66092. [2024-11-06 19:41:33,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66092 states, 66091 states have (on average 1.1665279690124222) internal successors, (77097), 66091 states have internal predecessors, (77097), 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:41:33,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66092 states to 66092 states and 77097 transitions. [2024-11-06 19:41:33,255 INFO L78 Accepts]: Start accepts. Automaton has 66092 states and 77097 transitions. Word has length 405 [2024-11-06 19:41:33,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:41:33,257 INFO L471 AbstractCegarLoop]: Abstraction has 66092 states and 77097 transitions. [2024-11-06 19:41:33,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 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:41:33,257 INFO L276 IsEmpty]: Start isEmpty. Operand 66092 states and 77097 transitions. [2024-11-06 19:41:33,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 422 [2024-11-06 19:41:33,263 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:41:33,264 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:33,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 19:41:33,265 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:41:33,269 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:41:33,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1238970092, now seen corresponding path program 1 times [2024-11-06 19:41:33,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:41:33,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361792965] [2024-11-06 19:41:33,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:41:33,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:41:33,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:41:33,498 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 376 proven. 0 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-06 19:41:33,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:41:33,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361792965] [2024-11-06 19:41:33,498 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361792965] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:41:33,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:41:33,499 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:41:33,499 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455035628] [2024-11-06 19:41:33,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:41:33,499 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:41:33,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:41:33,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:41:33,500 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:41:33,500 INFO L87 Difference]: Start difference. First operand 66092 states and 77097 transitions. Second operand has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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:41:36,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:41:36,050 INFO L93 Difference]: Finished difference Result 150957 states and 178229 transitions. [2024-11-06 19:41:36,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:41:36,051 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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 421 [2024-11-06 19:41:36,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:41:36,149 INFO L225 Difference]: With dead ends: 150957 [2024-11-06 19:41:36,150 INFO L226 Difference]: Without dead ends: 84867 [2024-11-06 19:41:36,202 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:41:36,206 INFO L432 NwaCegarLoop]: 1274 mSDtfsCounter, 673 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2233 mSolverCounterSat, 446 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 673 SdHoareTripleChecker+Valid, 1282 SdHoareTripleChecker+Invalid, 2679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 446 IncrementalHoareTripleChecker+Valid, 2233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:41:36,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [673 Valid, 1282 Invalid, 2679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [446 Valid, 2233 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-06 19:41:36,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84867 states. [2024-11-06 19:41:36,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84867 to 84867. [2024-11-06 19:41:36,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84867 states, 84866 states have (on average 1.1465486767374449) internal successors, (97303), 84866 states have internal predecessors, (97303), 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:41:37,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84867 states to 84867 states and 97303 transitions. [2024-11-06 19:41:37,003 INFO L78 Accepts]: Start accepts. Automaton has 84867 states and 97303 transitions. Word has length 421 [2024-11-06 19:41:37,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:41:37,003 INFO L471 AbstractCegarLoop]: Abstraction has 84867 states and 97303 transitions. [2024-11-06 19:41:37,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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:41:37,004 INFO L276 IsEmpty]: Start isEmpty. Operand 84867 states and 97303 transitions. [2024-11-06 19:41:37,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2024-11-06 19:41:37,009 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:41:37,010 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:41:37,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:41:37,010 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:41:37,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:41:37,011 INFO L85 PathProgramCache]: Analyzing trace with hash -2134049438, now seen corresponding path program 1 times [2024-11-06 19:41:37,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:41:37,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70497703] [2024-11-06 19:41:37,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:41:37,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:41:37,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:41:37,775 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 285 proven. 99 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2024-11-06 19:41:37,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:41:37,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70497703] [2024-11-06 19:41:37,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70497703] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:41:37,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384107788] [2024-11-06 19:41:37,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:41:37,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:41:37,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:41:37,780 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:41:37,781 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:41:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:41:37,940 INFO L255 TraceCheckSpWp]: Trace formula consists of 551 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:41:38,033 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:41:38,162 INFO L134 CoverageAnalysis]: Checked inductivity of 500 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 309 trivial. 0 not checked. [2024-11-06 19:41:38,163 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:41:38,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384107788] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:41:38,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:41:38,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-06 19:41:38,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251300331] [2024-11-06 19:41:38,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:41:38,164 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:41:38,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:41:38,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:41:38,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:41:38,165 INFO L87 Difference]: Start difference. First operand 84867 states and 97303 transitions. Second operand has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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:41:41,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:41:41,043 INFO L93 Difference]: Finished difference Result 169732 states and 194604 transitions. [2024-11-06 19:41:41,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:41:41,043 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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 425 [2024-11-06 19:41:41,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:41:41,139 INFO L225 Difference]: With dead ends: 169732 [2024-11-06 19:41:41,139 INFO L226 Difference]: Without dead ends: 84867 [2024-11-06 19:41:41,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 431 GetRequests, 424 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:41:41,193 INFO L432 NwaCegarLoop]: 1183 mSDtfsCounter, 718 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2403 mSolverCounterSat, 508 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 718 SdHoareTripleChecker+Valid, 1191 SdHoareTripleChecker+Invalid, 2911 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 508 IncrementalHoareTripleChecker+Valid, 2403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:41:41,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [718 Valid, 1191 Invalid, 2911 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [508 Valid, 2403 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 19:41:41,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84867 states. [2024-11-06 19:41:41,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84867 to 84116. [2024-11-06 19:41:42,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84116 states, 84115 states have (on average 1.1274207929620164) internal successors, (94833), 84115 states have internal predecessors, (94833), 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:41:42,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84116 states to 84116 states and 94833 transitions. [2024-11-06 19:41:42,118 INFO L78 Accepts]: Start accepts. Automaton has 84116 states and 94833 transitions. Word has length 425 [2024-11-06 19:41:42,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:41:42,119 INFO L471 AbstractCegarLoop]: Abstraction has 84116 states and 94833 transitions. [2024-11-06 19:41:42,119 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.33333333333333) internal successors, (214), 3 states have internal predecessors, (214), 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:41:42,119 INFO L276 IsEmpty]: Start isEmpty. Operand 84116 states and 94833 transitions. [2024-11-06 19:41:42,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 541 [2024-11-06 19:41:42,132 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:41:42,132 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:41:42,145 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 19:41:42,333 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-06 19:41:42,333 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:41:42,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:41:42,334 INFO L85 PathProgramCache]: Analyzing trace with hash -1388120569, now seen corresponding path program 1 times [2024-11-06 19:41:42,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:41:42,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49020488] [2024-11-06 19:41:42,334 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:41:42,334 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:41:42,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:41:42,777 INFO L134 CoverageAnalysis]: Checked inductivity of 836 backedges. 583 proven. 0 refuted. 0 times theorem prover too weak. 253 trivial. 0 not checked. [2024-11-06 19:41:42,777 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:41:42,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49020488] [2024-11-06 19:41:42,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49020488] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:41:42,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:41:42,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:41:42,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534540072] [2024-11-06 19:41:42,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:41:42,779 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:41:42,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:41:42,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:41:42,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:41:42,780 INFO L87 Difference]: Start difference. First operand 84116 states and 94833 transitions. Second operand has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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:41:45,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:41:45,516 INFO L93 Difference]: Finished difference Result 210286 states and 236285 transitions. [2024-11-06 19:41:45,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:41:45,517 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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 540 [2024-11-06 19:41:45,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:41:45,642 INFO L225 Difference]: With dead ends: 210286 [2024-11-06 19:41:45,642 INFO L226 Difference]: Without dead ends: 120915 [2024-11-06 19:41:45,687 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:41:45,688 INFO L432 NwaCegarLoop]: 1302 mSDtfsCounter, 648 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2225 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 1310 SdHoareTripleChecker+Invalid, 2642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 2225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:41:45,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [648 Valid, 1310 Invalid, 2642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 2225 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-06 19:41:45,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120915 states. [2024-11-06 19:41:46,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120915 to 117911. [2024-11-06 19:41:46,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117911 states, 117910 states have (on average 1.1057331863285558) internal successors, (130377), 117910 states have internal predecessors, (130377), 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:41:47,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117911 states to 117911 states and 130377 transitions. [2024-11-06 19:41:47,055 INFO L78 Accepts]: Start accepts. Automaton has 117911 states and 130377 transitions. Word has length 540 [2024-11-06 19:41:47,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:41:47,055 INFO L471 AbstractCegarLoop]: Abstraction has 117911 states and 130377 transitions. [2024-11-06 19:41:47,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 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:41:47,055 INFO L276 IsEmpty]: Start isEmpty. Operand 117911 states and 130377 transitions. [2024-11-06 19:41:47,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 569 [2024-11-06 19:41:47,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:41:47,068 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:41:47,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:41:47,069 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:41:47,069 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:41:47,069 INFO L85 PathProgramCache]: Analyzing trace with hash 50672567, now seen corresponding path program 1 times [2024-11-06 19:41:47,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:41:47,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511324432] [2024-11-06 19:41:47,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:41:47,069 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:41:47,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:41:48,146 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 577 proven. 229 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-06 19:41:48,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:41:48,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511324432] [2024-11-06 19:41:48,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511324432] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:41:48,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2095848064] [2024-11-06 19:41:48,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:41:48,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:41:48,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:41:48,149 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:41:48,151 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:41:48,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:41:48,333 INFO L255 TraceCheckSpWp]: Trace formula consists of 721 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:41:48,342 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:41:48,496 INFO L134 CoverageAnalysis]: Checked inductivity of 870 backedges. 557 proven. 0 refuted. 0 times theorem prover too weak. 313 trivial. 0 not checked. [2024-11-06 19:41:48,496 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:41:48,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2095848064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:41:48,496 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:41:48,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-06 19:41:48,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598340318] [2024-11-06 19:41:48,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:41:48,497 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:41:48,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:41:48,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:41:48,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:41:48,498 INFO L87 Difference]: Start difference. First operand 117911 states and 130377 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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:41:51,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:41:51,391 INFO L93 Difference]: Finished difference Result 235069 states and 259996 transitions. [2024-11-06 19:41:51,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:41:51,391 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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 568 [2024-11-06 19:41:51,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:41:51,525 INFO L225 Difference]: With dead ends: 235069 [2024-11-06 19:41:51,525 INFO L226 Difference]: Without dead ends: 117911 [2024-11-06 19:41:51,577 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 572 GetRequests, 567 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:41:51,577 INFO L432 NwaCegarLoop]: 1294 mSDtfsCounter, 680 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2082 mSolverCounterSat, 544 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1302 SdHoareTripleChecker+Invalid, 2626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 544 IncrementalHoareTripleChecker+Valid, 2082 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:41:51,578 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1302 Invalid, 2626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [544 Valid, 2082 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 19:41:51,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117911 states. [2024-11-06 19:41:52,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117911 to 113405. [2024-11-06 19:41:52,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113405 states, 113404 states have (on average 1.0715759585199816) internal successors, (121521), 113404 states have internal predecessors, (121521), 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:41:52,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113405 states to 113405 states and 121521 transitions. [2024-11-06 19:41:52,701 INFO L78 Accepts]: Start accepts. Automaton has 113405 states and 121521 transitions. Word has length 568 [2024-11-06 19:41:52,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:41:52,701 INFO L471 AbstractCegarLoop]: Abstraction has 113405 states and 121521 transitions. [2024-11-06 19:41:52,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 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:41:52,701 INFO L276 IsEmpty]: Start isEmpty. Operand 113405 states and 121521 transitions. [2024-11-06 19:41:52,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 597 [2024-11-06 19:41:52,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:41:52,715 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 2, 2, 2, 2, 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] [2024-11-06 19:41:52,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-06 19:41:52,915 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:41:52,915 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:41:52,916 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:41:52,916 INFO L85 PathProgramCache]: Analyzing trace with hash -877566435, now seen corresponding path program 1 times [2024-11-06 19:41:52,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:41:52,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1539057092] [2024-11-06 19:41:52,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:41:52,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:41:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:41:53,422 INFO L134 CoverageAnalysis]: Checked inductivity of 958 backedges. 733 proven. 0 refuted. 0 times theorem prover too weak. 225 trivial. 0 not checked. [2024-11-06 19:41:53,422 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:41:53,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1539057092] [2024-11-06 19:41:53,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1539057092] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:41:53,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:41:53,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:41:53,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630289496] [2024-11-06 19:41:53,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:41:53,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:41:53,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:41:53,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:41:53,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:41:53,425 INFO L87 Difference]: Start difference. First operand 113405 states and 121521 transitions. Second operand has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 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:41:56,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:41:56,342 INFO L93 Difference]: Finished difference Result 230563 states and 246877 transitions. [2024-11-06 19:41:56,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:41:56,343 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 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 596 [2024-11-06 19:41:56,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:41:56,474 INFO L225 Difference]: With dead ends: 230563 [2024-11-06 19:41:56,474 INFO L226 Difference]: Without dead ends: 117911 [2024-11-06 19:41:56,521 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:41:56,521 INFO L432 NwaCegarLoop]: 1175 mSDtfsCounter, 680 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 2074 mSolverCounterSat, 591 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 680 SdHoareTripleChecker+Valid, 1182 SdHoareTripleChecker+Invalid, 2665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 591 IncrementalHoareTripleChecker+Valid, 2074 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:41:56,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [680 Valid, 1182 Invalid, 2665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [591 Valid, 2074 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 19:41:56,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117911 states. [2024-11-06 19:41:57,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117911 to 109650. [2024-11-06 19:41:57,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109650 states, 109649 states have (on average 1.0510173371394176) internal successors, (115243), 109649 states have internal predecessors, (115243), 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:41:57,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109650 states to 109650 states and 115243 transitions. [2024-11-06 19:41:57,725 INFO L78 Accepts]: Start accepts. Automaton has 109650 states and 115243 transitions. Word has length 596 [2024-11-06 19:41:57,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:41:57,726 INFO L471 AbstractCegarLoop]: Abstraction has 109650 states and 115243 transitions. [2024-11-06 19:41:57,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.33333333333333) internal successors, (373), 3 states have internal predecessors, (373), 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:41:57,726 INFO L276 IsEmpty]: Start isEmpty. Operand 109650 states and 115243 transitions. [2024-11-06 19:41:57,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 645 [2024-11-06 19:41:57,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:41:57,742 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:41:57,742 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 19:41:57,742 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:41:57,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:41:57,742 INFO L85 PathProgramCache]: Analyzing trace with hash 28685963, now seen corresponding path program 1 times [2024-11-06 19:41:57,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:41:57,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113248583] [2024-11-06 19:41:57,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:41:57,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:41:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:41:57,925 INFO L134 CoverageAnalysis]: Checked inductivity of 1034 backedges. 255 proven. 0 refuted. 0 times theorem prover too weak. 779 trivial. 0 not checked. [2024-11-06 19:41:57,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:41:57,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113248583] [2024-11-06 19:41:57,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113248583] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:41:57,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:41:57,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:41:57,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [929761188] [2024-11-06 19:41:57,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:41:57,926 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:41:57,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:41:57,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:41:57,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:41:57,926 INFO L87 Difference]: Start difference. First operand 109650 states and 115243 transitions. Second operand has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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:42:00,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:42:00,708 INFO L93 Difference]: Finished difference Result 238073 states and 250780 transitions. [2024-11-06 19:42:00,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:42:00,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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 644 [2024-11-06 19:42:00,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:42:00,851 INFO L225 Difference]: With dead ends: 238073 [2024-11-06 19:42:00,851 INFO L226 Difference]: Without dead ends: 129176 [2024-11-06 19:42:00,895 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:42:00,896 INFO L432 NwaCegarLoop]: 1109 mSDtfsCounter, 808 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 2160 mSolverCounterSat, 389 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 808 SdHoareTripleChecker+Valid, 1117 SdHoareTripleChecker+Invalid, 2549 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 389 IncrementalHoareTripleChecker+Valid, 2160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:42:00,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [808 Valid, 1117 Invalid, 2549 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [389 Valid, 2160 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-06 19:42:00,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129176 states. [2024-11-06 19:42:02,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129176 to 128425. [2024-11-06 19:42:02,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128425 states, 128424 states have (on average 1.048347660873357) internal successors, (134633), 128424 states have internal predecessors, (134633), 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:42:02,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128425 states to 128425 states and 134633 transitions. [2024-11-06 19:42:02,596 INFO L78 Accepts]: Start accepts. Automaton has 128425 states and 134633 transitions. Word has length 644 [2024-11-06 19:42:02,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:42:02,597 INFO L471 AbstractCegarLoop]: Abstraction has 128425 states and 134633 transitions. [2024-11-06 19:42:02,597 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.0) internal successors, (243), 3 states have internal predecessors, (243), 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:42:02,597 INFO L276 IsEmpty]: Start isEmpty. Operand 128425 states and 134633 transitions. [2024-11-06 19:42:02,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 971 [2024-11-06 19:42:02,649 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:42:02,650 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:42:02,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 19:42:02,650 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:42:02,651 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:42:02,651 INFO L85 PathProgramCache]: Analyzing trace with hash 588519551, now seen corresponding path program 1 times [2024-11-06 19:42:02,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:42:02,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650526019] [2024-11-06 19:42:02,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:42:02,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:42:02,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:42:05,362 INFO L134 CoverageAnalysis]: Checked inductivity of 1066 backedges. 811 proven. 255 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:42:05,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:42:05,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650526019] [2024-11-06 19:42:05,362 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650526019] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:42:05,362 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792049286] [2024-11-06 19:42:05,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:42:05,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:42:05,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:42:05,366 INFO L229 MonitoredProcess]: Starting monitored process 4 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:42:05,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 19:42:05,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:42:05,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 1131 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-06 19:42:05,611 INFO L278 TraceCheckSpWp]: Computing forward predicates...