./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label25.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/Problem16_label25.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', 'b3a00e8e91353fe2867235d39a21deaf6e027bf890f337090cb073a769f36f77'] 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/Problem16_label25.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 b3a00e8e91353fe2867235d39a21deaf6e027bf890f337090cb073a769f36f77 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 20:01:25,064 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 20:01:25,136 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:01:25,140 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 20:01:25,140 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 20:01:25,162 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 20:01:25,165 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 20:01:25,165 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 20:01:25,165 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 20:01:25,166 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 20:01:25,166 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 20:01:25,166 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 20:01:25,166 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 20:01:25,167 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 20:01:25,167 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 20:01:25,170 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 20:01:25,170 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 20:01:25,170 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 20:01:25,170 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 20:01:25,170 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 20:01:25,170 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 20:01:25,170 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 20:01:25,170 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 20:01:25,170 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 20:01:25,170 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 20:01:25,171 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 20:01:25,171 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 20:01:25,171 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 20:01:25,171 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 20:01:25,171 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 20:01:25,171 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 20:01:25,171 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 20:01:25,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:01:25,171 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 20:01:25,171 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 20:01:25,171 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 20:01:25,171 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 20:01:25,171 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 20:01:25,171 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 20:01:25,171 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 20:01:25,171 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 20:01:25,171 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 20:01:25,171 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 -> b3a00e8e91353fe2867235d39a21deaf6e027bf890f337090cb073a769f36f77 [2024-11-06 20:01:25,393 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 20:01:25,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 20:01:25,401 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 20:01:25,402 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 20:01:25,402 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 20:01:25,403 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label25.c [2024-11-06 20:01:26,493 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 20:01:26,825 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 20:01:26,830 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label25.c [2024-11-06 20:01:26,843 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7126e1361/e133b11dfc2441c884b9cfab073caa5b/FLAGe7a7ed3c9 [2024-11-06 20:01:27,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/7126e1361/e133b11dfc2441c884b9cfab073caa5b [2024-11-06 20:01:27,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 20:01:27,076 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 20:01:27,077 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 20:01:27,078 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 20:01:27,080 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 20:01:27,081 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:01:27" (1/1) ... [2024-11-06 20:01:27,081 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@eda6b1c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:01:27, skipping insertion in model container [2024-11-06 20:01:27,081 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:01:27" (1/1) ... [2024-11-06 20:01:27,111 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 20:01:27,232 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/Problem16_label25.c[5318,5331] [2024-11-06 20:01:27,445 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:01:27,452 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 20:01:27,470 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/Problem16_label25.c[5318,5331] [2024-11-06 20:01:27,575 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:01:27,586 INFO L204 MainTranslator]: Completed translation [2024-11-06 20:01:27,587 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:01:27 WrapperNode [2024-11-06 20:01:27,587 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 20:01:27,588 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 20:01:27,588 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 20:01:27,588 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 20:01:27,592 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:01:27" (1/1) ... [2024-11-06 20:01:27,608 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:01:27" (1/1) ... [2024-11-06 20:01:27,684 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1770 [2024-11-06 20:01:27,684 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 20:01:27,685 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 20:01:27,685 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 20:01:27,685 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 20:01:27,691 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:01:27" (1/1) ... [2024-11-06 20:01:27,691 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:01:27" (1/1) ... [2024-11-06 20:01:27,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:01:27" (1/1) ... [2024-11-06 20:01:27,789 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:01:27,790 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:01:27" (1/1) ... [2024-11-06 20:01:27,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:01:27" (1/1) ... [2024-11-06 20:01:27,821 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:01:27" (1/1) ... [2024-11-06 20:01:27,836 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:01:27" (1/1) ... [2024-11-06 20:01:27,846 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:01:27" (1/1) ... [2024-11-06 20:01:27,851 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:01:27" (1/1) ... [2024-11-06 20:01:27,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 20:01:27,864 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 20:01:27,864 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 20:01:27,865 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 20:01:27,865 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:01:27" (1/1) ... [2024-11-06 20:01:27,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:01:27,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:01:27,888 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:01:27,890 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:01:27,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 20:01:27,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 20:01:27,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 20:01:27,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 20:01:27,976 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 20:01:27,978 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 20:01:29,461 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2024-11-06 20:01:29,461 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 20:01:29,479 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 20:01:29,482 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 20:01:29,482 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:01:29 BoogieIcfgContainer [2024-11-06 20:01:29,482 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 20:01:29,484 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 20:01:29,484 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 20:01:29,487 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 20:01:29,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:01:27" (1/3) ... [2024-11-06 20:01:29,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c77305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:01:29, skipping insertion in model container [2024-11-06 20:01:29,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:01:27" (2/3) ... [2024-11-06 20:01:29,488 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47c77305 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:01:29, skipping insertion in model container [2024-11-06 20:01:29,488 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:01:29" (3/3) ... [2024-11-06 20:01:29,489 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label25.c [2024-11-06 20:01:29,500 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 20:01:29,500 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 20:01:29,550 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 20:01:29,559 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;@21b3400e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 20:01:29,559 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 20:01:29,564 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.8350253807106598) internal successors, (723), 395 states have internal predecessors, (723), 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:01:29,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-06 20:01:29,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:01:29,570 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:01:29,570 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:01:29,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:01:29,574 INFO L85 PathProgramCache]: Analyzing trace with hash 761214138, now seen corresponding path program 1 times [2024-11-06 20:01:29,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:01:29,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525034476] [2024-11-06 20:01:29,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:01:29,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:01:29,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:01:29,848 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:01:29,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:01:29,852 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525034476] [2024-11-06 20:01:29,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525034476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:01:29,852 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:01:29,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:01:29,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1593594577] [2024-11-06 20:01:29,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:01:29,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:01:29,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:01:29,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:01:29,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:01:29,872 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.8350253807106598) internal successors, (723), 395 states have internal predecessors, (723), 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 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 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:01:31,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:01:31,289 INFO L93 Difference]: Finished difference Result 1137 states and 2118 transitions. [2024-11-06 20:01:31,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:01:31,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 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 50 [2024-11-06 20:01:31,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:01:31,300 INFO L225 Difference]: With dead ends: 1137 [2024-11-06 20:01:31,300 INFO L226 Difference]: Without dead ends: 662 [2024-11-06 20:01:31,305 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:01:31,307 INFO L432 NwaCegarLoop]: 106 mSDtfsCounter, 334 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1009 mSolverCounterSat, 429 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 334 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 1438 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 429 IncrementalHoareTripleChecker+Valid, 1009 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 20:01:31,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [334 Valid, 114 Invalid, 1438 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [429 Valid, 1009 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 20:01:31,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-11-06 20:01:31,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2024-11-06 20:01:31,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.7004538577912254) internal successors, (1124), 661 states have internal predecessors, (1124), 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:01:31,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1124 transitions. [2024-11-06 20:01:31,360 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1124 transitions. Word has length 50 [2024-11-06 20:01:31,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:01:31,361 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1124 transitions. [2024-11-06 20:01:31,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 2 states have internal predecessors, (50), 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:01:31,361 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1124 transitions. [2024-11-06 20:01:31,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2024-11-06 20:01:31,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:01:31,365 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:01:31,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 20:01:31,366 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:01:31,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:01:31,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1369025113, now seen corresponding path program 1 times [2024-11-06 20:01:31,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:01:31,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887799752] [2024-11-06 20:01:31,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:01:31,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:01:31,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:01:31,545 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:01:31,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:01:31,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887799752] [2024-11-06 20:01:31,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887799752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:01:31,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:01:31,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:01:31,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315471107] [2024-11-06 20:01:31,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:01:31,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:01:31,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:01:31,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:01:31,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:01:31,547 INFO L87 Difference]: Start difference. First operand 662 states and 1124 transitions. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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:01:32,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:01:32,625 INFO L93 Difference]: Finished difference Result 1980 states and 3367 transitions. [2024-11-06 20:01:32,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:01:32,626 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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 116 [2024-11-06 20:01:32,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:01:32,630 INFO L225 Difference]: With dead ends: 1980 [2024-11-06 20:01:32,631 INFO L226 Difference]: Without dead ends: 1320 [2024-11-06 20:01:32,633 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:01:32,634 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 343 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 401 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 401 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 20:01:32,634 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 77 Invalid, 1283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [401 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 20:01:32,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2024-11-06 20:01:32,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2024-11-06 20:01:32,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 1319 states have (on average 1.620166793025019) internal successors, (2137), 1319 states have internal predecessors, (2137), 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:01:32,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 2137 transitions. [2024-11-06 20:01:32,668 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 2137 transitions. Word has length 116 [2024-11-06 20:01:32,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:01:32,668 INFO L471 AbstractCegarLoop]: Abstraction has 1320 states and 2137 transitions. [2024-11-06 20:01:32,668 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 2 states have internal predecessors, (116), 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:01:32,668 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 2137 transitions. [2024-11-06 20:01:32,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2024-11-06 20:01:32,670 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:01:32,670 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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:01:32,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 20:01:32,671 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:01:32,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:01:32,671 INFO L85 PathProgramCache]: Analyzing trace with hash 73847739, now seen corresponding path program 1 times [2024-11-06 20:01:32,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:01:32,671 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451527874] [2024-11-06 20:01:32,671 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:01:32,671 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:01:32,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:01:32,850 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:01:32,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:01:32,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451527874] [2024-11-06 20:01:32,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451527874] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:01:32,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:01:32,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:01:32,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581833810] [2024-11-06 20:01:32,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:01:32,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:01:32,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:01:32,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:01:32,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:01:32,851 INFO L87 Difference]: Start difference. First operand 1320 states and 2137 transitions. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 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:01:33,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:01:33,801 INFO L93 Difference]: Finished difference Result 3296 states and 5285 transitions. [2024-11-06 20:01:33,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:01:33,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 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:01:33,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:01:33,806 INFO L225 Difference]: With dead ends: 3296 [2024-11-06 20:01:33,807 INFO L226 Difference]: Without dead ends: 1978 [2024-11-06 20:01:33,807 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:01:33,808 INFO L432 NwaCegarLoop]: 151 mSDtfsCounter, 381 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 381 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 20:01:33,808 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [381 Valid, 155 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 20:01:33,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2024-11-06 20:01:33,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1978. [2024-11-06 20:01:33,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1978 states, 1977 states have (on average 1.3323216995447649) internal successors, (2634), 1977 states have internal predecessors, (2634), 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:01:33,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 2634 transitions. [2024-11-06 20:01:33,837 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 2634 transitions. Word has length 117 [2024-11-06 20:01:33,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:01:33,837 INFO L471 AbstractCegarLoop]: Abstraction has 1978 states and 2634 transitions. [2024-11-06 20:01:33,838 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 2 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:01:33,838 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2634 transitions. [2024-11-06 20:01:33,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-06 20:01:33,839 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:01:33,840 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:33,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 20:01:33,840 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:01:33,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:01:33,843 INFO L85 PathProgramCache]: Analyzing trace with hash -41347243, now seen corresponding path program 1 times [2024-11-06 20:01:33,843 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:01:33,843 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523810301] [2024-11-06 20:01:33,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:01:33,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:01:33,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:01:34,076 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:01:34,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:01:34,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523810301] [2024-11-06 20:01:34,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523810301] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:01:34,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:01:34,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:01:34,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855705480] [2024-11-06 20:01:34,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:01:34,078 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:01:34,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:01:34,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:01:34,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:01:34,079 INFO L87 Difference]: Start difference. First operand 1978 states and 2634 transitions. Second operand has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:01:35,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:01:35,068 INFO L93 Difference]: Finished difference Result 5928 states and 7897 transitions. [2024-11-06 20:01:35,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:01:35,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 209 [2024-11-06 20:01:35,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:01:35,078 INFO L225 Difference]: With dead ends: 5928 [2024-11-06 20:01:35,079 INFO L226 Difference]: Without dead ends: 3952 [2024-11-06 20:01:35,080 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:01:35,081 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 181 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 825 mSolverCounterSat, 380 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 1205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 380 IncrementalHoareTripleChecker+Valid, 825 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 20:01:35,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 259 Invalid, 1205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [380 Valid, 825 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 20:01:35,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2024-11-06 20:01:35,119 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3952. [2024-11-06 20:01:35,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 3951 states have (on average 1.216400911161731) internal successors, (4806), 3951 states have internal predecessors, (4806), 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:01:35,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 4806 transitions. [2024-11-06 20:01:35,128 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 4806 transitions. Word has length 209 [2024-11-06 20:01:35,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:01:35,129 INFO L471 AbstractCegarLoop]: Abstraction has 3952 states and 4806 transitions. [2024-11-06 20:01:35,129 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.66666666666667) internal successors, (209), 2 states have internal predecessors, (209), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:01:35,129 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 4806 transitions. [2024-11-06 20:01:35,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2024-11-06 20:01:35,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:01:35,133 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:35,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 20:01:35,134 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:01:35,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:01:35,134 INFO L85 PathProgramCache]: Analyzing trace with hash -1563186754, now seen corresponding path program 1 times [2024-11-06 20:01:35,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:01:35,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818768753] [2024-11-06 20:01:35,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:01:35,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:01:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:01:35,576 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:01:35,578 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:01:35,578 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818768753] [2024-11-06 20:01:35,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818768753] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:01:35,578 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:01:35,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:01:35,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963093530] [2024-11-06 20:01:35,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:01:35,579 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:01:35,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:01:35,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:01:35,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:01:35,580 INFO L87 Difference]: Start difference. First operand 3952 states and 4806 transitions. Second operand has 4 states, 4 states have (on average 73.75) internal successors, (295), 3 states have internal predecessors, (295), 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:01:36,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:01:36,592 INFO L93 Difference]: Finished difference Result 8231 states and 9951 transitions. [2024-11-06 20:01:36,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:01:36,593 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 73.75) internal successors, (295), 3 states have internal predecessors, (295), 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 295 [2024-11-06 20:01:36,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:01:36,608 INFO L225 Difference]: With dead ends: 8231 [2024-11-06 20:01:36,608 INFO L226 Difference]: Without dead ends: 4281 [2024-11-06 20:01:36,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 20:01:36,611 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 127 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 1469 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1469 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 20:01:36,611 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 322 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1469 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 20:01:36,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4281 states. [2024-11-06 20:01:36,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4281 to 4281. [2024-11-06 20:01:36,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4281 states, 4280 states have (on average 1.2011682242990653) internal successors, (5141), 4280 states have internal predecessors, (5141), 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:01:36,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4281 states to 4281 states and 5141 transitions. [2024-11-06 20:01:36,658 INFO L78 Accepts]: Start accepts. Automaton has 4281 states and 5141 transitions. Word has length 295 [2024-11-06 20:01:36,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:01:36,658 INFO L471 AbstractCegarLoop]: Abstraction has 4281 states and 5141 transitions. [2024-11-06 20:01:36,659 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 73.75) internal successors, (295), 3 states have internal predecessors, (295), 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:01:36,659 INFO L276 IsEmpty]: Start isEmpty. Operand 4281 states and 5141 transitions. [2024-11-06 20:01:36,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 383 [2024-11-06 20:01:36,662 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:01:36,662 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:01:36,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 20:01:36,663 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:01:36,663 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:01:36,663 INFO L85 PathProgramCache]: Analyzing trace with hash -1803491121, now seen corresponding path program 1 times [2024-11-06 20:01:36,663 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:01:36,663 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1214104289] [2024-11-06 20:01:36,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:01:36,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:01:36,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:01:37,133 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 181 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:01:37,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:01:37,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1214104289] [2024-11-06 20:01:37,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1214104289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:01:37,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:01:37,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 20:01:37,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1711578007] [2024-11-06 20:01:37,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:01:37,133 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-06 20:01:37,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:01:37,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-06 20:01:37,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-06 20:01:37,134 INFO L87 Difference]: Start difference. First operand 4281 states and 5141 transitions. Second operand has 7 states, 7 states have (on average 54.57142857142857) internal successors, (382), 6 states have internal predecessors, (382), 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:01:38,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:01:38,583 INFO L93 Difference]: Finished difference Result 8090 states and 9792 transitions. [2024-11-06 20:01:38,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-06 20:01:38,584 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 54.57142857142857) internal successors, (382), 6 states have internal predecessors, (382), 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 382 [2024-11-06 20:01:38,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:01:38,592 INFO L225 Difference]: With dead ends: 8090 [2024-11-06 20:01:38,592 INFO L226 Difference]: Without dead ends: 3952 [2024-11-06 20:01:38,605 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-06 20:01:38,606 INFO L432 NwaCegarLoop]: 263 mSDtfsCounter, 288 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 2450 mSolverCounterSat, 185 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 2635 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 185 IncrementalHoareTripleChecker+Valid, 2450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-06 20:01:38,606 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 302 Invalid, 2635 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [185 Valid, 2450 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-06 20:01:38,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3952 states. [2024-11-06 20:01:38,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3952 to 3952. [2024-11-06 20:01:38,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3952 states, 3951 states have (on average 1.0802328524424196) internal successors, (4268), 3951 states have internal predecessors, (4268), 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:01:38,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3952 states to 3952 states and 4268 transitions. [2024-11-06 20:01:38,641 INFO L78 Accepts]: Start accepts. Automaton has 3952 states and 4268 transitions. Word has length 382 [2024-11-06 20:01:38,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:01:38,641 INFO L471 AbstractCegarLoop]: Abstraction has 3952 states and 4268 transitions. [2024-11-06 20:01:38,641 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 54.57142857142857) internal successors, (382), 6 states have internal predecessors, (382), 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:01:38,641 INFO L276 IsEmpty]: Start isEmpty. Operand 3952 states and 4268 transitions. [2024-11-06 20:01:38,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2024-11-06 20:01:38,644 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:01:38,644 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:01:38,644 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 20:01:38,645 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:01:38,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:01:38,645 INFO L85 PathProgramCache]: Analyzing trace with hash -231398281, now seen corresponding path program 1 times [2024-11-06 20:01:38,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:01:38,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507378901] [2024-11-06 20:01:38,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:01:38,645 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:01:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:01:38,852 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 95 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-06 20:01:38,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:01:38,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507378901] [2024-11-06 20:01:38,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507378901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:01:38,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:01:38,853 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:01:38,853 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1296161850] [2024-11-06 20:01:38,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:01:38,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:01:38,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:01:38,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:01:38,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:01:38,854 INFO L87 Difference]: Start difference. First operand 3952 states and 4268 transitions. Second operand has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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:01:39,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:01:39,514 INFO L93 Difference]: Finished difference Result 9218 states and 10060 transitions. [2024-11-06 20:01:39,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:01:39,515 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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 389 [2024-11-06 20:01:39,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:01:39,525 INFO L225 Difference]: With dead ends: 9218 [2024-11-06 20:01:39,525 INFO L226 Difference]: Without dead ends: 5597 [2024-11-06 20:01:39,528 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:01:39,528 INFO L432 NwaCegarLoop]: 400 mSDtfsCounter, 285 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 759 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:01:39,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 406 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 759 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 20:01:39,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2024-11-06 20:01:39,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 5597. [2024-11-06 20:01:39,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5597 states, 5596 states have (on average 1.0748749106504647) internal successors, (6015), 5596 states have internal predecessors, (6015), 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:01:39,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 6015 transitions. [2024-11-06 20:01:39,579 INFO L78 Accepts]: Start accepts. Automaton has 5597 states and 6015 transitions. Word has length 389 [2024-11-06 20:01:39,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:01:39,580 INFO L471 AbstractCegarLoop]: Abstraction has 5597 states and 6015 transitions. [2024-11-06 20:01:39,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 98.33333333333333) internal successors, (295), 3 states have internal predecessors, (295), 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:01:39,580 INFO L276 IsEmpty]: Start isEmpty. Operand 5597 states and 6015 transitions. [2024-11-06 20:01:39,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 445 [2024-11-06 20:01:39,584 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:01:39,584 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 20:01:39,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 20:01:39,584 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:01:39,584 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:01:39,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1427750056, now seen corresponding path program 1 times [2024-11-06 20:01:39,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:01:39,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [904136727] [2024-11-06 20:01:39,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:01:39,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:01:39,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:01:39,843 INFO L134 CoverageAnalysis]: Checked inductivity of 253 backedges. 253 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:01:39,844 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:01:39,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [904136727] [2024-11-06 20:01:39,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [904136727] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:01:39,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:01:39,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:01:39,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [379230403] [2024-11-06 20:01:39,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:01:39,845 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:01:39,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:01:39,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:01:39,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:01:39,845 INFO L87 Difference]: Start difference. First operand 5597 states and 6015 transitions. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 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:01:40,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:01:40,537 INFO L93 Difference]: Finished difference Result 10863 states and 11697 transitions. [2024-11-06 20:01:40,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:01:40,538 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 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 444 [2024-11-06 20:01:40,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:01:40,547 INFO L225 Difference]: With dead ends: 10863 [2024-11-06 20:01:40,547 INFO L226 Difference]: Without dead ends: 5597 [2024-11-06 20:01:40,549 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:01:40,549 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 190 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 777 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 849 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 777 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 20:01:40,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 60 Invalid, 849 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 777 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 20:01:40,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5597 states. [2024-11-06 20:01:40,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5597 to 5597. [2024-11-06 20:01:40,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5597 states, 5596 states have (on average 1.0620085775553967) internal successors, (5943), 5596 states have internal predecessors, (5943), 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:01:40,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5597 states to 5597 states and 5943 transitions. [2024-11-06 20:01:40,609 INFO L78 Accepts]: Start accepts. Automaton has 5597 states and 5943 transitions. Word has length 444 [2024-11-06 20:01:40,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:01:40,610 INFO L471 AbstractCegarLoop]: Abstraction has 5597 states and 5943 transitions. [2024-11-06 20:01:40,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 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:01:40,610 INFO L276 IsEmpty]: Start isEmpty. Operand 5597 states and 5943 transitions. [2024-11-06 20:01:40,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 529 [2024-11-06 20:01:40,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:01:40,619 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 20:01:40,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 20:01:40,619 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:01:40,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:01:40,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1390777810, now seen corresponding path program 1 times [2024-11-06 20:01:40,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:01:40,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597516752] [2024-11-06 20:01:40,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:01:40,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:01:40,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:01:40,959 INFO L134 CoverageAnalysis]: Checked inductivity of 329 backedges. 329 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:01:40,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:01:40,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597516752] [2024-11-06 20:01:40,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597516752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:01:40,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:01:40,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:01:40,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315862913] [2024-11-06 20:01:40,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:01:40,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:01:40,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:01:40,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:01:40,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:01:40,962 INFO L87 Difference]: Start difference. First operand 5597 states and 5943 transitions. Second operand has 4 states, 4 states have (on average 132.0) internal successors, (528), 3 states have internal predecessors, (528), 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:01:42,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:01:42,117 INFO L93 Difference]: Finished difference Result 16458 states and 17513 transitions. [2024-11-06 20:01:42,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:01:42,118 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 132.0) internal successors, (528), 3 states have internal predecessors, (528), 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 528 [2024-11-06 20:01:42,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:01:42,134 INFO L225 Difference]: With dead ends: 16458 [2024-11-06 20:01:42,134 INFO L226 Difference]: Without dead ends: 11192 [2024-11-06 20:01:42,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:01:42,138 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 193 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1638 mSolverCounterSat, 121 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 193 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 1759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 1638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 20:01:42,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [193 Valid, 89 Invalid, 1759 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 1638 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 20:01:42,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11192 states. [2024-11-06 20:01:42,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11192 to 10861. [2024-11-06 20:01:42,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10861 states, 10860 states have (on average 1.0593001841620626) internal successors, (11504), 10860 states have internal predecessors, (11504), 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:01:42,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10861 states to 10861 states and 11504 transitions. [2024-11-06 20:01:42,236 INFO L78 Accepts]: Start accepts. Automaton has 10861 states and 11504 transitions. Word has length 528 [2024-11-06 20:01:42,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:01:42,236 INFO L471 AbstractCegarLoop]: Abstraction has 10861 states and 11504 transitions. [2024-11-06 20:01:42,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 132.0) internal successors, (528), 3 states have internal predecessors, (528), 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:01:42,236 INFO L276 IsEmpty]: Start isEmpty. Operand 10861 states and 11504 transitions. [2024-11-06 20:01:42,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 549 [2024-11-06 20:01:42,239 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:01:42,240 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:42,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 20:01:42,240 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:01:42,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:01:42,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1785151480, now seen corresponding path program 1 times [2024-11-06 20:01:42,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:01:42,243 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [476607831] [2024-11-06 20:01:42,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:01:42,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:01:42,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:01:42,459 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 397 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2024-11-06 20:01:42,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:01:42,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [476607831] [2024-11-06 20:01:42,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [476607831] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:01:42,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:01:42,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:01:42,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987480032] [2024-11-06 20:01:42,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:01:42,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:01:42,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:01:42,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:01:42,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:01:42,460 INFO L87 Difference]: Start difference. First operand 10861 states and 11504 transitions. Second operand has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 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:01:43,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:01:43,081 INFO L93 Difference]: Finished difference Result 24023 states and 25475 transitions. [2024-11-06 20:01:43,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:01:43,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 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 548 [2024-11-06 20:01:43,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:01:43,099 INFO L225 Difference]: With dead ends: 24023 [2024-11-06 20:01:43,099 INFO L226 Difference]: Without dead ends: 13822 [2024-11-06 20:01:43,107 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:01:43,108 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 190 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 769 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 855 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 769 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:01:43,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 38 Invalid, 855 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 769 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 20:01:43,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13822 states. [2024-11-06 20:01:43,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13822 to 13164. [2024-11-06 20:01:43,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13163 states have (on average 1.055306541062068) internal successors, (13891), 13163 states have internal predecessors, (13891), 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:01:43,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13891 transitions. [2024-11-06 20:01:43,258 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13891 transitions. Word has length 548 [2024-11-06 20:01:43,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:01:43,258 INFO L471 AbstractCegarLoop]: Abstraction has 13164 states and 13891 transitions. [2024-11-06 20:01:43,258 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 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:01:43,258 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13891 transitions. [2024-11-06 20:01:43,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 603 [2024-11-06 20:01:43,264 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:01:43,265 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:01:43,265 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 20:01:43,265 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:01:43,265 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:01:43,265 INFO L85 PathProgramCache]: Analyzing trace with hash -131073, now seen corresponding path program 1 times [2024-11-06 20:01:43,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:01:43,265 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124633863] [2024-11-06 20:01:43,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:01:43,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:01:43,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:01:43,751 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 568 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-06 20:01:43,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:01:43,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124633863] [2024-11-06 20:01:43,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124633863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:01:43,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:01:43,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:01:43,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1098589643] [2024-11-06 20:01:43,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:01:43,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:01:43,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:01:43,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:01:43,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:01:43,753 INFO L87 Difference]: Start difference. First operand 13164 states and 13891 transitions. Second operand has 4 states, 4 states have (on average 138.75) internal successors, (555), 3 states have internal predecessors, (555), 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:01:44,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:01:44,482 INFO L93 Difference]: Finished difference Result 25668 states and 27112 transitions. [2024-11-06 20:01:44,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:01:44,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 3 states have internal predecessors, (555), 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 602 [2024-11-06 20:01:44,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:01:44,496 INFO L225 Difference]: With dead ends: 25668 [2024-11-06 20:01:44,496 INFO L226 Difference]: Without dead ends: 13164 [2024-11-06 20:01:44,505 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:01:44,506 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 173 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 1189 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 1193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 1189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 20:01:44,506 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 118 Invalid, 1193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 1189 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 20:01:44,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2024-11-06 20:01:44,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 13164. [2024-11-06 20:01:44,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13163 states have (on average 1.0550026589683204) internal successors, (13887), 13163 states have internal predecessors, (13887), 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:01:44,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13887 transitions. [2024-11-06 20:01:44,613 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13887 transitions. Word has length 602 [2024-11-06 20:01:44,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:01:44,613 INFO L471 AbstractCegarLoop]: Abstraction has 13164 states and 13887 transitions. [2024-11-06 20:01:44,613 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 138.75) internal successors, (555), 3 states have internal predecessors, (555), 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:01:44,613 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13887 transitions. [2024-11-06 20:01:44,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 664 [2024-11-06 20:01:44,618 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:01:44,618 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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:01:44,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 20:01:44,618 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:01:44,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:01:44,619 INFO L85 PathProgramCache]: Analyzing trace with hash -279212467, now seen corresponding path program 1 times [2024-11-06 20:01:44,620 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:01:44,620 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294052651] [2024-11-06 20:01:44,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:01:44,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:01:44,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:01:44,901 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 535 trivial. 0 not checked. [2024-11-06 20:01:44,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:01:44,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294052651] [2024-11-06 20:01:44,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1294052651] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:01:44,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:01:44,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:01:44,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1676394394] [2024-11-06 20:01:44,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:01:44,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:01:44,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:01:44,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:01:44,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:01:44,904 INFO L87 Difference]: Start difference. First operand 13164 states and 13887 transitions. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:01:45,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:01:45,424 INFO L93 Difference]: Finished difference Result 25668 states and 27108 transitions. [2024-11-06 20:01:45,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:01:45,424 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 663 [2024-11-06 20:01:45,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:01:45,437 INFO L225 Difference]: With dead ends: 25668 [2024-11-06 20:01:45,437 INFO L226 Difference]: Without dead ends: 13164 [2024-11-06 20:01:45,446 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:01:45,447 INFO L432 NwaCegarLoop]: 421 mSDtfsCounter, 297 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 744 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 427 SdHoareTripleChecker+Invalid, 774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 744 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:01:45,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 427 Invalid, 774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 744 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 20:01:45,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2024-11-06 20:01:45,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 11848. [2024-11-06 20:01:45,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11848 states, 11847 states have (on average 1.052924791086351) internal successors, (12474), 11847 states have internal predecessors, (12474), 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:01:45,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 12474 transitions. [2024-11-06 20:01:45,589 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 12474 transitions. Word has length 663 [2024-11-06 20:01:45,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:01:45,590 INFO L471 AbstractCegarLoop]: Abstraction has 11848 states and 12474 transitions. [2024-11-06 20:01:45,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:01:45,590 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 12474 transitions. [2024-11-06 20:01:45,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 853 [2024-11-06 20:01:45,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:01:45,603 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, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:01:45,603 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 20:01:45,603 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:01:45,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:01:45,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1028058416, now seen corresponding path program 1 times [2024-11-06 20:01:45,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:01:45,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [612132012] [2024-11-06 20:01:45,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:01:45,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:01:45,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:01:46,043 INFO L134 CoverageAnalysis]: Checked inductivity of 1346 backedges. 925 proven. 0 refuted. 0 times theorem prover too weak. 421 trivial. 0 not checked. [2024-11-06 20:01:46,043 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:01:46,043 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [612132012] [2024-11-06 20:01:46,043 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [612132012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:01:46,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:01:46,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:01:46,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180897061] [2024-11-06 20:01:46,044 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:01:46,044 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:01:46,044 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:01:46,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:01:46,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:01:46,045 INFO L87 Difference]: Start difference. First operand 11848 states and 12474 transitions. Second operand has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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:01:46,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:01:46,608 INFO L93 Difference]: Finished difference Result 25997 states and 27429 transitions. [2024-11-06 20:01:46,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:01:46,608 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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 852 [2024-11-06 20:01:46,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:01:46,619 INFO L225 Difference]: With dead ends: 25997 [2024-11-06 20:01:46,619 INFO L226 Difference]: Without dead ends: 14809 [2024-11-06 20:01:46,626 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:01:46,626 INFO L432 NwaCegarLoop]: 437 mSDtfsCounter, 192 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 780 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:01:46,626 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 443 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 780 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 20:01:46,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14809 states. [2024-11-06 20:01:46,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14809 to 14151. [2024-11-06 20:01:46,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14151 states, 14150 states have (on average 1.0501766784452298) internal successors, (14860), 14150 states have internal predecessors, (14860), 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:01:46,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14151 states to 14151 states and 14860 transitions. [2024-11-06 20:01:46,718 INFO L78 Accepts]: Start accepts. Automaton has 14151 states and 14860 transitions. Word has length 852 [2024-11-06 20:01:46,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:01:46,719 INFO L471 AbstractCegarLoop]: Abstraction has 14151 states and 14860 transitions. [2024-11-06 20:01:46,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 166.33333333333334) internal successors, (499), 3 states have internal predecessors, (499), 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:01:46,719 INFO L276 IsEmpty]: Start isEmpty. Operand 14151 states and 14860 transitions. [2024-11-06 20:01:46,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 862 [2024-11-06 20:01:46,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:01:46,727 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:01:46,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 20:01:46,727 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:01:46,727 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:01:46,728 INFO L85 PathProgramCache]: Analyzing trace with hash 713403652, now seen corresponding path program 1 times [2024-11-06 20:01:46,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:01:46,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766300825] [2024-11-06 20:01:46,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:01:46,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:01:46,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:01:47,073 INFO L134 CoverageAnalysis]: Checked inductivity of 1114 backedges. 191 proven. 0 refuted. 0 times theorem prover too weak. 923 trivial. 0 not checked. [2024-11-06 20:01:47,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:01:47,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766300825] [2024-11-06 20:01:47,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766300825] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:01:47,074 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:01:47,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:01:47,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [939443276] [2024-11-06 20:01:47,074 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:01:47,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:01:47,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:01:47,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:01:47,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:01:47,075 INFO L87 Difference]: Start difference. First operand 14151 states and 14860 transitions. Second operand has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:01:47,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:01:47,662 INFO L93 Difference]: Finished difference Result 33564 states and 35371 transitions. [2024-11-06 20:01:47,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:01:47,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 861 [2024-11-06 20:01:47,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:01:47,679 INFO L225 Difference]: With dead ends: 33564 [2024-11-06 20:01:47,679 INFO L226 Difference]: Without dead ends: 17770 [2024-11-06 20:01:47,688 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:01:47,688 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 289 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 840 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:01:47,688 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 430 Invalid, 840 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 20:01:47,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17770 states. [2024-11-06 20:01:47,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17770 to 17112. [2024-11-06 20:01:47,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17112 states, 17111 states have (on average 1.0403833791128514) internal successors, (17802), 17111 states have internal predecessors, (17802), 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:01:47,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17112 states to 17112 states and 17802 transitions. [2024-11-06 20:01:47,805 INFO L78 Accepts]: Start accepts. Automaton has 17112 states and 17802 transitions. Word has length 861 [2024-11-06 20:01:47,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:01:47,806 INFO L471 AbstractCegarLoop]: Abstraction has 17112 states and 17802 transitions. [2024-11-06 20:01:47,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.0) internal successors, (312), 3 states have internal predecessors, (312), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:01:47,806 INFO L276 IsEmpty]: Start isEmpty. Operand 17112 states and 17802 transitions. [2024-11-06 20:01:47,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1078 [2024-11-06 20:01:47,817 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:01:47,817 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, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:01:47,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 20:01:47,818 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:01:47,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:01:47,818 INFO L85 PathProgramCache]: Analyzing trace with hash -723490929, now seen corresponding path program 1 times [2024-11-06 20:01:47,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:01:47,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015692347] [2024-11-06 20:01:47,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:01:47,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:01:47,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:01:48,837 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 690 proven. 799 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2024-11-06 20:01:48,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:01:48,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015692347] [2024-11-06 20:01:48,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015692347] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:01:48,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951641852] [2024-11-06 20:01:48,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:01:48,838 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:01:48,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:01:48,839 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:01:48,841 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:01:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:01:49,088 INFO L255 TraceCheckSpWp]: Trace formula consists of 1240 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 20:01:49,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 20:01:49,467 INFO L134 CoverageAnalysis]: Checked inductivity of 1855 backedges. 1057 proven. 0 refuted. 0 times theorem prover too weak. 798 trivial. 0 not checked. [2024-11-06 20:01:49,467 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 20:01:49,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951641852] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:01:49,467 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 20:01:49,467 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-06 20:01:49,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440559377] [2024-11-06 20:01:49,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:01:49,468 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:01:49,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:01:49,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:01:49,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 20:01:49,469 INFO L87 Difference]: Start difference. First operand 17112 states and 17802 transitions. Second operand has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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:01:49,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:01:49,999 INFO L93 Difference]: Finished difference Result 33564 states and 34938 transitions. [2024-11-06 20:01:49,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:01:50,000 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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 1077 [2024-11-06 20:01:50,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:01:50,014 INFO L225 Difference]: With dead ends: 33564 [2024-11-06 20:01:50,014 INFO L226 Difference]: Without dead ends: 17112 [2024-11-06 20:01:50,023 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1081 GetRequests, 1077 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 20:01:50,024 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 94 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:01:50,024 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [94 Valid, 377 Invalid, 788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 770 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 20:01:50,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17112 states. [2024-11-06 20:01:50,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17112 to 17112. [2024-11-06 20:01:50,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17112 states, 17111 states have (on average 1.0351236046987318) internal successors, (17712), 17111 states have internal predecessors, (17712), 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:01:50,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17112 states to 17112 states and 17712 transitions. [2024-11-06 20:01:50,136 INFO L78 Accepts]: Start accepts. Automaton has 17112 states and 17712 transitions. Word has length 1077 [2024-11-06 20:01:50,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:01:50,137 INFO L471 AbstractCegarLoop]: Abstraction has 17112 states and 17712 transitions. [2024-11-06 20:01:50,137 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 173.66666666666666) internal successors, (521), 3 states have internal predecessors, (521), 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:01:50,137 INFO L276 IsEmpty]: Start isEmpty. Operand 17112 states and 17712 transitions. [2024-11-06 20:01:50,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1135 [2024-11-06 20:01:50,148 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:01:50,149 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:01:50,162 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:01:50,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-06 20:01:50,349 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:01:50,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:01:50,350 INFO L85 PathProgramCache]: Analyzing trace with hash 1714657460, now seen corresponding path program 1 times [2024-11-06 20:01:50,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:01:50,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1927829229] [2024-11-06 20:01:50,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:01:50,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:01:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:01:50,771 INFO L134 CoverageAnalysis]: Checked inductivity of 2547 backedges. 1790 proven. 0 refuted. 0 times theorem prover too weak. 757 trivial. 0 not checked. [2024-11-06 20:01:50,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:01:50,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1927829229] [2024-11-06 20:01:50,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1927829229] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:01:50,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:01:50,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:01:50,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1276600834] [2024-11-06 20:01:50,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:01:50,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:01:50,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:01:50,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:01:50,773 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:01:50,773 INFO L87 Difference]: Start difference. First operand 17112 states and 17712 transitions. Second operand has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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:01:51,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:01:51,333 INFO L93 Difference]: Finished difference Result 33564 states and 34758 transitions. [2024-11-06 20:01:51,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:01:51,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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 1134 [2024-11-06 20:01:51,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:01:51,346 INFO L225 Difference]: With dead ends: 33564 [2024-11-06 20:01:51,346 INFO L226 Difference]: Without dead ends: 17112 [2024-11-06 20:01:51,355 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:01:51,355 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 220 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 220 SdHoareTripleChecker+Valid, 428 SdHoareTripleChecker+Invalid, 799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:01:51,355 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [220 Valid, 428 Invalid, 799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 20:01:51,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17112 states. [2024-11-06 20:01:51,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17112 to 15796. [2024-11-06 20:01:51,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15796 states, 15795 states have (on average 1.0302627413738525) internal successors, (16273), 15795 states have internal predecessors, (16273), 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:01:51,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15796 states to 15796 states and 16273 transitions. [2024-11-06 20:01:51,457 INFO L78 Accepts]: Start accepts. Automaton has 15796 states and 16273 transitions. Word has length 1134 [2024-11-06 20:01:51,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:01:51,458 INFO L471 AbstractCegarLoop]: Abstraction has 15796 states and 16273 transitions. [2024-11-06 20:01:51,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 203.33333333333334) internal successors, (610), 3 states have internal predecessors, (610), 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:01:51,458 INFO L276 IsEmpty]: Start isEmpty. Operand 15796 states and 16273 transitions. [2024-11-06 20:01:51,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1136 [2024-11-06 20:01:51,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:01:51,470 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:01:51,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-06 20:01:51,470 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:01:51,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:01:51,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1069375333, now seen corresponding path program 1 times [2024-11-06 20:01:51,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:01:51,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669553795] [2024-11-06 20:01:51,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:01:51,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:01:51,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:01:51,910 INFO L134 CoverageAnalysis]: Checked inductivity of 2553 backedges. 740 proven. 0 refuted. 0 times theorem prover too weak. 1813 trivial. 0 not checked. [2024-11-06 20:01:51,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:01:51,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669553795] [2024-11-06 20:01:51,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1669553795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:01:51,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:01:51,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:01:51,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [538282167] [2024-11-06 20:01:51,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:01:51,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:01:51,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:01:51,912 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:01:51,912 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:01:51,912 INFO L87 Difference]: Start difference. First operand 15796 states and 16273 transitions. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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:01:52,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:01:52,474 INFO L93 Difference]: Finished difference Result 33893 states and 34974 transitions. [2024-11-06 20:01:52,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:01:52,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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 1135 [2024-11-06 20:01:52,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:01:52,486 INFO L225 Difference]: With dead ends: 33893 [2024-11-06 20:01:52,486 INFO L226 Difference]: Without dead ends: 16454 [2024-11-06 20:01:52,494 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:01:52,495 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 274 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 755 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 755 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:01:52,495 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 411 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 755 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 20:01:52,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16454 states. [2024-11-06 20:01:52,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16454 to 13822. [2024-11-06 20:01:52,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13822 states, 13821 states have (on average 1.0260473192967223) internal successors, (14181), 13821 states have internal predecessors, (14181), 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:01:52,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14181 transitions. [2024-11-06 20:01:52,634 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 14181 transitions. Word has length 1135 [2024-11-06 20:01:52,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:01:52,636 INFO L471 AbstractCegarLoop]: Abstraction has 13822 states and 14181 transitions. [2024-11-06 20:01:52,636 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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:01:52,636 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 14181 transitions. [2024-11-06 20:01:52,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1264 [2024-11-06 20:01:52,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:01:52,659 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:01:52,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-06 20:01:52,660 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:01:52,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:01:52,660 INFO L85 PathProgramCache]: Analyzing trace with hash 483265182, now seen corresponding path program 1 times [2024-11-06 20:01:52,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:01:52,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826755793] [2024-11-06 20:01:52,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:01:52,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:01:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:01:53,655 INFO L134 CoverageAnalysis]: Checked inductivity of 2873 backedges. 2049 proven. 0 refuted. 0 times theorem prover too weak. 824 trivial. 0 not checked. [2024-11-06 20:01:53,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:01:53,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826755793] [2024-11-06 20:01:53,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826755793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:01:53,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:01:53,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 20:01:53,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177211928] [2024-11-06 20:01:53,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:01:53,656 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 20:01:53,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:01:53,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 20:01:53,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-06 20:01:53,657 INFO L87 Difference]: Start difference. First operand 13822 states and 14181 transitions. Second operand has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 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:01:54,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:01:54,349 INFO L93 Difference]: Finished difference Result 26985 states and 27697 transitions. [2024-11-06 20:01:54,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 20:01:54,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 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 1263 [2024-11-06 20:01:54,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:01:54,358 INFO L225 Difference]: With dead ends: 26985 [2024-11-06 20:01:54,358 INFO L226 Difference]: Without dead ends: 13823 [2024-11-06 20:01:54,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-06 20:01:54,364 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 357 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 1478 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 357 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 1478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:01:54,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [357 Valid, 554 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 1478 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 20:01:54,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13823 states. [2024-11-06 20:01:54,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13823 to 13822. [2024-11-06 20:01:54,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13822 states, 13821 states have (on average 1.02575790463787) internal successors, (14177), 13821 states have internal predecessors, (14177), 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:01:54,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14177 transitions. [2024-11-06 20:01:54,439 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 14177 transitions. Word has length 1263 [2024-11-06 20:01:54,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:01:54,439 INFO L471 AbstractCegarLoop]: Abstraction has 13822 states and 14177 transitions. [2024-11-06 20:01:54,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.16666666666667) internal successors, (733), 6 states have internal predecessors, (733), 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:01:54,439 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 14177 transitions. [2024-11-06 20:01:54,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1278 [2024-11-06 20:01:54,451 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:01:54,451 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, 7, 7, 7, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:01:54,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-06 20:01:54,451 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:01:54,452 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:01:54,452 INFO L85 PathProgramCache]: Analyzing trace with hash 2005899029, now seen corresponding path program 1 times [2024-11-06 20:01:54,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:01:54,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319170194] [2024-11-06 20:01:54,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:01:54,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:01:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:01:55,447 INFO L134 CoverageAnalysis]: Checked inductivity of 2750 backedges. 1963 proven. 0 refuted. 0 times theorem prover too weak. 787 trivial. 0 not checked. [2024-11-06 20:01:55,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:01:55,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319170194] [2024-11-06 20:01:55,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319170194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:01:55,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:01:55,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 20:01:55,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632713433] [2024-11-06 20:01:55,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:01:55,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:01:55,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:01:55,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:01:55,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:01:55,448 INFO L87 Difference]: Start difference. First operand 13822 states and 14177 transitions. Second operand has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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:01:56,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:01:56,122 INFO L93 Difference]: Finished difference Result 26994 states and 27698 transitions. [2024-11-06 20:01:56,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 20:01:56,123 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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 1277 [2024-11-06 20:01:56,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:01:56,133 INFO L225 Difference]: With dead ends: 26994 [2024-11-06 20:01:56,133 INFO L226 Difference]: Without dead ends: 13832 [2024-11-06 20:01:56,138 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 20:01:56,139 INFO L432 NwaCegarLoop]: 422 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1315 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 1338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1315 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:01:56,139 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 436 Invalid, 1338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1315 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 20:01:56,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13832 states. [2024-11-06 20:01:56,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13832 to 13822. [2024-11-06 20:01:56,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13822 states, 13821 states have (on average 1.0254684899790174) internal successors, (14173), 13821 states have internal predecessors, (14173), 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:01:56,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14173 transitions. [2024-11-06 20:01:56,212 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 14173 transitions. Word has length 1277 [2024-11-06 20:01:56,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:01:56,212 INFO L471 AbstractCegarLoop]: Abstraction has 13822 states and 14173 transitions. [2024-11-06 20:01:56,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.0) internal successors, (732), 4 states have internal predecessors, (732), 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:01:56,213 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 14173 transitions. [2024-11-06 20:01:56,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1293 [2024-11-06 20:01:56,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:01:56,223 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:01:56,224 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-06 20:01:56,224 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:01:56,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:01:56,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1518616663, now seen corresponding path program 1 times [2024-11-06 20:01:56,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:01:56,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [424638719] [2024-11-06 20:01:56,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:01:56,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:01:56,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:01:57,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3565 backedges. 2104 proven. 0 refuted. 0 times theorem prover too weak. 1461 trivial. 0 not checked. [2024-11-06 20:01:57,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:01:57,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [424638719] [2024-11-06 20:01:57,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [424638719] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:01:57,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:01:57,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:01:57,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564568514] [2024-11-06 20:01:57,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:01:57,160 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:01:57,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:01:57,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:01:57,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:01:57,161 INFO L87 Difference]: Start difference. First operand 13822 states and 14173 transitions. Second operand has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 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:01:57,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:01:57,686 INFO L93 Difference]: Finished difference Result 27642 states and 28346 transitions. [2024-11-06 20:01:57,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:01:57,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 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 1292 [2024-11-06 20:01:57,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:01:57,699 INFO L225 Difference]: With dead ends: 27642 [2024-11-06 20:01:57,699 INFO L226 Difference]: Without dead ends: 14480 [2024-11-06 20:01:57,707 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:01:57,707 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:01:57,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 430 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 20:01:57,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2024-11-06 20:01:57,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 14480. [2024-11-06 20:01:57,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14480 states, 14479 states have (on average 1.0245873333793771) internal successors, (14835), 14479 states have internal predecessors, (14835), 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:01:57,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14480 states to 14480 states and 14835 transitions. [2024-11-06 20:01:57,859 INFO L78 Accepts]: Start accepts. Automaton has 14480 states and 14835 transitions. Word has length 1292 [2024-11-06 20:01:57,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:01:57,860 INFO L471 AbstractCegarLoop]: Abstraction has 14480 states and 14835 transitions. [2024-11-06 20:01:57,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 190.33333333333334) internal successors, (571), 3 states have internal predecessors, (571), 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:01:57,860 INFO L276 IsEmpty]: Start isEmpty. Operand 14480 states and 14835 transitions. [2024-11-06 20:01:57,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1318 [2024-11-06 20:01:57,873 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:01:57,873 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:01:57,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-06 20:01:57,874 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:01:57,874 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:01:57,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1263037269, now seen corresponding path program 1 times [2024-11-06 20:01:57,875 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:01:57,875 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813783260] [2024-11-06 20:01:57,875 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:01:57,876 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:01:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:01:58,681 INFO L134 CoverageAnalysis]: Checked inductivity of 3116 backedges. 2159 proven. 0 refuted. 0 times theorem prover too weak. 957 trivial. 0 not checked. [2024-11-06 20:01:58,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:01:58,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813783260] [2024-11-06 20:01:58,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813783260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:01:58,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:01:58,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 20:01:58,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667908120] [2024-11-06 20:01:58,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:01:58,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:01:58,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:01:58,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:01:58,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:01:58,683 INFO L87 Difference]: Start difference. First operand 14480 states and 14835 transitions. Second operand has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 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:01:59,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:01:59,346 INFO L93 Difference]: Finished difference Result 28300 states and 29004 transitions. [2024-11-06 20:01:59,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:01:59,346 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 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 1317 [2024-11-06 20:01:59,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:01:59,356 INFO L225 Difference]: With dead ends: 28300 [2024-11-06 20:01:59,356 INFO L226 Difference]: Without dead ends: 14480 [2024-11-06 20:01:59,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 20:01:59,363 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 120 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:01:59,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 553 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 20:01:59,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2024-11-06 20:01:59,424 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 14480. [2024-11-06 20:01:59,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14480 states, 14479 states have (on average 1.0238966779473722) internal successors, (14825), 14479 states have internal predecessors, (14825), 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:01:59,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14480 states to 14480 states and 14825 transitions. [2024-11-06 20:01:59,441 INFO L78 Accepts]: Start accepts. Automaton has 14480 states and 14825 transitions. Word has length 1317 [2024-11-06 20:01:59,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:01:59,441 INFO L471 AbstractCegarLoop]: Abstraction has 14480 states and 14825 transitions. [2024-11-06 20:01:59,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 183.25) internal successors, (733), 4 states have internal predecessors, (733), 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:01:59,442 INFO L276 IsEmpty]: Start isEmpty. Operand 14480 states and 14825 transitions. [2024-11-06 20:01:59,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1347 [2024-11-06 20:01:59,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:01:59,453 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:01:59,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-06 20:01:59,454 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:01:59,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:01:59,454 INFO L85 PathProgramCache]: Analyzing trace with hash -832906628, now seen corresponding path program 1 times [2024-11-06 20:01:59,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:01:59,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [419083712] [2024-11-06 20:01:59,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:01:59,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:01:59,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:02:00,377 INFO L134 CoverageAnalysis]: Checked inductivity of 3584 backedges. 856 proven. 0 refuted. 0 times theorem prover too weak. 2728 trivial. 0 not checked. [2024-11-06 20:02:00,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:02:00,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [419083712] [2024-11-06 20:02:00,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [419083712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:02:00,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:02:00,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:02:00,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536407555] [2024-11-06 20:02:00,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:02:00,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:02:00,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:02:00,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:02:00,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:00,379 INFO L87 Difference]: Start difference. First operand 14480 states and 14825 transitions. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 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:02:00,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:02:00,890 INFO L93 Difference]: Finished difference Result 28629 states and 29317 transitions. [2024-11-06 20:02:00,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:02:00,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 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 1346 [2024-11-06 20:02:00,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:02:00,906 INFO L225 Difference]: With dead ends: 28629 [2024-11-06 20:02:00,906 INFO L226 Difference]: Without dead ends: 14480 [2024-11-06 20:02:00,912 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:02:00,913 INFO L432 NwaCegarLoop]: 363 mSDtfsCounter, 271 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 368 SdHoareTripleChecker+Invalid, 821 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:02:00,913 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [271 Valid, 368 Invalid, 821 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 20:02:00,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2024-11-06 20:02:00,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 13822. [2024-11-06 20:02:00,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13822 states, 13821 states have (on average 1.0204760871138123) internal successors, (14104), 13821 states have internal predecessors, (14104), 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:02:01,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14104 transitions. [2024-11-06 20:02:01,001 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 14104 transitions. Word has length 1346 [2024-11-06 20:02:01,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:02:01,001 INFO L471 AbstractCegarLoop]: Abstraction has 13822 states and 14104 transitions. [2024-11-06 20:02:01,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 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:02:01,001 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 14104 transitions. [2024-11-06 20:02:01,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1445 [2024-11-06 20:02:01,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:02:01,015 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:02:01,015 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-06 20:02:01,015 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:02:01,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:02:01,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1292040295, now seen corresponding path program 1 times [2024-11-06 20:02:01,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:02:01,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824908743] [2024-11-06 20:02:01,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:02:01,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:02:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:02:01,746 INFO L134 CoverageAnalysis]: Checked inductivity of 4057 backedges. 1281 proven. 0 refuted. 0 times theorem prover too weak. 2776 trivial. 0 not checked. [2024-11-06 20:02:01,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:02:01,746 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824908743] [2024-11-06 20:02:01,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824908743] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:02:01,746 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:02:01,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:02:01,746 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005336813] [2024-11-06 20:02:01,746 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:02:01,747 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:02:01,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:02:01,747 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:02:01,747 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:01,747 INFO L87 Difference]: Start difference. First operand 13822 states and 14104 transitions. Second operand has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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:02:02,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:02:02,260 INFO L93 Difference]: Finished difference Result 26982 states and 27543 transitions. [2024-11-06 20:02:02,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:02:02,261 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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 1444 [2024-11-06 20:02:02,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:02:02,262 INFO L225 Difference]: With dead ends: 26982 [2024-11-06 20:02:02,262 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 20:02:02,269 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:02:02,270 INFO L432 NwaCegarLoop]: 408 mSDtfsCounter, 168 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:02:02,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 413 Invalid, 785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 20:02:02,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 20:02:02,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 20:02:02,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 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:02:02,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 20:02:02,271 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1444 [2024-11-06 20:02:02,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:02:02,271 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 20:02:02,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 140.66666666666666) internal successors, (422), 3 states have internal predecessors, (422), 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:02:02,271 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 20:02:02,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 20:02:02,273 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 20:02:02,273 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-06 20:02:02,275 INFO L407 BasicCegarLoop]: Path program histogram: [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:02:02,276 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 20:02:03,199 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 20:02:03,221 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 08:02:03 BoogieIcfgContainer [2024-11-06 20:02:03,221 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 20:02:03,222 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 20:02:03,222 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 20:02:03,222 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 20:02:03,223 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:01:29" (3/4) ... [2024-11-06 20:02:03,224 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 20:02:03,247 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-06 20:02:03,248 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 20:02:03,250 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 20:02:03,251 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 20:02:03,361 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 20:02:03,362 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 20:02:03,362 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 20:02:03,366 INFO L158 Benchmark]: Toolchain (without parser) took 36285.93ms. Allocated memory was 109.1MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 80.1MB in the beginning and 766.8MB in the end (delta: -686.8MB). Peak memory consumption was 969.4MB. Max. memory is 16.1GB. [2024-11-06 20:02:03,366 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 20:02:03,366 INFO L158 Benchmark]: CACSL2BoogieTranslator took 510.09ms. Allocated memory is still 109.1MB. Free memory was 79.9MB in the beginning and 65.8MB in the end (delta: 14.1MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. [2024-11-06 20:02:03,366 INFO L158 Benchmark]: Boogie Procedure Inliner took 96.40ms. Allocated memory is still 109.1MB. Free memory was 65.8MB in the beginning and 42.5MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-06 20:02:03,367 INFO L158 Benchmark]: Boogie Preprocessor took 178.39ms. Allocated memory is still 109.1MB. Free memory was 42.5MB in the beginning and 40.4MB in the end (delta: 2.2MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. [2024-11-06 20:02:03,367 INFO L158 Benchmark]: RCFGBuilder took 1618.09ms. Allocated memory was 109.1MB in the beginning and 192.9MB in the end (delta: 83.9MB). Free memory was 40.4MB in the beginning and 49.8MB in the end (delta: -9.4MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. [2024-11-06 20:02:03,367 INFO L158 Benchmark]: TraceAbstraction took 33737.65ms. Allocated memory was 192.9MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 49.8MB in the beginning and 787.8MB in the end (delta: -738.0MB). Peak memory consumption was 829.2MB. Max. memory is 16.1GB. [2024-11-06 20:02:03,367 INFO L158 Benchmark]: Witness Printer took 139.99ms. Allocated memory is still 1.8GB. Free memory was 787.8MB in the beginning and 766.8MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-06 20:02:03,368 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 83.9MB. Free memory is still 47.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 510.09ms. Allocated memory is still 109.1MB. Free memory was 79.9MB in the beginning and 65.8MB in the end (delta: 14.1MB). Peak memory consumption was 58.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 96.40ms. Allocated memory is still 109.1MB. Free memory was 65.8MB in the beginning and 42.5MB in the end (delta: 23.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 178.39ms. Allocated memory is still 109.1MB. Free memory was 42.5MB in the beginning and 40.4MB in the end (delta: 2.2MB). Peak memory consumption was 18.7MB. Max. memory is 16.1GB. * RCFGBuilder took 1618.09ms. Allocated memory was 109.1MB in the beginning and 192.9MB in the end (delta: 83.9MB). Free memory was 40.4MB in the beginning and 49.8MB in the end (delta: -9.4MB). Peak memory consumption was 92.3MB. Max. memory is 16.1GB. * TraceAbstraction took 33737.65ms. Allocated memory was 192.9MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 49.8MB in the beginning and 787.8MB in the end (delta: -738.0MB). Peak memory consumption was 829.2MB. Max. memory is 16.1GB. * Witness Printer took 139.99ms. Allocated memory is still 1.8GB. Free memory was 787.8MB in the beginning and 766.8MB in the end (delta: 21.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 167]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 396 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.7s, OverallIterations: 23, TraceHistogramMax: 9, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.2s, AutomataDifference: 18.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 5408 SdHoareTripleChecker+Valid, 16.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5408 mSDsluCounter, 7210 SdHoareTripleChecker+Invalid, 13.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 475 mSDsCounter, 2570 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 23462 IncrementalHoareTripleChecker+Invalid, 26032 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2570 mSolverCounterUnsat, 6735 mSDtfsCounter, 23462 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1161 GetRequests, 1119 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=17112occurred in iteration=14, InterpolantAutomatonStates: 81, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 23 MinimizatonAttempts, 8238 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 10.2s InterpolantComputationTime, 18418 NumberOfCodeBlocks, 18418 NumberOfCodeBlocksAsserted, 24 NumberOfCheckSat, 18394 ConstructedInterpolants, 0 QuantifiedInterpolants, 43618 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1240 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 24 InterpolantComputations, 23 PerfectInterpolantSequences, 33343/34142 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1783]: Loop Invariant Derived loop invariant: (((((((((((((((((((((((((((((((a16 == 9) && (7 == a12)) || ((((0 <= ((long long) 87 + a18)) && (a16 == 8)) && (5 != a12)) && (a12 <= 6))) || ((((a15 <= 3) && (a12 == 8)) && (((long long) a18 + 156) <= 0)) && (a16 <= 11))) || ((((a16 == 11) && (5 == a12)) && (((long long) 87 + a18) == 0)) && (a15 == 3))) || ((((5 == a12) && (a16 <= 11)) && (a15 == 3)) && (83 <= a18))) || (((a12 == 9) && (a15 <= 3)) && (a16 == 12))) || (((a16 == 9) && (a12 <= 6)) && (4 <= a15))) || ((((0 <= ((long long) 87 + a18)) && (a15 <= 3)) && (a12 == 8)) && (a16 <= 11))) || ((a12 == 9) && (a16 == 9))) || (((a12 <= 5) && (a16 == 10)) && (4 <= a15))) || (((a16 == 8) && (a15 == 4)) && (7 == a12))) || (((a15 <= 3) && (a16 <= 11)) && (7 == a12))) || ((((a16 == 8) && (a15 == 4)) && (((long long) a18 + 388559) <= 0)) && (a12 == 6))) || (((0 <= ((long long) 87 + a18)) && (a16 == 8)) && (a15 <= 3))) || (((a12 == 9) && (a15 <= 3)) && (a16 <= 11))) || (((((a15 <= 3) && (5 != a12)) && (((long long) 87 + a18) == 0)) && (a12 <= 6)) && (a16 <= 11))) || (((a16 == 8) && (a12 == 8)) && (((long long) a18 + 156) <= 0))) || ((((0 <= ((long long) 87 + a18)) && (a16 == 10)) && (5 == a12)) && (a15 == 3))) || ((a16 == 9) && (a12 == 8))) || (((a16 == 10) && (5 != a12)) && (a12 <= 6))) || (((a15 <= 3) && (a16 == 12)) && (7 == a12))) || ((a12 == 9) && (a16 == 8))) || (((a16 == 10) && (a15 <= 3)) && (a12 == 8))) || (((a16 == 9) && (5 == a12)) && (a15 == 3))) || (((a16 == 8) && (a15 == 4)) && (5 == a12))) || (((a15 <= 3) && (a12 == 8)) && (a16 == 12))) || (((a16 == 8) && (a15 <= 3)) && (a12 <= 6))) || (((0 <= ((long long) 87 + a18)) && (a16 == 8)) && (a12 == 8))) || (((((0 <= ((long long) 87 + a18)) && (a15 <= 3)) && (5 != a12)) && (a16 == 12)) && (a12 <= 6))) || (((a16 == 12) && (5 == a12)) && (a15 == 3))) RESULT: Ultimate proved your program to be correct! [2024-11-06 20:02:03,387 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE