./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem17_label14.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/Problem17_label14.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', '0ac429ca8e99b6512d8aadb8f8e502aadaca92db9137fa23838c552f61d5f382'] 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/Problem17_label14.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 0ac429ca8e99b6512d8aadb8f8e502aadaca92db9137fa23838c552f61d5f382 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 20:05:21,161 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 20:05:21,255 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 20:05:21,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 20:05:21,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 20:05:21,288 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 20:05:21,290 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 20:05:21,290 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 20:05:21,290 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 20:05:21,291 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 20:05:21,291 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 20:05:21,291 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 20:05:21,292 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 20:05:21,292 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 20:05:21,292 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 20:05:21,292 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 20:05:21,292 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 20:05:21,292 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 20:05:21,293 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 20:05:21,293 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 20:05:21,293 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 20:05:21,293 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 20:05:21,293 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 20:05:21,293 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 20:05:21,293 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 20:05:21,293 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 20:05:21,293 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 20:05:21,293 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 20:05:21,293 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 20:05:21,293 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 20:05:21,293 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 20:05:21,294 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 20:05:21,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:05:21,294 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 20:05:21,294 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 20:05:21,294 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 20:05:21,294 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 20:05:21,294 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 20:05:21,294 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 20:05:21,294 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 20:05:21,294 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 20:05:21,294 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 20:05:21,294 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 -> 0ac429ca8e99b6512d8aadb8f8e502aadaca92db9137fa23838c552f61d5f382 [2024-11-06 20:05:21,578 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 20:05:21,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 20:05:21,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 20:05:21,590 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 20:05:21,590 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 20:05:21,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem17_label14.c [2024-11-06 20:05:22,845 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 20:05:23,230 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 20:05:23,232 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem17_label14.c [2024-11-06 20:05:23,254 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f9fc1660/b944c05502f94098b9ce2c09f5b8faab/FLAG5e9a7a9d5 [2024-11-06 20:05:23,409 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5f9fc1660/b944c05502f94098b9ce2c09f5b8faab [2024-11-06 20:05:23,412 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 20:05:23,413 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 20:05:23,414 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 20:05:23,414 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 20:05:23,417 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 20:05:23,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:05:23" (1/1) ... [2024-11-06 20:05:23,418 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37c45b78 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:23, skipping insertion in model container [2024-11-06 20:05:23,418 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:05:23" (1/1) ... [2024-11-06 20:05:23,508 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 20:05:23,693 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/Problem17_label14.c[6990,7003] [2024-11-06 20:05:24,088 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:05:24,097 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 20:05:24,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/Problem17_label14.c[6990,7003] [2024-11-06 20:05:24,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:05:24,367 INFO L204 MainTranslator]: Completed translation [2024-11-06 20:05:24,368 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:24 WrapperNode [2024-11-06 20:05:24,368 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 20:05:24,369 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 20:05:24,370 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 20:05:24,370 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 20:05:24,375 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:24" (1/1) ... [2024-11-06 20:05:24,406 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:24" (1/1) ... [2024-11-06 20:05:24,767 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 2613 [2024-11-06 20:05:24,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 20:05:24,769 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 20:05:24,769 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 20:05:24,769 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 20:05:24,778 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:24" (1/1) ... [2024-11-06 20:05:24,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:24" (1/1) ... [2024-11-06 20:05:24,824 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:24" (1/1) ... [2024-11-06 20:05:24,996 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 20:05:24,997 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:24" (1/1) ... [2024-11-06 20:05:24,997 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:24" (1/1) ... [2024-11-06 20:05:25,101 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:24" (1/1) ... [2024-11-06 20:05:25,128 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:24" (1/1) ... [2024-11-06 20:05:25,156 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:24" (1/1) ... [2024-11-06 20:05:25,171 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:24" (1/1) ... [2024-11-06 20:05:25,220 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 20:05:25,221 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 20:05:25,222 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 20:05:25,222 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 20:05:25,223 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:24" (1/1) ... [2024-11-06 20:05:25,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:05:25,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:05:25,260 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 20:05:25,278 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 20:05:25,322 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 20:05:25,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 20:05:25,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 20:05:25,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 20:05:25,414 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 20:05:25,416 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 20:05:28,987 INFO L? ?]: Removed 372 outVars from TransFormulas that were not future-live. [2024-11-06 20:05:28,988 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 20:05:29,023 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 20:05:29,024 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 20:05:29,024 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:05:29 BoogieIcfgContainer [2024-11-06 20:05:29,024 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 20:05:29,029 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 20:05:29,029 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 20:05:29,034 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 20:05:29,035 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:05:23" (1/3) ... [2024-11-06 20:05:29,036 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96c4393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:05:29, skipping insertion in model container [2024-11-06 20:05:29,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:05:24" (2/3) ... [2024-11-06 20:05:29,037 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@96c4393 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:05:29, skipping insertion in model container [2024-11-06 20:05:29,037 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:05:29" (3/3) ... [2024-11-06 20:05:29,039 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem17_label14.c [2024-11-06 20:05:29,055 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 20:05:29,055 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 20:05:29,168 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 20:05:29,179 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;@2bd8ab17, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 20:05:29,180 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 20:05:29,186 INFO L276 IsEmpty]: Start isEmpty. Operand has 590 states, 588 states have (on average 1.8061224489795917) internal successors, (1062), 589 states have internal predecessors, (1062), 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 20:05:29,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2024-11-06 20:05:29,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:29,195 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] [2024-11-06 20:05:29,195 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:29,199 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:29,199 INFO L85 PathProgramCache]: Analyzing trace with hash 433832817, now seen corresponding path program 1 times [2024-11-06 20:05:29,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:29,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217929582] [2024-11-06 20:05:29,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:29,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:29,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:29,550 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 20:05:29,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:29,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217929582] [2024-11-06 20:05:29,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217929582] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:05:29,553 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:05:29,553 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:05:29,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752220115] [2024-11-06 20:05:29,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:29,562 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:05:29,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:29,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:05:29,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:05:29,587 INFO L87 Difference]: Start difference. First operand has 590 states, 588 states have (on average 1.8061224489795917) internal successors, (1062), 589 states have internal predecessors, (1062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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 20:05:32,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:32,217 INFO L93 Difference]: Finished difference Result 1642 states and 3024 transitions. [2024-11-06 20:05:32,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:05:32,220 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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 47 [2024-11-06 20:05:32,221 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:32,242 INFO L225 Difference]: With dead ends: 1642 [2024-11-06 20:05:32,244 INFO L226 Difference]: Without dead ends: 975 [2024-11-06 20:05:32,253 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 20:05:32,256 INFO L432 NwaCegarLoop]: 474 mSDtfsCounter, 443 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 1413 mSolverCounterSat, 372 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 1785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 372 IncrementalHoareTripleChecker+Valid, 1413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:32,259 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 550 Invalid, 1785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [372 Valid, 1413 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 20:05:32,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 975 states. [2024-11-06 20:05:32,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 975 to 972. [2024-11-06 20:05:32,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 971 states have (on average 1.5077239958805355) internal successors, (1464), 971 states have internal predecessors, (1464), 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 20:05:32,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1464 transitions. [2024-11-06 20:05:32,345 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1464 transitions. Word has length 47 [2024-11-06 20:05:32,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:32,346 INFO L471 AbstractCegarLoop]: Abstraction has 972 states and 1464 transitions. [2024-11-06 20:05:32,346 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 2 states have internal predecessors, (47), 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 20:05:32,346 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1464 transitions. [2024-11-06 20:05:32,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-06 20:05:32,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:32,350 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, 1, 1, 1, 1, 1, 1, 1, 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 20:05:32,350 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 20:05:32,350 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:32,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:32,351 INFO L85 PathProgramCache]: Analyzing trace with hash -220367068, now seen corresponding path program 1 times [2024-11-06 20:05:32,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:32,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [335157892] [2024-11-06 20:05:32,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:32,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:32,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:32,621 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:05:32,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:32,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [335157892] [2024-11-06 20:05:32,622 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [335157892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:05:32,622 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:05:32,622 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:05:32,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1044853458] [2024-11-06 20:05:32,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:32,623 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:05:32,623 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:32,624 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:05:32,624 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:05:32,627 INFO L87 Difference]: Start difference. First operand 972 states and 1464 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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 20:05:34,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:34,637 INFO L93 Difference]: Finished difference Result 2814 states and 4242 transitions. [2024-11-06 20:05:34,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:05:34,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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 117 [2024-11-06 20:05:34,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:34,647 INFO L225 Difference]: With dead ends: 2814 [2024-11-06 20:05:34,647 INFO L226 Difference]: Without dead ends: 1844 [2024-11-06 20:05:34,649 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 20:05:34,649 INFO L432 NwaCegarLoop]: 853 mSDtfsCounter, 444 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 1283 mSolverCounterSat, 414 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 444 SdHoareTripleChecker+Valid, 921 SdHoareTripleChecker+Invalid, 1697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 414 IncrementalHoareTripleChecker+Valid, 1283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:34,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [444 Valid, 921 Invalid, 1697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [414 Valid, 1283 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-06 20:05:34,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2024-11-06 20:05:34,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1842. [2024-11-06 20:05:34,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1842 states, 1841 states have (on average 1.3601303639326452) internal successors, (2504), 1841 states have internal predecessors, (2504), 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 20:05:34,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1842 states to 1842 states and 2504 transitions. [2024-11-06 20:05:34,699 INFO L78 Accepts]: Start accepts. Automaton has 1842 states and 2504 transitions. Word has length 117 [2024-11-06 20:05:34,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:34,702 INFO L471 AbstractCegarLoop]: Abstraction has 1842 states and 2504 transitions. [2024-11-06 20:05:34,703 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 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 20:05:34,703 INFO L276 IsEmpty]: Start isEmpty. Operand 1842 states and 2504 transitions. [2024-11-06 20:05:34,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2024-11-06 20:05:34,705 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:34,706 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:05:34,706 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 20:05:34,706 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:34,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:34,706 INFO L85 PathProgramCache]: Analyzing trace with hash 1980465569, now seen corresponding path program 1 times [2024-11-06 20:05:34,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:34,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048225499] [2024-11-06 20:05:34,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:34,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:34,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:34,924 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:05:34,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:34,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048225499] [2024-11-06 20:05:34,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048225499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:05:34,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:05:34,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:05:34,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276888107] [2024-11-06 20:05:34,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:34,925 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:05:34,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:34,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:05:34,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:05:34,926 INFO L87 Difference]: Start difference. First operand 1842 states and 2504 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 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 20:05:37,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:37,053 INFO L93 Difference]: Finished difference Result 5395 states and 7326 transitions. [2024-11-06 20:05:37,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:05:37,054 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 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 139 [2024-11-06 20:05:37,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:37,065 INFO L225 Difference]: With dead ends: 5395 [2024-11-06 20:05:37,065 INFO L226 Difference]: Without dead ends: 2701 [2024-11-06 20:05:37,069 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 20:05:37,070 INFO L432 NwaCegarLoop]: 516 mSDtfsCounter, 368 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 1081 mSolverCounterSat, 548 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 1629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 548 IncrementalHoareTripleChecker+Valid, 1081 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:37,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 591 Invalid, 1629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [548 Valid, 1081 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-11-06 20:05:37,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2701 states. [2024-11-06 20:05:37,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2701 to 2701. [2024-11-06 20:05:37,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2701 states, 2700 states have (on average 1.191851851851852) internal successors, (3218), 2700 states have internal predecessors, (3218), 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 20:05:37,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2701 states to 2701 states and 3218 transitions. [2024-11-06 20:05:37,121 INFO L78 Accepts]: Start accepts. Automaton has 2701 states and 3218 transitions. Word has length 139 [2024-11-06 20:05:37,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:37,122 INFO L471 AbstractCegarLoop]: Abstraction has 2701 states and 3218 transitions. [2024-11-06 20:05:37,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) internal successors, (139), 2 states have internal predecessors, (139), 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 20:05:37,123 INFO L276 IsEmpty]: Start isEmpty. Operand 2701 states and 3218 transitions. [2024-11-06 20:05:37,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-06 20:05:37,129 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:37,129 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:05:37,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 20:05:37,130 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:37,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:37,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1103271090, now seen corresponding path program 1 times [2024-11-06 20:05:37,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:37,130 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022114071] [2024-11-06 20:05:37,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:37,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:37,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:37,599 INFO L134 CoverageAnalysis]: Checked inductivity of 157 backedges. 157 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:05:37,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:37,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022114071] [2024-11-06 20:05:37,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022114071] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:05:37,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:05:37,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:05:37,602 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815272256] [2024-11-06 20:05:37,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:37,603 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:05:37,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:37,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:05:37,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:05:37,604 INFO L87 Difference]: Start difference. First operand 2701 states and 3218 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 20:05:38,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:38,999 INFO L93 Difference]: Finished difference Result 7108 states and 8598 transitions. [2024-11-06 20:05:38,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:05:39,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 199 [2024-11-06 20:05:39,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:39,015 INFO L225 Difference]: With dead ends: 7108 [2024-11-06 20:05:39,015 INFO L226 Difference]: Without dead ends: 4409 [2024-11-06 20:05:39,019 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 20:05:39,020 INFO L432 NwaCegarLoop]: 726 mSDtfsCounter, 496 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 1136 mSolverCounterSat, 306 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 496 SdHoareTripleChecker+Valid, 784 SdHoareTripleChecker+Invalid, 1442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 306 IncrementalHoareTripleChecker+Valid, 1136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:39,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [496 Valid, 784 Invalid, 1442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [306 Valid, 1136 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 20:05:39,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4409 states. [2024-11-06 20:05:39,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4409 to 4409. [2024-11-06 20:05:39,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4409 states, 4408 states have (on average 1.1705989110707804) internal successors, (5160), 4408 states have internal predecessors, (5160), 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 20:05:39,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4409 states to 4409 states and 5160 transitions. [2024-11-06 20:05:39,095 INFO L78 Accepts]: Start accepts. Automaton has 4409 states and 5160 transitions. Word has length 199 [2024-11-06 20:05:39,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:39,095 INFO L471 AbstractCegarLoop]: Abstraction has 4409 states and 5160 transitions. [2024-11-06 20:05:39,096 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 20:05:39,096 INFO L276 IsEmpty]: Start isEmpty. Operand 4409 states and 5160 transitions. [2024-11-06 20:05:39,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-06 20:05:39,098 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:39,098 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, 2, 2, 2, 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] [2024-11-06 20:05:39,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 20:05:39,099 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:39,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:39,099 INFO L85 PathProgramCache]: Analyzing trace with hash 814886771, now seen corresponding path program 1 times [2024-11-06 20:05:39,099 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:39,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554021473] [2024-11-06 20:05:39,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:39,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:39,285 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-06 20:05:39,286 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:39,286 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554021473] [2024-11-06 20:05:39,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554021473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:05:39,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:05:39,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:05:39,287 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761349763] [2024-11-06 20:05:39,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:39,287 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:05:39,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:39,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:05:39,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:05:39,289 INFO L87 Difference]: Start difference. First operand 4409 states and 5160 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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 20:05:40,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:40,928 INFO L93 Difference]: Finished difference Result 10936 states and 12970 transitions. [2024-11-06 20:05:40,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:05:40,928 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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 201 [2024-11-06 20:05:40,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:40,947 INFO L225 Difference]: With dead ends: 10936 [2024-11-06 20:05:40,947 INFO L226 Difference]: Without dead ends: 6528 [2024-11-06 20:05:40,953 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 20:05:40,954 INFO L432 NwaCegarLoop]: 382 mSDtfsCounter, 404 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 1215 mSolverCounterSat, 274 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 404 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 1489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 274 IncrementalHoareTripleChecker+Valid, 1215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:40,954 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [404 Valid, 444 Invalid, 1489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [274 Valid, 1215 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-06 20:05:40,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6528 states. [2024-11-06 20:05:41,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6528 to 4382. [2024-11-06 20:05:41,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4382 states, 4381 states have (on average 1.1684546907098836) internal successors, (5119), 4381 states have internal predecessors, (5119), 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 20:05:41,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4382 states to 4382 states and 5119 transitions. [2024-11-06 20:05:41,040 INFO L78 Accepts]: Start accepts. Automaton has 4382 states and 5119 transitions. Word has length 201 [2024-11-06 20:05:41,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:41,041 INFO L471 AbstractCegarLoop]: Abstraction has 4382 states and 5119 transitions. [2024-11-06 20:05:41,041 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 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 20:05:41,041 INFO L276 IsEmpty]: Start isEmpty. Operand 4382 states and 5119 transitions. [2024-11-06 20:05:41,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2024-11-06 20:05:41,044 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:41,045 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 20:05:41,045 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 20:05:41,045 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:41,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:41,046 INFO L85 PathProgramCache]: Analyzing trace with hash 706596333, now seen corresponding path program 1 times [2024-11-06 20:05:41,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:41,046 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192181282] [2024-11-06 20:05:41,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:41,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:41,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:41,538 INFO L134 CoverageAnalysis]: Checked inductivity of 171 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-06 20:05:41,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:41,539 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192181282] [2024-11-06 20:05:41,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192181282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:05:41,539 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:05:41,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:05:41,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215776941] [2024-11-06 20:05:41,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:41,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:05:41,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:41,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:05:41,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:05:41,540 INFO L87 Difference]: Start difference. First operand 4382 states and 5119 transitions. Second operand has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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 20:05:43,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:43,379 INFO L93 Difference]: Finished difference Result 10910 states and 12924 transitions. [2024-11-06 20:05:43,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:05:43,380 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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 267 [2024-11-06 20:05:43,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:43,399 INFO L225 Difference]: With dead ends: 10910 [2024-11-06 20:05:43,399 INFO L226 Difference]: Without dead ends: 6530 [2024-11-06 20:05:43,404 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 20:05:43,405 INFO L432 NwaCegarLoop]: 367 mSDtfsCounter, 458 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1294 mSolverCounterSat, 262 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 458 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 1556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 262 IncrementalHoareTripleChecker+Valid, 1294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:43,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [458 Valid, 413 Invalid, 1556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [262 Valid, 1294 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-06 20:05:43,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6530 states. [2024-11-06 20:05:43,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6530 to 6096. [2024-11-06 20:05:43,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6096 states, 6095 states have (on average 1.188515176374077) internal successors, (7244), 6095 states have internal predecessors, (7244), 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 20:05:43,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6096 states to 6096 states and 7244 transitions. [2024-11-06 20:05:43,503 INFO L78 Accepts]: Start accepts. Automaton has 6096 states and 7244 transitions. Word has length 267 [2024-11-06 20:05:43,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:43,504 INFO L471 AbstractCegarLoop]: Abstraction has 6096 states and 7244 transitions. [2024-11-06 20:05:43,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 62.0) internal successors, (186), 3 states have internal predecessors, (186), 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 20:05:43,504 INFO L276 IsEmpty]: Start isEmpty. Operand 6096 states and 7244 transitions. [2024-11-06 20:05:43,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2024-11-06 20:05:43,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:43,511 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:05:43,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 20:05:43,512 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:43,512 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:43,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1635641841, now seen corresponding path program 1 times [2024-11-06 20:05:43,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:43,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455022661] [2024-11-06 20:05:43,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:43,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:43,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:43,830 INFO L134 CoverageAnalysis]: Checked inductivity of 348 backedges. 267 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2024-11-06 20:05:43,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:43,832 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455022661] [2024-11-06 20:05:43,832 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455022661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:05:43,832 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:05:43,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:05:43,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719501363] [2024-11-06 20:05:43,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:43,833 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:05:43,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:43,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:05:43,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:05:43,834 INFO L87 Difference]: Start difference. First operand 6096 states and 7244 transitions. Second operand has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 20:05:45,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:45,712 INFO L93 Difference]: Finished difference Result 15622 states and 18732 transitions. [2024-11-06 20:05:45,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:05:45,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 279 [2024-11-06 20:05:45,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:45,734 INFO L225 Difference]: With dead ends: 15622 [2024-11-06 20:05:45,734 INFO L226 Difference]: Without dead ends: 8653 [2024-11-06 20:05:45,739 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 20:05:45,740 INFO L432 NwaCegarLoop]: 585 mSDtfsCounter, 492 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 1238 mSolverCounterSat, 350 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 492 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 1588 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 350 IncrementalHoareTripleChecker+Valid, 1238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:45,740 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [492 Valid, 628 Invalid, 1588 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [350 Valid, 1238 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-06 20:05:45,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8653 states. [2024-11-06 20:05:45,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8653 to 8222. [2024-11-06 20:05:45,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8222 states, 8221 states have (on average 1.1763775696387302) internal successors, (9671), 8221 states have internal predecessors, (9671), 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 20:05:45,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8222 states to 8222 states and 9671 transitions. [2024-11-06 20:05:45,885 INFO L78 Accepts]: Start accepts. Automaton has 8222 states and 9671 transitions. Word has length 279 [2024-11-06 20:05:45,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:45,885 INFO L471 AbstractCegarLoop]: Abstraction has 8222 states and 9671 transitions. [2024-11-06 20:05:45,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.33333333333333) internal successors, (199), 3 states have internal predecessors, (199), 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 20:05:45,886 INFO L276 IsEmpty]: Start isEmpty. Operand 8222 states and 9671 transitions. [2024-11-06 20:05:45,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 308 [2024-11-06 20:05:45,891 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:45,891 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:05:45,891 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 20:05:45,891 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:45,892 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:45,893 INFO L85 PathProgramCache]: Analyzing trace with hash -456337817, now seen corresponding path program 1 times [2024-11-06 20:05:45,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:45,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733204811] [2024-11-06 20:05:45,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:45,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:45,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:46,341 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 277 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2024-11-06 20:05:46,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:46,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733204811] [2024-11-06 20:05:46,343 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733204811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:05:46,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:05:46,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 20:05:46,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743046184] [2024-11-06 20:05:46,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:46,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:05:46,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:46,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:05:46,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:05:46,345 INFO L87 Difference]: Start difference. First operand 8222 states and 9671 transitions. Second operand has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 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 20:05:49,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:49,014 INFO L93 Difference]: Finished difference Result 30139 states and 35484 transitions. [2024-11-06 20:05:49,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:05:49,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 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 307 [2024-11-06 20:05:49,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:49,055 INFO L225 Difference]: With dead ends: 30139 [2024-11-06 20:05:49,056 INFO L226 Difference]: Without dead ends: 21064 [2024-11-06 20:05:49,068 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 20:05:49,069 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 860 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 2648 mSolverCounterSat, 411 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 860 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 3059 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 411 IncrementalHoareTripleChecker+Valid, 2648 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:49,070 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [860 Valid, 272 Invalid, 3059 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [411 Valid, 2648 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 20:05:49,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21064 states. [2024-11-06 20:05:49,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21064 to 20596. [2024-11-06 20:05:49,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20596 states, 20595 states have (on average 1.1576110706482157) internal successors, (23841), 20595 states have internal predecessors, (23841), 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 20:05:49,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20596 states to 20596 states and 23841 transitions. [2024-11-06 20:05:49,471 INFO L78 Accepts]: Start accepts. Automaton has 20596 states and 23841 transitions. Word has length 307 [2024-11-06 20:05:49,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:49,475 INFO L471 AbstractCegarLoop]: Abstraction has 20596 states and 23841 transitions. [2024-11-06 20:05:49,476 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 56.5) internal successors, (226), 4 states have internal predecessors, (226), 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 20:05:49,476 INFO L276 IsEmpty]: Start isEmpty. Operand 20596 states and 23841 transitions. [2024-11-06 20:05:49,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2024-11-06 20:05:49,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:49,497 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:05:49,498 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 20:05:49,498 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:49,498 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:49,499 INFO L85 PathProgramCache]: Analyzing trace with hash -847313106, now seen corresponding path program 1 times [2024-11-06 20:05:49,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:49,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158685676] [2024-11-06 20:05:49,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:49,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:49,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:50,107 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 232 proven. 82 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2024-11-06 20:05:50,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:50,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158685676] [2024-11-06 20:05:50,108 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158685676] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:05:50,108 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073524217] [2024-11-06 20:05:50,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:50,108 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:05:50,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:05:50,111 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 20:05:50,113 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 20:05:50,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:50,286 INFO L255 TraceCheckSpWp]: Trace formula consists of 513 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 20:05:50,303 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 20:05:50,799 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 206 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:05:50,799 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 20:05:51,329 INFO L134 CoverageAnalysis]: Checked inductivity of 359 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:05:51,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2073524217] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-06 20:05:51,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-06 20:05:51,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [3, 4] total 7 [2024-11-06 20:05:51,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [287471515] [2024-11-06 20:05:51,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:05:51,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 20:05:51,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:51,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 20:05:51,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-06 20:05:51,332 INFO L87 Difference]: Start difference. First operand 20596 states and 23841 transitions. Second operand has 5 states, 5 states have (on average 77.6) internal successors, (388), 4 states have internal predecessors, (388), 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 20:05:54,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:05:54,535 INFO L93 Difference]: Finished difference Result 62901 states and 72227 transitions. [2024-11-06 20:05:54,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 20:05:54,536 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 77.6) internal successors, (388), 4 states have internal predecessors, (388), 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 388 [2024-11-06 20:05:54,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:05:54,625 INFO L225 Difference]: With dead ends: 62901 [2024-11-06 20:05:54,626 INFO L226 Difference]: Without dead ends: 41455 [2024-11-06 20:05:54,648 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 777 GetRequests, 771 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2024-11-06 20:05:54,649 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 1179 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 3066 mSolverCounterSat, 664 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1179 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 3730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 664 IncrementalHoareTripleChecker+Valid, 3066 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-06 20:05:54,650 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1179 Valid, 169 Invalid, 3730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [664 Valid, 3066 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-06 20:05:54,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41455 states. [2024-11-06 20:05:55,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41455 to 41441. [2024-11-06 20:05:55,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41441 states, 41440 states have (on average 1.1064913127413127) internal successors, (45853), 41440 states have internal predecessors, (45853), 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 20:05:55,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41441 states to 41441 states and 45853 transitions. [2024-11-06 20:05:55,245 INFO L78 Accepts]: Start accepts. Automaton has 41441 states and 45853 transitions. Word has length 388 [2024-11-06 20:05:55,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:05:55,246 INFO L471 AbstractCegarLoop]: Abstraction has 41441 states and 45853 transitions. [2024-11-06 20:05:55,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.6) internal successors, (388), 4 states have internal predecessors, (388), 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 20:05:55,246 INFO L276 IsEmpty]: Start isEmpty. Operand 41441 states and 45853 transitions. [2024-11-06 20:05:55,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2024-11-06 20:05:55,260 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:05:55,260 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, 4, 4, 4, 4, 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, 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] [2024-11-06 20:05:55,279 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 20:05:55,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:05:55,461 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:05:55,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:05:55,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1990257399, now seen corresponding path program 1 times [2024-11-06 20:05:55,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:05:55,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1788342493] [2024-11-06 20:05:55,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:55,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:05:55,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:56,598 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 349 proven. 45 refuted. 0 times theorem prover too weak. 269 trivial. 0 not checked. [2024-11-06 20:05:56,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:05:56,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1788342493] [2024-11-06 20:05:56,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1788342493] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:05:56,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1584818793] [2024-11-06 20:05:56,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:05:56,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:05:56,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:05:56,602 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 20:05:56,604 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 20:05:56,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:05:56,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 573 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-06 20:05:56,801 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 20:05:57,322 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 419 proven. 82 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-06 20:05:57,323 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-06 20:05:58,466 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 419 proven. 82 refuted. 0 times theorem prover too weak. 162 trivial. 0 not checked. [2024-11-06 20:05:58,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1584818793] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-06 20:05:58,467 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-06 20:05:58,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 3] total 9 [2024-11-06 20:05:58,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615261317] [2024-11-06 20:05:58,467 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-06 20:05:58,470 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-06 20:05:58,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:05:58,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-06 20:05:58,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-06 20:05:58,472 INFO L87 Difference]: Start difference. First operand 41441 states and 45853 transitions. Second operand has 9 states, 9 states have (on average 82.44444444444444) internal successors, (742), 9 states have internal predecessors, (742), 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 20:06:09,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:06:09,906 INFO L93 Difference]: Finished difference Result 124225 states and 136979 transitions. [2024-11-06 20:06:09,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-06 20:06:09,906 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 82.44444444444444) internal successors, (742), 9 states have internal predecessors, (742), 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 427 [2024-11-06 20:06:09,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:06:10,024 INFO L225 Difference]: With dead ends: 124225 [2024-11-06 20:06:10,025 INFO L226 Difference]: Without dead ends: 80230 [2024-11-06 20:06:10,062 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 887 GetRequests, 865 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=150, Invalid=402, Unknown=0, NotChecked=0, Total=552 [2024-11-06 20:06:10,063 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 9132 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 14994 mSolverCounterSat, 1857 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9132 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 16851 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1857 IncrementalHoareTripleChecker+Valid, 14994 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:06:10,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9132 Valid, 427 Invalid, 16851 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1857 Valid, 14994 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2024-11-06 20:06:10,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80230 states. [2024-11-06 20:06:10,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80230 to 60152. [2024-11-06 20:06:10,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60152 states, 60151 states have (on average 1.0845538727535702) internal successors, (65237), 60151 states have internal predecessors, (65237), 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 20:06:10,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60152 states to 60152 states and 65237 transitions. [2024-11-06 20:06:10,896 INFO L78 Accepts]: Start accepts. Automaton has 60152 states and 65237 transitions. Word has length 427 [2024-11-06 20:06:10,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:06:10,897 INFO L471 AbstractCegarLoop]: Abstraction has 60152 states and 65237 transitions. [2024-11-06 20:06:10,897 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.44444444444444) internal successors, (742), 9 states have internal predecessors, (742), 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 20:06:10,897 INFO L276 IsEmpty]: Start isEmpty. Operand 60152 states and 65237 transitions. [2024-11-06 20:06:10,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 527 [2024-11-06 20:06:10,914 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:06:10,915 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 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] [2024-11-06 20:06:10,934 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 20:06:11,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:06:11,117 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:06:11,117 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:06:11,118 INFO L85 PathProgramCache]: Analyzing trace with hash 280124704, now seen corresponding path program 1 times [2024-11-06 20:06:11,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:06:11,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841771235] [2024-11-06 20:06:11,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:06:11,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:06:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:06:11,716 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 453 proven. 0 refuted. 0 times theorem prover too weak. 245 trivial. 0 not checked. [2024-11-06 20:06:11,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:06:11,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841771235] [2024-11-06 20:06:11,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [841771235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:06:11,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:06:11,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:06:11,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156452527] [2024-11-06 20:06:11,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:06:11,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:06:11,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:06:11,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:06:11,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:06:11,718 INFO L87 Difference]: Start difference. First operand 60152 states and 65237 transitions. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:06:13,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:06:13,757 INFO L93 Difference]: Finished difference Result 139869 states and 151844 transitions. [2024-11-06 20:06:13,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:06:13,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 526 [2024-11-06 20:06:13,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:06:13,872 INFO L225 Difference]: With dead ends: 139869 [2024-11-06 20:06:13,872 INFO L226 Difference]: Without dead ends: 80144 [2024-11-06 20:06:13,908 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 20:06:13,909 INFO L432 NwaCegarLoop]: 677 mSDtfsCounter, 344 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1176 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 714 SdHoareTripleChecker+Invalid, 1336 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 1176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:06:13,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 714 Invalid, 1336 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 1176 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 20:06:13,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80144 states. [2024-11-06 20:06:14,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80144 to 76730. [2024-11-06 20:06:14,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76730 states, 76729 states have (on average 1.0734011912054113) internal successors, (82361), 76729 states have internal predecessors, (82361), 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 20:06:14,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76730 states to 76730 states and 82361 transitions. [2024-11-06 20:06:14,818 INFO L78 Accepts]: Start accepts. Automaton has 76730 states and 82361 transitions. Word has length 526 [2024-11-06 20:06:14,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:06:14,820 INFO L471 AbstractCegarLoop]: Abstraction has 76730 states and 82361 transitions. [2024-11-06 20:06:14,820 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:06:14,820 INFO L276 IsEmpty]: Start isEmpty. Operand 76730 states and 82361 transitions. [2024-11-06 20:06:14,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 562 [2024-11-06 20:06:14,834 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:06:14,835 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 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] [2024-11-06 20:06:14,835 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 20:06:14,835 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:06:14,835 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:06:14,836 INFO L85 PathProgramCache]: Analyzing trace with hash 615543433, now seen corresponding path program 1 times [2024-11-06 20:06:14,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:06:14,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951008471] [2024-11-06 20:06:14,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:06:14,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:06:14,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:06:15,058 INFO L134 CoverageAnalysis]: Checked inductivity of 698 backedges. 408 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2024-11-06 20:06:15,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:06:15,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951008471] [2024-11-06 20:06:15,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951008471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:06:15,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:06:15,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:06:15,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632381145] [2024-11-06 20:06:15,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:06:15,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:06:15,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:06:15,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:06:15,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:06:15,061 INFO L87 Difference]: Start difference. First operand 76730 states and 82361 transitions. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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 20:06:16,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:06:16,884 INFO L93 Difference]: Finished difference Result 159419 states and 171298 transitions. [2024-11-06 20:06:16,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:06:16,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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 561 [2024-11-06 20:06:16,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:06:17,011 INFO L225 Difference]: With dead ends: 159419 [2024-11-06 20:06:17,011 INFO L226 Difference]: Without dead ends: 83541 [2024-11-06 20:06:17,064 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 20:06:17,065 INFO L432 NwaCegarLoop]: 624 mSDtfsCounter, 487 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 1135 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 487 SdHoareTripleChecker+Valid, 662 SdHoareTripleChecker+Invalid, 1299 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 1135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 20:06:17,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [487 Valid, 662 Invalid, 1299 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 1135 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 20:06:17,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83541 states. [2024-11-06 20:06:17,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83541 to 83533. [2024-11-06 20:06:17,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83533 states, 83532 states have (on average 1.06984149786908) internal successors, (89366), 83532 states have internal predecessors, (89366), 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 20:06:18,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83533 states to 83533 states and 89366 transitions. [2024-11-06 20:06:18,007 INFO L78 Accepts]: Start accepts. Automaton has 83533 states and 89366 transitions. Word has length 561 [2024-11-06 20:06:18,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:06:18,007 INFO L471 AbstractCegarLoop]: Abstraction has 83533 states and 89366 transitions. [2024-11-06 20:06:18,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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 20:06:18,008 INFO L276 IsEmpty]: Start isEmpty. Operand 83533 states and 89366 transitions. [2024-11-06 20:06:18,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 601 [2024-11-06 20:06:18,019 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:06:18,019 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 20:06:18,020 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 20:06:18,020 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:06:18,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:06:18,020 INFO L85 PathProgramCache]: Analyzing trace with hash -705322845, now seen corresponding path program 1 times [2024-11-06 20:06:18,020 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:06:18,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [517703388] [2024-11-06 20:06:18,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:06:18,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:06:18,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:06:18,641 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 481 proven. 0 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2024-11-06 20:06:18,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:06:18,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [517703388] [2024-11-06 20:06:18,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [517703388] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:06:18,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:06:18,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:06:18,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227214664] [2024-11-06 20:06:18,642 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:06:18,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:06:18,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:06:18,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:06:18,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:06:18,644 INFO L87 Difference]: Start difference. First operand 83533 states and 89366 transitions. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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 20:06:20,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:06:20,409 INFO L93 Difference]: Finished difference Result 179407 states and 191997 transitions. [2024-11-06 20:06:20,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:06:20,409 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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 600 [2024-11-06 20:06:20,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:06:20,525 INFO L225 Difference]: With dead ends: 179407 [2024-11-06 20:06:20,525 INFO L226 Difference]: Without dead ends: 96726 [2024-11-06 20:06:20,555 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 20:06:20,555 INFO L432 NwaCegarLoop]: 715 mSDtfsCounter, 344 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 1170 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 768 SdHoareTripleChecker+Invalid, 1242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 1170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 20:06:20,555 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 768 Invalid, 1242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 1170 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 20:06:20,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96726 states. [2024-11-06 20:06:21,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96726 to 92047. [2024-11-06 20:06:21,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92047 states, 92046 states have (on average 1.0673033048693046) internal successors, (98241), 92046 states have internal predecessors, (98241), 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 20:06:21,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92047 states to 92047 states and 98241 transitions. [2024-11-06 20:06:21,840 INFO L78 Accepts]: Start accepts. Automaton has 92047 states and 98241 transitions. Word has length 600 [2024-11-06 20:06:21,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:06:21,840 INFO L471 AbstractCegarLoop]: Abstraction has 92047 states and 98241 transitions. [2024-11-06 20:06:21,841 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 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 20:06:21,841 INFO L276 IsEmpty]: Start isEmpty. Operand 92047 states and 98241 transitions. [2024-11-06 20:06:21,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2024-11-06 20:06:21,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:06:21,857 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:21,857 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 20:06:21,857 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:06:21,858 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:06:21,858 INFO L85 PathProgramCache]: Analyzing trace with hash 257983632, now seen corresponding path program 1 times [2024-11-06 20:06:21,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:06:21,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [32446142] [2024-11-06 20:06:21,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:06:21,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:06:21,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:06:22,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1088 backedges. 578 proven. 0 refuted. 0 times theorem prover too weak. 510 trivial. 0 not checked. [2024-11-06 20:06:22,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:06:22,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [32446142] [2024-11-06 20:06:22,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [32446142] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:06:22,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:06:22,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 20:06:22,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109074962] [2024-11-06 20:06:22,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:06:22,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:06:22,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:06:22,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:06:22,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:06:22,733 INFO L87 Difference]: Start difference. First operand 92047 states and 98241 transitions. Second operand has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 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 20:06:25,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:06:25,808 INFO L93 Difference]: Finished difference Result 195621 states and 208757 transitions. [2024-11-06 20:06:25,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:06:25,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 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 614 [2024-11-06 20:06:25,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:06:25,930 INFO L225 Difference]: With dead ends: 195621 [2024-11-06 20:06:25,930 INFO L226 Difference]: Without dead ends: 106126 [2024-11-06 20:06:25,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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 20:06:25,958 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 803 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2463 mSolverCounterSat, 360 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 803 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 2823 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 360 IncrementalHoareTripleChecker+Valid, 2463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:06:25,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [803 Valid, 176 Invalid, 2823 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [360 Valid, 2463 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 20:06:26,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106126 states. [2024-11-06 20:06:26,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106126 to 98006. [2024-11-06 20:06:27,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98006 states, 98005 states have (on average 1.0678536809346462) internal successors, (104655), 98005 states have internal predecessors, (104655), 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 20:06:27,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98006 states to 98006 states and 104655 transitions. [2024-11-06 20:06:27,247 INFO L78 Accepts]: Start accepts. Automaton has 98006 states and 104655 transitions. Word has length 614 [2024-11-06 20:06:27,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:06:27,247 INFO L471 AbstractCegarLoop]: Abstraction has 98006 states and 104655 transitions. [2024-11-06 20:06:27,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.0) internal successors, (336), 4 states have internal predecessors, (336), 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 20:06:27,247 INFO L276 IsEmpty]: Start isEmpty. Operand 98006 states and 104655 transitions. [2024-11-06 20:06:27,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 617 [2024-11-06 20:06:27,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:06:27,262 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:27,262 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 20:06:27,262 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:06:27,262 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:06:27,262 INFO L85 PathProgramCache]: Analyzing trace with hash 1184151290, now seen corresponding path program 1 times [2024-11-06 20:06:27,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:06:27,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945689513] [2024-11-06 20:06:27,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:06:27,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:06:27,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:06:27,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1048 backedges. 805 proven. 0 refuted. 0 times theorem prover too weak. 243 trivial. 0 not checked. [2024-11-06 20:06:27,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:06:27,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945689513] [2024-11-06 20:06:27,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945689513] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:06:27,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:06:27,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:06:27,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1970976426] [2024-11-06 20:06:27,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:06:27,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:06:27,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:06:27,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:06:27,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:06:27,800 INFO L87 Difference]: Start difference. First operand 98006 states and 104655 transitions. Second operand has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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 20:06:29,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:06:29,586 INFO L93 Difference]: Finished difference Result 209633 states and 224315 transitions. [2024-11-06 20:06:29,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:06:29,587 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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 616 [2024-11-06 20:06:29,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:06:29,727 INFO L225 Difference]: With dead ends: 209633 [2024-11-06 20:06:29,727 INFO L226 Difference]: Without dead ends: 114179 [2024-11-06 20:06:29,766 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 20:06:29,767 INFO L432 NwaCegarLoop]: 230 mSDtfsCounter, 265 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 1141 mSolverCounterSat, 194 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 265 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 1335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 194 IncrementalHoareTripleChecker+Valid, 1141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 20:06:29,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [265 Valid, 274 Invalid, 1335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [194 Valid, 1141 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 20:06:29,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114179 states. [2024-11-06 20:06:30,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114179 to 105655. [2024-11-06 20:06:31,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105655 states, 105654 states have (on average 1.0608495655630643) internal successors, (112083), 105654 states have internal predecessors, (112083), 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 20:06:31,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105655 states to 105655 states and 112083 transitions. [2024-11-06 20:06:31,359 INFO L78 Accepts]: Start accepts. Automaton has 105655 states and 112083 transitions. Word has length 616 [2024-11-06 20:06:31,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:06:31,360 INFO L471 AbstractCegarLoop]: Abstraction has 105655 states and 112083 transitions. [2024-11-06 20:06:31,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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 20:06:31,360 INFO L276 IsEmpty]: Start isEmpty. Operand 105655 states and 112083 transitions. [2024-11-06 20:06:31,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 705 [2024-11-06 20:06:31,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:06:31,378 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 20:06:31,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 20:06:31,379 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:06:31,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:06:31,379 INFO L85 PathProgramCache]: Analyzing trace with hash -157477870, now seen corresponding path program 1 times [2024-11-06 20:06:31,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:06:31,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778469084] [2024-11-06 20:06:31,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:06:31,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:06:31,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:06:31,715 INFO L134 CoverageAnalysis]: Checked inductivity of 1536 backedges. 862 proven. 0 refuted. 0 times theorem prover too weak. 674 trivial. 0 not checked. [2024-11-06 20:06:31,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:06:31,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778469084] [2024-11-06 20:06:31,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [778469084] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:06:31,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:06:31,717 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:06:31,717 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719179526] [2024-11-06 20:06:31,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:06:31,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:06:31,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:06:31,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:06:31,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:06:31,718 INFO L87 Difference]: Start difference. First operand 105655 states and 112083 transitions. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 2 states have internal predecessors, (325), 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 20:06:32,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:06:32,834 INFO L93 Difference]: Finished difference Result 193407 states and 204915 transitions. [2024-11-06 20:06:32,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:06:32,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 2 states have internal predecessors, (325), 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 704 [2024-11-06 20:06:32,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:06:32,947 INFO L225 Difference]: With dead ends: 193407 [2024-11-06 20:06:32,947 INFO L226 Difference]: Without dead ends: 90303 [2024-11-06 20:06:33,002 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:06:33,003 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 557 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 618 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 557 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 618 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:06:33,003 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [557 Valid, 73 Invalid, 624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 618 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 20:06:33,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90303 states. [2024-11-06 20:06:33,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90303 to 88585. [2024-11-06 20:06:33,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88585 states, 88584 states have (on average 1.0573128330172492) internal successors, (93661), 88584 states have internal predecessors, (93661), 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 20:06:33,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88585 states to 88585 states and 93661 transitions. [2024-11-06 20:06:33,946 INFO L78 Accepts]: Start accepts. Automaton has 88585 states and 93661 transitions. Word has length 704 [2024-11-06 20:06:33,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:06:33,946 INFO L471 AbstractCegarLoop]: Abstraction has 88585 states and 93661 transitions. [2024-11-06 20:06:33,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 2 states have internal predecessors, (325), 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 20:06:33,946 INFO L276 IsEmpty]: Start isEmpty. Operand 88585 states and 93661 transitions. [2024-11-06 20:06:33,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 714 [2024-11-06 20:06:33,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:06:33,965 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 20:06:33,965 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-06 20:06:33,965 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:06:33,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:06:33,966 INFO L85 PathProgramCache]: Analyzing trace with hash -39240711, now seen corresponding path program 1 times [2024-11-06 20:06:33,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:06:33,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1028430402] [2024-11-06 20:06:33,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:06:33,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:06:34,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:06:34,793 INFO L134 CoverageAnalysis]: Checked inductivity of 1192 backedges. 948 proven. 0 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2024-11-06 20:06:34,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:06:34,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1028430402] [2024-11-06 20:06:34,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1028430402] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:06:34,794 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:06:34,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:06:34,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108300018] [2024-11-06 20:06:34,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:06:34,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:06:34,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:06:34,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:06:34,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:06:34,796 INFO L87 Difference]: Start difference. First operand 88585 states and 93661 transitions. Second operand has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 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 20:06:36,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:06:36,537 INFO L93 Difference]: Finished difference Result 186116 states and 196906 transitions. [2024-11-06 20:06:36,538 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:06:36,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 172.33333333333334) internal successors, (517), 3 states have internal predecessors, (517), 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 713 [2024-11-06 20:06:36,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:06:36,654 INFO L225 Difference]: With dead ends: 186116 [2024-11-06 20:06:36,654 INFO L226 Difference]: Without dead ends: 98383 [2024-11-06 20:06:36,702 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 20:06:36,702 INFO L432 NwaCegarLoop]: 662 mSDtfsCounter, 240 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 107 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 1298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 107 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 20:06:36,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 699 Invalid, 1298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [107 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 20:06:36,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98383 states. [2024-11-06 20:06:37,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98383 to 97092. [2024-11-06 20:06:37,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97092 states, 97091 states have (on average 1.0531872161168387) internal successors, (102255), 97091 states have internal predecessors, (102255), 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)