./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem18_label53.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/Problem18_label53.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', 'ebf26144b3df28ed990f2940c4e319958e06d81ae8ebc1404d0a5715fd076f97'] 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/Problem18_label53.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 ebf26144b3df28ed990f2940c4e319958e06d81ae8ebc1404d0a5715fd076f97 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 20:14:42,045 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 20:14:42,120 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:14:42,124 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 20:14:42,126 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 20:14:42,148 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 20:14:42,149 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 20:14:42,149 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 20:14:42,149 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 20:14:42,149 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 20:14:42,149 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 20:14:42,150 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 20:14:42,150 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 20:14:42,150 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 20:14:42,150 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 20:14:42,150 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 20:14:42,150 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 20:14:42,150 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 20:14:42,150 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 20:14:42,151 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 20:14:42,151 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 20:14:42,151 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 20:14:42,151 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 20:14:42,151 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 20:14:42,151 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 20:14:42,151 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 20:14:42,151 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 20:14:42,151 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 20:14:42,151 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 20:14:42,151 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 20:14:42,152 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 20:14:42,152 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 20:14:42,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:14:42,152 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 20:14:42,152 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 20:14:42,152 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 20:14:42,152 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 20:14:42,152 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 20:14:42,152 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 20:14:42,152 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 20:14:42,152 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 20:14:42,152 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 20:14:42,153 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 -> ebf26144b3df28ed990f2940c4e319958e06d81ae8ebc1404d0a5715fd076f97 [2024-11-06 20:14:42,377 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 20:14:42,385 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 20:14:42,387 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 20:14:42,388 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 20:14:42,388 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 20:14:42,390 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem18_label53.c [2024-11-06 20:14:43,509 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 20:14:43,919 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 20:14:43,920 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem18_label53.c [2024-11-06 20:14:43,946 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6cae1c48/42ae63dcc51240a58e4e4cc8559b657e/FLAGb60386784 [2024-11-06 20:14:44,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f6cae1c48/42ae63dcc51240a58e4e4cc8559b657e [2024-11-06 20:14:44,098 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 20:14:44,099 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 20:14:44,101 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 20:14:44,101 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 20:14:44,104 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 20:14:44,105 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:14:44" (1/1) ... [2024-11-06 20:14:44,106 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27ba55ec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:44, skipping insertion in model container [2024-11-06 20:14:44,106 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:14:44" (1/1) ... [2024-11-06 20:14:44,171 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 20:14:44,318 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/Problem18_label53.c[3698,3711] [2024-11-06 20:14:44,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:14:44,676 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 20:14:44,688 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/Problem18_label53.c[3698,3711] [2024-11-06 20:14:44,868 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:14:44,885 INFO L204 MainTranslator]: Completed translation [2024-11-06 20:14:44,886 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:44 WrapperNode [2024-11-06 20:14:44,886 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 20:14:44,887 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 20:14:44,887 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 20:14:44,888 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 20:14:44,892 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:14:44" (1/1) ... [2024-11-06 20:14:44,936 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:14:44" (1/1) ... [2024-11-06 20:14:45,135 INFO L138 Inliner]: procedures = 16, calls = 10, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 4135 [2024-11-06 20:14:45,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 20:14:45,141 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 20:14:45,141 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 20:14:45,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 20:14:45,155 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:44" (1/1) ... [2024-11-06 20:14:45,155 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:44" (1/1) ... [2024-11-06 20:14:45,176 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:44" (1/1) ... [2024-11-06 20:14:45,265 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:14:45,265 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:44" (1/1) ... [2024-11-06 20:14:45,266 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:44" (1/1) ... [2024-11-06 20:14:45,324 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:44" (1/1) ... [2024-11-06 20:14:45,349 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:44" (1/1) ... [2024-11-06 20:14:45,369 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:44" (1/1) ... [2024-11-06 20:14:45,388 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:44" (1/1) ... [2024-11-06 20:14:45,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 20:14:45,419 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 20:14:45,420 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 20:14:45,420 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 20:14:45,421 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:44" (1/1) ... [2024-11-06 20:14:45,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:14:45,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:14:45,446 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:14:45,448 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:14:45,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 20:14:45,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 20:14:45,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 20:14:45,468 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 20:14:45,527 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 20:14:45,528 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 20:14:48,391 INFO L? ?]: Removed 639 outVars from TransFormulas that were not future-live. [2024-11-06 20:14:48,392 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 20:14:48,420 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 20:14:48,420 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 20:14:48,424 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:14:48 BoogieIcfgContainer [2024-11-06 20:14:48,424 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 20:14:48,426 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 20:14:48,426 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 20:14:48,430 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 20:14:48,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:14:44" (1/3) ... [2024-11-06 20:14:48,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fba28f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:14:48, skipping insertion in model container [2024-11-06 20:14:48,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:14:44" (2/3) ... [2024-11-06 20:14:48,431 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fba28f5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:14:48, skipping insertion in model container [2024-11-06 20:14:48,431 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:14:48" (3/3) ... [2024-11-06 20:14:48,432 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem18_label53.c [2024-11-06 20:14:48,442 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 20:14:48,443 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 20:14:48,528 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 20:14:48,552 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;@dba2f0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 20:14:48,552 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 20:14:48,562 INFO L276 IsEmpty]: Start isEmpty. Operand has 757 states, 755 states have (on average 1.9125827814569536) internal successors, (1444), 756 states have internal predecessors, (1444), 0 states have call successors, (0), 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:14:48,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-06 20:14:48,573 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:14:48,574 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] [2024-11-06 20:14:48,579 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:14:48,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:14:48,587 INFO L85 PathProgramCache]: Analyzing trace with hash 2113343065, now seen corresponding path program 1 times [2024-11-06 20:14:48,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:14:48,598 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17542293] [2024-11-06 20:14:48,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:14:48,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:14:48,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:14:48,832 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:14:48,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:14:48,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17542293] [2024-11-06 20:14:48,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17542293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:14:48,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:14:48,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:14:48,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2067702999] [2024-11-06 20:14:48,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:14:48,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:14:48,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:14:48,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:14:48,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:14:48,856 INFO L87 Difference]: Start difference. First operand has 757 states, 755 states have (on average 1.9125827814569536) internal successors, (1444), 756 states have internal predecessors, (1444), 0 states have call successors, (0), 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 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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:14:51,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:14:51,328 INFO L93 Difference]: Finished difference Result 2221 states and 4282 transitions. [2024-11-06 20:14:51,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:14:51,330 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-11-06 20:14:51,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:14:51,348 INFO L225 Difference]: With dead ends: 2221 [2024-11-06 20:14:51,349 INFO L226 Difference]: Without dead ends: 1384 [2024-11-06 20:14:51,358 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:14:51,360 INFO L432 NwaCegarLoop]: 478 mSDtfsCounter, 762 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 2069 mSolverCounterSat, 717 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 762 SdHoareTripleChecker+Valid, 487 SdHoareTripleChecker+Invalid, 2786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 717 IncrementalHoareTripleChecker+Valid, 2069 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-06 20:14:51,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [762 Valid, 487 Invalid, 2786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [717 Valid, 2069 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-06 20:14:51,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1384 states. [2024-11-06 20:14:51,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1384 to 1384. [2024-11-06 20:14:51,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1384 states, 1383 states have (on average 1.5994215473608098) internal successors, (2212), 1383 states have internal predecessors, (2212), 0 states have call successors, (0), 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:14:51,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1384 states to 1384 states and 2212 transitions. [2024-11-06 20:14:51,443 INFO L78 Accepts]: Start accepts. Automaton has 1384 states and 2212 transitions. Word has length 33 [2024-11-06 20:14:51,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:14:51,443 INFO L471 AbstractCegarLoop]: Abstraction has 1384 states and 2212 transitions. [2024-11-06 20:14:51,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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:14:51,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1384 states and 2212 transitions. [2024-11-06 20:14:51,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2024-11-06 20:14:51,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:14:51,447 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:51,448 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 20:14:51,448 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:14:51,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:14:51,448 INFO L85 PathProgramCache]: Analyzing trace with hash -70377270, now seen corresponding path program 1 times [2024-11-06 20:14:51,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:14:51,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84279752] [2024-11-06 20:14:51,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:14:51,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:14:51,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:14:51,614 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:14:51,617 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:14:51,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84279752] [2024-11-06 20:14:51,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84279752] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:14:51,617 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:14:51,617 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:14:51,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558021110] [2024-11-06 20:14:51,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:14:51,618 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:14:51,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:14:51,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:14:51,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:14:51,619 INFO L87 Difference]: Start difference. First operand 1384 states and 2212 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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:14:53,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:14:53,830 INFO L93 Difference]: Finished difference Result 4146 states and 6631 transitions. [2024-11-06 20:14:53,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:14:53,831 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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 98 [2024-11-06 20:14:53,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:14:53,839 INFO L225 Difference]: With dead ends: 4146 [2024-11-06 20:14:53,840 INFO L226 Difference]: Without dead ends: 2764 [2024-11-06 20:14:53,841 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:14:53,842 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 714 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1701 mSolverCounterSat, 918 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 714 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 2619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 918 IncrementalHoareTripleChecker+Valid, 1701 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-06 20:14:53,842 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [714 Valid, 529 Invalid, 2619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [918 Valid, 1701 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-06 20:14:53,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2764 states. [2024-11-06 20:14:53,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2764 to 2764. [2024-11-06 20:14:53,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2764 states, 2763 states have (on average 1.3503438291711907) internal successors, (3731), 2763 states have internal predecessors, (3731), 0 states have call successors, (0), 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:14:53,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2764 states to 2764 states and 3731 transitions. [2024-11-06 20:14:53,949 INFO L78 Accepts]: Start accepts. Automaton has 2764 states and 3731 transitions. Word has length 98 [2024-11-06 20:14:53,950 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:14:53,950 INFO L471 AbstractCegarLoop]: Abstraction has 2764 states and 3731 transitions. [2024-11-06 20:14:53,950 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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:14:53,950 INFO L276 IsEmpty]: Start isEmpty. Operand 2764 states and 3731 transitions. [2024-11-06 20:14:53,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 217 [2024-11-06 20:14:53,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:14:53,968 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 20:14:53,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 20:14:53,968 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:14:53,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:14:53,969 INFO L85 PathProgramCache]: Analyzing trace with hash -385263694, now seen corresponding path program 1 times [2024-11-06 20:14:53,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:14:53,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1245736404] [2024-11-06 20:14:53,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:14:53,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:14:54,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:14:54,466 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 94 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-06 20:14:54,466 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:14:54,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1245736404] [2024-11-06 20:14:54,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1245736404] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:14:54,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:14:54,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:14:54,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373619424] [2024-11-06 20:14:54,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:14:54,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:14:54,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:14:54,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:14:54,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:14:54,467 INFO L87 Difference]: Start difference. First operand 2764 states and 3731 transitions. Second operand has 4 states, 4 states have (on average 46.5) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:14:57,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:14:57,198 INFO L93 Difference]: Finished difference Result 7596 states and 9794 transitions. [2024-11-06 20:14:57,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:14:57,198 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 216 [2024-11-06 20:14:57,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:14:57,211 INFO L225 Difference]: With dead ends: 7596 [2024-11-06 20:14:57,211 INFO L226 Difference]: Without dead ends: 4834 [2024-11-06 20:14:57,213 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:14:57,214 INFO L432 NwaCegarLoop]: 624 mSDtfsCounter, 1873 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4348 mSolverCounterSat, 117 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1873 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 4465 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 117 IncrementalHoareTripleChecker+Valid, 4348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:14:57,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1873 Valid, 641 Invalid, 4465 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [117 Valid, 4348 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 20:14:57,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4834 states. [2024-11-06 20:14:57,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4834 to 4144. [2024-11-06 20:14:57,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4144 states, 4143 states have (on average 1.2698527636978034) internal successors, (5261), 4143 states have internal predecessors, (5261), 0 states have call successors, (0), 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:14:57,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4144 states to 4144 states and 5261 transitions. [2024-11-06 20:14:57,270 INFO L78 Accepts]: Start accepts. Automaton has 4144 states and 5261 transitions. Word has length 216 [2024-11-06 20:14:57,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:14:57,271 INFO L471 AbstractCegarLoop]: Abstraction has 4144 states and 5261 transitions. [2024-11-06 20:14:57,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 3 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:14:57,274 INFO L276 IsEmpty]: Start isEmpty. Operand 4144 states and 5261 transitions. [2024-11-06 20:14:57,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 333 [2024-11-06 20:14:57,276 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:14:57,277 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:57,277 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 20:14:57,277 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:14:57,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:14:57,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1384519572, now seen corresponding path program 1 times [2024-11-06 20:14:57,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:14:57,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535613282] [2024-11-06 20:14:57,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:14:57,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:14:57,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:14:57,746 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:14:57,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:14:57,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535613282] [2024-11-06 20:14:57,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535613282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:14:57,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139387608] [2024-11-06 20:14:57,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:14:57,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:14:57,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:14:57,750 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:14:57,753 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:14:57,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:14:57,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 20:14:57,873 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 20:14:58,237 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-06 20:14:58,238 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 20:14:58,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139387608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:14:58,238 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 20:14:58,238 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-06 20:14:58,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678999941] [2024-11-06 20:14:58,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:14:58,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:14:58,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:14:58,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:14:58,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 20:14:58,241 INFO L87 Difference]: Start difference. First operand 4144 states and 5261 transitions. Second operand has 3 states, 3 states have (on average 101.0) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 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:15:00,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:00,055 INFO L93 Difference]: Finished difference Result 12426 states and 15778 transitions. [2024-11-06 20:15:00,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:15:00,055 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 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 332 [2024-11-06 20:15:00,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:00,075 INFO L225 Difference]: With dead ends: 12426 [2024-11-06 20:15:00,075 INFO L226 Difference]: Without dead ends: 8284 [2024-11-06 20:15:00,079 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 334 GetRequests, 331 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 20:15:00,081 INFO L432 NwaCegarLoop]: 544 mSDtfsCounter, 398 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 2331 mSolverCounterSat, 457 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 398 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 2788 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 457 IncrementalHoareTripleChecker+Valid, 2331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:00,082 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [398 Valid, 550 Invalid, 2788 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [457 Valid, 2331 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-06 20:15:00,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8284 states. [2024-11-06 20:15:00,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8284 to 6904. [2024-11-06 20:15:00,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6904 states, 6903 states have (on average 1.2358394900767782) internal successors, (8531), 6903 states have internal predecessors, (8531), 0 states have call successors, (0), 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:15:00,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6904 states to 6904 states and 8531 transitions. [2024-11-06 20:15:00,186 INFO L78 Accepts]: Start accepts. Automaton has 6904 states and 8531 transitions. Word has length 332 [2024-11-06 20:15:00,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:00,188 INFO L471 AbstractCegarLoop]: Abstraction has 6904 states and 8531 transitions. [2024-11-06 20:15:00,188 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 101.0) internal successors, (303), 2 states have internal predecessors, (303), 0 states have call successors, (0), 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:15:00,188 INFO L276 IsEmpty]: Start isEmpty. Operand 6904 states and 8531 transitions. [2024-11-06 20:15:00,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2024-11-06 20:15:00,192 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:00,193 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 20:15:00,207 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:15:00,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:15:00,398 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:00,398 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:00,398 INFO L85 PathProgramCache]: Analyzing trace with hash -601779900, now seen corresponding path program 1 times [2024-11-06 20:15:00,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:00,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291959] [2024-11-06 20:15:00,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:00,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:00,878 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 297 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2024-11-06 20:15:00,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:00,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291959] [2024-11-06 20:15:00,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291959] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:00,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:00,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:15:00,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633101329] [2024-11-06 20:15:00,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:00,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:15:00,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:00,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:15:00,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:15:00,881 INFO L87 Difference]: Start difference. First operand 6904 states and 8531 transitions. Second operand has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:15:02,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:02,791 INFO L93 Difference]: Finished difference Result 15239 states and 18535 transitions. [2024-11-06 20:15:02,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:15:02,791 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 402 [2024-11-06 20:15:02,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:02,809 INFO L225 Difference]: With dead ends: 15239 [2024-11-06 20:15:02,809 INFO L226 Difference]: Without dead ends: 8284 [2024-11-06 20:15:02,815 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:15:02,816 INFO L432 NwaCegarLoop]: 625 mSDtfsCounter, 529 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 2590 mSolverCounterSat, 381 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 529 SdHoareTripleChecker+Valid, 637 SdHoareTripleChecker+Invalid, 2971 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 381 IncrementalHoareTripleChecker+Valid, 2590 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:02,817 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [529 Valid, 637 Invalid, 2971 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [381 Valid, 2590 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-06 20:15:02,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8284 states. [2024-11-06 20:15:02,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8284 to 8284. [2024-11-06 20:15:02,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8284 states, 8283 states have (on average 1.154291923216226) internal successors, (9561), 8283 states have internal predecessors, (9561), 0 states have call successors, (0), 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:15:02,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8284 states to 8284 states and 9561 transitions. [2024-11-06 20:15:02,945 INFO L78 Accepts]: Start accepts. Automaton has 8284 states and 9561 transitions. Word has length 402 [2024-11-06 20:15:02,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:02,946 INFO L471 AbstractCegarLoop]: Abstraction has 8284 states and 9561 transitions. [2024-11-06 20:15:02,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.75) internal successors, (355), 3 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:15:02,946 INFO L276 IsEmpty]: Start isEmpty. Operand 8284 states and 9561 transitions. [2024-11-06 20:15:02,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 418 [2024-11-06 20:15:02,950 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:02,951 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:15:02,951 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 20:15:02,951 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:02,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:02,952 INFO L85 PathProgramCache]: Analyzing trace with hash -998230815, now seen corresponding path program 1 times [2024-11-06 20:15:02,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:02,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124605765] [2024-11-06 20:15:02,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:02,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:03,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:03,196 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2024-11-06 20:15:03,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:03,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124605765] [2024-11-06 20:15:03,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124605765] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:03,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:03,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:15:03,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947681148] [2024-11-06 20:15:03,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:03,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:15:03,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:03,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:15:03,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:15:03,198 INFO L87 Difference]: Start difference. First operand 8284 states and 9561 transitions. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 2 states have internal predecessors, (334), 0 states have call successors, (0), 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:15:04,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:04,730 INFO L93 Difference]: Finished difference Result 20016 states and 22949 transitions. [2024-11-06 20:15:04,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:15:04,731 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 2 states have internal predecessors, (334), 0 states have call successors, (0), 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 417 [2024-11-06 20:15:04,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:04,756 INFO L225 Difference]: With dead ends: 20016 [2024-11-06 20:15:04,756 INFO L226 Difference]: Without dead ends: 11734 [2024-11-06 20:15:04,762 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:15:04,763 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 466 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1791 mSolverCounterSat, 517 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 466 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 2308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 1791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:04,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [466 Valid, 77 Invalid, 2308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 1791 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 20:15:04,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11734 states. [2024-11-06 20:15:04,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11734 to 11734. [2024-11-06 20:15:04,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11734 states, 11733 states have (on average 1.119151112247507) internal successors, (13131), 11733 states have internal predecessors, (13131), 0 states have call successors, (0), 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:15:04,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11734 states to 11734 states and 13131 transitions. [2024-11-06 20:15:04,872 INFO L78 Accepts]: Start accepts. Automaton has 11734 states and 13131 transitions. Word has length 417 [2024-11-06 20:15:04,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:04,872 INFO L471 AbstractCegarLoop]: Abstraction has 11734 states and 13131 transitions. [2024-11-06 20:15:04,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 2 states have internal predecessors, (334), 0 states have call successors, (0), 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:15:04,873 INFO L276 IsEmpty]: Start isEmpty. Operand 11734 states and 13131 transitions. [2024-11-06 20:15:04,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 426 [2024-11-06 20:15:04,877 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:04,877 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:15:04,877 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 20:15:04,877 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:04,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:04,878 INFO L85 PathProgramCache]: Analyzing trace with hash -1356240267, now seen corresponding path program 1 times [2024-11-06 20:15:04,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:04,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610737398] [2024-11-06 20:15:04,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:04,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:04,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:05,215 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 153 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:15:05,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:05,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610737398] [2024-11-06 20:15:05,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610737398] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:05,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:05,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:15:05,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609862440] [2024-11-06 20:15:05,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:05,218 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:15:05,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:05,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:15:05,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:15:05,219 INFO L87 Difference]: Start difference. First operand 11734 states and 13131 transitions. Second operand has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 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:15:06,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:06,794 INFO L93 Difference]: Finished difference Result 32436 states and 36566 transitions. [2024-11-06 20:15:06,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:15:06,798 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 425 [2024-11-06 20:15:06,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:06,829 INFO L225 Difference]: With dead ends: 32436 [2024-11-06 20:15:06,829 INFO L226 Difference]: Without dead ends: 20704 [2024-11-06 20:15:06,838 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:15:06,839 INFO L432 NwaCegarLoop]: 972 mSDtfsCounter, 600 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1955 mSolverCounterSat, 349 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 600 SdHoareTripleChecker+Valid, 979 SdHoareTripleChecker+Invalid, 2304 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 349 IncrementalHoareTripleChecker+Valid, 1955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:06,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [600 Valid, 979 Invalid, 2304 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [349 Valid, 1955 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 20:15:06,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20704 states. [2024-11-06 20:15:06,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20704 to 20014. [2024-11-06 20:15:07,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20014 states, 20013 states have (on average 1.095537900364763) internal successors, (21925), 20013 states have internal predecessors, (21925), 0 states have call successors, (0), 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:15:07,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20014 states to 20014 states and 21925 transitions. [2024-11-06 20:15:07,021 INFO L78 Accepts]: Start accepts. Automaton has 20014 states and 21925 transitions. Word has length 425 [2024-11-06 20:15:07,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:07,021 INFO L471 AbstractCegarLoop]: Abstraction has 20014 states and 21925 transitions. [2024-11-06 20:15:07,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 141.66666666666666) internal successors, (425), 3 states have internal predecessors, (425), 0 states have call successors, (0), 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:15:07,022 INFO L276 IsEmpty]: Start isEmpty. Operand 20014 states and 21925 transitions. [2024-11-06 20:15:07,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 433 [2024-11-06 20:15:07,025 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:07,025 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:15:07,025 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 20:15:07,025 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:07,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:07,026 INFO L85 PathProgramCache]: Analyzing trace with hash 73604132, now seen corresponding path program 1 times [2024-11-06 20:15:07,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:07,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558757928] [2024-11-06 20:15:07,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:07,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:07,244 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 92 trivial. 0 not checked. [2024-11-06 20:15:07,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:07,244 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558757928] [2024-11-06 20:15:07,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558757928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:07,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:07,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:15:07,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296649799] [2024-11-06 20:15:07,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:07,245 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:15:07,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:07,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:15:07,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:15:07,248 INFO L87 Difference]: Start difference. First operand 20014 states and 21925 transitions. Second operand has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:15:08,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:08,936 INFO L93 Difference]: Finished difference Result 46236 states and 50984 transitions. [2024-11-06 20:15:08,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:15:08,937 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 432 [2024-11-06 20:15:08,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:08,967 INFO L225 Difference]: With dead ends: 46236 [2024-11-06 20:15:08,967 INFO L226 Difference]: Without dead ends: 22774 [2024-11-06 20:15:08,984 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:15:08,984 INFO L432 NwaCegarLoop]: 1113 mSDtfsCounter, 671 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1721 mSolverCounterSat, 518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 671 SdHoareTripleChecker+Valid, 1120 SdHoareTripleChecker+Invalid, 2239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 518 IncrementalHoareTripleChecker+Valid, 1721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:08,985 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [671 Valid, 1120 Invalid, 2239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [518 Valid, 1721 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-06 20:15:09,001 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22774 states. [2024-11-06 20:15:09,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22774 to 20704. [2024-11-06 20:15:09,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20704 states, 20703 states have (on average 1.0554025986571995) internal successors, (21850), 20703 states have internal predecessors, (21850), 0 states have call successors, (0), 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:15:09,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20704 states to 20704 states and 21850 transitions. [2024-11-06 20:15:09,217 INFO L78 Accepts]: Start accepts. Automaton has 20704 states and 21850 transitions. Word has length 432 [2024-11-06 20:15:09,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:09,217 INFO L471 AbstractCegarLoop]: Abstraction has 20704 states and 21850 transitions. [2024-11-06 20:15:09,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:15:09,217 INFO L276 IsEmpty]: Start isEmpty. Operand 20704 states and 21850 transitions. [2024-11-06 20:15:09,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 504 [2024-11-06 20:15:09,223 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:09,223 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:09,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 20:15:09,223 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:09,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:09,224 INFO L85 PathProgramCache]: Analyzing trace with hash 320672857, now seen corresponding path program 1 times [2024-11-06 20:15:09,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:09,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1708138913] [2024-11-06 20:15:09,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:09,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:09,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:09,418 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2024-11-06 20:15:09,418 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:09,418 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1708138913] [2024-11-06 20:15:09,418 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1708138913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:09,418 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:09,418 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:15:09,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706450767] [2024-11-06 20:15:09,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:09,419 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:15:09,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:09,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:15:09,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:15:09,419 INFO L87 Difference]: Start difference. First operand 20704 states and 21850 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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:15:10,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:10,708 INFO L93 Difference]: Finished difference Result 46236 states and 49051 transitions. [2024-11-06 20:15:10,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:15:10,708 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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 503 [2024-11-06 20:15:10,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:10,734 INFO L225 Difference]: With dead ends: 46236 [2024-11-06 20:15:10,734 INFO L226 Difference]: Without dead ends: 23464 [2024-11-06 20:15:10,748 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:15:10,748 INFO L432 NwaCegarLoop]: 929 mSDtfsCounter, 677 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1656 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 677 SdHoareTripleChecker+Valid, 936 SdHoareTripleChecker+Invalid, 1913 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 1656 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:10,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [677 Valid, 936 Invalid, 1913 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 1656 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 20:15:10,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23464 states. [2024-11-06 20:15:10,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23464 to 23464. [2024-11-06 20:15:10,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23464 states, 23463 states have (on average 1.0528065464774325) internal successors, (24702), 23463 states have internal predecessors, (24702), 0 states have call successors, (0), 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:15:11,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23464 states to 23464 states and 24702 transitions. [2024-11-06 20:15:11,054 INFO L78 Accepts]: Start accepts. Automaton has 23464 states and 24702 transitions. Word has length 503 [2024-11-06 20:15:11,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:11,054 INFO L471 AbstractCegarLoop]: Abstraction has 23464 states and 24702 transitions. [2024-11-06 20:15:11,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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:15:11,055 INFO L276 IsEmpty]: Start isEmpty. Operand 23464 states and 24702 transitions. [2024-11-06 20:15:11,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 667 [2024-11-06 20:15:11,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:11,070 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:11,074 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 20:15:11,074 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:11,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:11,075 INFO L85 PathProgramCache]: Analyzing trace with hash 587759993, now seen corresponding path program 1 times [2024-11-06 20:15:11,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:11,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653597717] [2024-11-06 20:15:11,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:11,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:11,401 INFO L134 CoverageAnalysis]: Checked inductivity of 510 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 418 trivial. 0 not checked. [2024-11-06 20:15:11,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:11,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1653597717] [2024-11-06 20:15:11,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1653597717] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:11,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:11,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:15:11,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535438785] [2024-11-06 20:15:11,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:11,402 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:15:11,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:11,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:15:11,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:15:11,403 INFO L87 Difference]: Start difference. First operand 23464 states and 24702 transitions. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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:15:12,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:12,881 INFO L93 Difference]: Finished difference Result 54516 states and 57660 transitions. [2024-11-06 20:15:12,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:15:12,881 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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 666 [2024-11-06 20:15:12,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:12,913 INFO L225 Difference]: With dead ends: 54516 [2024-11-06 20:15:12,913 INFO L226 Difference]: Without dead ends: 31054 [2024-11-06 20:15:12,927 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:15:12,927 INFO L432 NwaCegarLoop]: 257 mSDtfsCounter, 664 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1782 mSolverCounterSat, 193 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 1975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 193 IncrementalHoareTripleChecker+Valid, 1782 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:12,928 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 263 Invalid, 1975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [193 Valid, 1782 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 20:15:12,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31054 states. [2024-11-06 20:15:13,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31054 to 30364. [2024-11-06 20:15:13,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30364 states, 30363 states have (on average 1.0495010374468925) internal successors, (31866), 30363 states have internal predecessors, (31866), 0 states have call successors, (0), 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:15:13,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30364 states to 30364 states and 31866 transitions. [2024-11-06 20:15:13,256 INFO L78 Accepts]: Start accepts. Automaton has 30364 states and 31866 transitions. Word has length 666 [2024-11-06 20:15:13,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:13,256 INFO L471 AbstractCegarLoop]: Abstraction has 30364 states and 31866 transitions. [2024-11-06 20:15:13,256 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 states have internal predecessors, (335), 0 states have call successors, (0), 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:15:13,257 INFO L276 IsEmpty]: Start isEmpty. Operand 30364 states and 31866 transitions. [2024-11-06 20:15:13,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1225 [2024-11-06 20:15:13,279 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:13,279 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, 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:15:13,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 20:15:13,280 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:13,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:13,280 INFO L85 PathProgramCache]: Analyzing trace with hash 2004926893, now seen corresponding path program 1 times [2024-11-06 20:15:13,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:13,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487164571] [2024-11-06 20:15:13,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:13,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:13,956 INFO L134 CoverageAnalysis]: Checked inductivity of 1701 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 1516 trivial. 0 not checked. [2024-11-06 20:15:13,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:13,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487164571] [2024-11-06 20:15:13,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487164571] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:13,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:13,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:15:13,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1492598424] [2024-11-06 20:15:13,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:13,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:15:13,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:13,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:15:13,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:15:13,958 INFO L87 Difference]: Start difference. First operand 30364 states and 31866 transitions. Second operand has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 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:15:14,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:14,711 INFO L93 Difference]: Finished difference Result 60058 states and 63061 transitions. [2024-11-06 20:15:14,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:15:14,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 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 1224 [2024-11-06 20:15:14,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:14,742 INFO L225 Difference]: With dead ends: 60058 [2024-11-06 20:15:14,743 INFO L226 Difference]: Without dead ends: 30364 [2024-11-06 20:15:14,761 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:15:14,762 INFO L432 NwaCegarLoop]: 979 mSDtfsCounter, 0 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 975 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 986 SdHoareTripleChecker+Invalid, 975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 975 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:14,762 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 986 Invalid, 975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 975 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 20:15:14,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30364 states. [2024-11-06 20:15:14,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30364 to 30364. [2024-11-06 20:15:14,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30364 states, 30363 states have (on average 1.0493692981589435) internal successors, (31862), 30363 states have internal predecessors, (31862), 0 states have call successors, (0), 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:15:15,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30364 states to 30364 states and 31862 transitions. [2024-11-06 20:15:15,106 INFO L78 Accepts]: Start accepts. Automaton has 30364 states and 31862 transitions. Word has length 1224 [2024-11-06 20:15:15,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:15,106 INFO L471 AbstractCegarLoop]: Abstraction has 30364 states and 31862 transitions. [2024-11-06 20:15:15,106 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 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:15:15,107 INFO L276 IsEmpty]: Start isEmpty. Operand 30364 states and 31862 transitions. [2024-11-06 20:15:15,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1238 [2024-11-06 20:15:15,119 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:15,119 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:15,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 20:15:15,119 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:15,120 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:15,120 INFO L85 PathProgramCache]: Analyzing trace with hash -2013855208, now seen corresponding path program 1 times [2024-11-06 20:15:15,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:15,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45010659] [2024-11-06 20:15:15,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:15,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:15,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1508 backedges. 1058 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-06 20:15:15,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:15,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45010659] [2024-11-06 20:15:15,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45010659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:15,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:15,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:15:15,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709893327] [2024-11-06 20:15:15,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:15,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:15:15,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:15,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:15:15,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:15:15,996 INFO L87 Difference]: Start difference. First operand 30364 states and 31862 transitions. Second operand has 4 states, 4 states have (on average 205.25) internal successors, (821), 3 states have internal predecessors, (821), 0 states have call successors, (0), 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:15:17,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:17,920 INFO L93 Difference]: Finished difference Result 60036 states and 63031 transitions. [2024-11-06 20:15:17,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:15:17,923 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 205.25) internal successors, (821), 3 states have internal predecessors, (821), 0 states have call successors, (0), 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 1237 [2024-11-06 20:15:17,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:17,953 INFO L225 Difference]: With dead ends: 60036 [2024-11-06 20:15:17,953 INFO L226 Difference]: Without dead ends: 30364 [2024-11-06 20:15:17,970 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:15:17,971 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 797 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 2695 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 797 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 2975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 2695 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:17,971 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [797 Valid, 90 Invalid, 2975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 2695 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-06 20:15:17,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30364 states. [2024-11-06 20:15:18,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30364 to 30364. [2024-11-06 20:15:18,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30364 states, 30363 states have (on average 1.0490399499390706) internal successors, (31852), 30363 states have internal predecessors, (31852), 0 states have call successors, (0), 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:15:18,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30364 states to 30364 states and 31852 transitions. [2024-11-06 20:15:18,263 INFO L78 Accepts]: Start accepts. Automaton has 30364 states and 31852 transitions. Word has length 1237 [2024-11-06 20:15:18,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:18,264 INFO L471 AbstractCegarLoop]: Abstraction has 30364 states and 31852 transitions. [2024-11-06 20:15:18,264 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 205.25) internal successors, (821), 3 states have internal predecessors, (821), 0 states have call successors, (0), 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:15:18,264 INFO L276 IsEmpty]: Start isEmpty. Operand 30364 states and 31852 transitions. [2024-11-06 20:15:18,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1258 [2024-11-06 20:15:18,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:18,282 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:18,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 20:15:18,282 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:18,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:18,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1369456182, now seen corresponding path program 1 times [2024-11-06 20:15:18,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:18,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891362077] [2024-11-06 20:15:18,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:18,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:18,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:18,897 INFO L134 CoverageAnalysis]: Checked inductivity of 1525 backedges. 802 proven. 0 refuted. 0 times theorem prover too weak. 723 trivial. 0 not checked. [2024-11-06 20:15:18,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:18,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891362077] [2024-11-06 20:15:18,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891362077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:18,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:18,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:15:18,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1764353799] [2024-11-06 20:15:18,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:18,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:15:18,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:18,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:15:18,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:15:18,900 INFO L87 Difference]: Start difference. First operand 30364 states and 31852 transitions. Second operand has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 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:15:20,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:20,294 INFO L93 Difference]: Finished difference Result 68316 states and 71985 transitions. [2024-11-06 20:15:20,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:15:20,294 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 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 1257 [2024-11-06 20:15:20,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:20,332 INFO L225 Difference]: With dead ends: 68316 [2024-11-06 20:15:20,332 INFO L226 Difference]: Without dead ends: 38644 [2024-11-06 20:15:20,352 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:15:20,352 INFO L432 NwaCegarLoop]: 949 mSDtfsCounter, 454 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1760 mSolverCounterSat, 217 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 454 SdHoareTripleChecker+Valid, 955 SdHoareTripleChecker+Invalid, 1977 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 217 IncrementalHoareTripleChecker+Valid, 1760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:20,353 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [454 Valid, 955 Invalid, 1977 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [217 Valid, 1760 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 20:15:20,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38644 states. [2024-11-06 20:15:20,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38644 to 38644. [2024-11-06 20:15:20,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38644 states, 38643 states have (on average 1.0470719147064151) internal successors, (40462), 38643 states have internal predecessors, (40462), 0 states have call successors, (0), 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:15:20,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38644 states to 38644 states and 40462 transitions. [2024-11-06 20:15:20,645 INFO L78 Accepts]: Start accepts. Automaton has 38644 states and 40462 transitions. Word has length 1257 [2024-11-06 20:15:20,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:20,646 INFO L471 AbstractCegarLoop]: Abstraction has 38644 states and 40462 transitions. [2024-11-06 20:15:20,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 263.6666666666667) internal successors, (791), 3 states have internal predecessors, (791), 0 states have call successors, (0), 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:15:20,646 INFO L276 IsEmpty]: Start isEmpty. Operand 38644 states and 40462 transitions. [2024-11-06 20:15:20,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1298 [2024-11-06 20:15:20,659 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:20,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, 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, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:15:20,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 20:15:20,659 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:20,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:20,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1819420842, now seen corresponding path program 1 times [2024-11-06 20:15:20,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:20,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553113195] [2024-11-06 20:15:20,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:20,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:21,817 INFO L134 CoverageAnalysis]: Checked inductivity of 2204 backedges. 1377 proven. 614 refuted. 0 times theorem prover too weak. 213 trivial. 0 not checked. [2024-11-06 20:15:21,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:21,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553113195] [2024-11-06 20:15:21,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553113195] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:15:21,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273102124] [2024-11-06 20:15:21,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:21,818 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:15:21,818 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:15:21,820 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 20:15:21,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 20:15:22,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:22,038 INFO L255 TraceCheckSpWp]: Trace formula consists of 1531 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 20:15:22,049 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 20:15:22,160 INFO L134 CoverageAnalysis]: Checked inductivity of 2204 backedges. 1389 proven. 0 refuted. 0 times theorem prover too weak. 815 trivial. 0 not checked. [2024-11-06 20:15:22,160 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 20:15:22,160 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273102124] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:22,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 20:15:22,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 8 [2024-11-06 20:15:22,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192887758] [2024-11-06 20:15:22,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:22,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:15:22,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:22,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:15:22,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-06 20:15:22,165 INFO L87 Difference]: Start difference. First operand 38644 states and 40462 transitions. Second operand has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 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:15:23,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:23,648 INFO L93 Difference]: Finished difference Result 90396 states and 95089 transitions. [2024-11-06 20:15:23,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:15:23,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 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 1297 [2024-11-06 20:15:23,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:23,699 INFO L225 Difference]: With dead ends: 90396 [2024-11-06 20:15:23,699 INFO L226 Difference]: Without dead ends: 52444 [2024-11-06 20:15:23,724 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1303 GetRequests, 1297 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-06 20:15:23,725 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 644 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 1720 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 1720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:23,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [644 Valid, 132 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 1720 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 20:15:23,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52444 states. [2024-11-06 20:15:24,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52444 to 51754. [2024-11-06 20:15:24,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51754 states, 51753 states have (on average 1.045137479952853) internal successors, (54089), 51753 states have internal predecessors, (54089), 0 states have call successors, (0), 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:15:24,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51754 states to 51754 states and 54089 transitions. [2024-11-06 20:15:24,220 INFO L78 Accepts]: Start accepts. Automaton has 51754 states and 54089 transitions. Word has length 1297 [2024-11-06 20:15:24,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:24,221 INFO L471 AbstractCegarLoop]: Abstraction has 51754 states and 54089 transitions. [2024-11-06 20:15:24,221 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 245.33333333333334) internal successors, (736), 3 states have internal predecessors, (736), 0 states have call successors, (0), 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:15:24,221 INFO L276 IsEmpty]: Start isEmpty. Operand 51754 states and 54089 transitions. [2024-11-06 20:15:24,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1366 [2024-11-06 20:15:24,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:24,238 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:24,253 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 20:15:24,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:15:24,439 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:24,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:24,439 INFO L85 PathProgramCache]: Analyzing trace with hash 235471113, now seen corresponding path program 1 times [2024-11-06 20:15:24,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:24,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648692407] [2024-11-06 20:15:24,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:24,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:24,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:25,071 INFO L134 CoverageAnalysis]: Checked inductivity of 2142 backedges. 185 proven. 0 refuted. 0 times theorem prover too weak. 1957 trivial. 0 not checked. [2024-11-06 20:15:25,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:25,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648692407] [2024-11-06 20:15:25,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648692407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:25,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:25,072 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:15:25,072 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503728026] [2024-11-06 20:15:25,072 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:25,073 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:15:25,073 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:25,073 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:15:25,073 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:15:25,074 INFO L87 Difference]: Start difference. First operand 51754 states and 54089 transitions. Second operand has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 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:15:26,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:26,585 INFO L93 Difference]: Finished difference Result 112476 states and 118036 transitions. [2024-11-06 20:15:26,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:15:26,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 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 1365 [2024-11-06 20:15:26,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:26,648 INFO L225 Difference]: With dead ends: 112476 [2024-11-06 20:15:26,648 INFO L226 Difference]: Without dead ends: 61414 [2024-11-06 20:15:26,682 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:15:26,682 INFO L432 NwaCegarLoop]: 935 mSDtfsCounter, 664 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1770 mSolverCounterSat, 228 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 664 SdHoareTripleChecker+Valid, 942 SdHoareTripleChecker+Invalid, 1998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 228 IncrementalHoareTripleChecker+Valid, 1770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:26,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [664 Valid, 942 Invalid, 1998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [228 Valid, 1770 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 20:15:26,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61414 states. [2024-11-06 20:15:27,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61414 to 60724. [2024-11-06 20:15:27,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60724 states, 60723 states have (on average 1.043574922187639) internal successors, (63369), 60723 states have internal predecessors, (63369), 0 states have call successors, (0), 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:15:27,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60724 states to 60724 states and 63369 transitions. [2024-11-06 20:15:27,285 INFO L78 Accepts]: Start accepts. Automaton has 60724 states and 63369 transitions. Word has length 1365 [2024-11-06 20:15:27,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:27,285 INFO L471 AbstractCegarLoop]: Abstraction has 60724 states and 63369 transitions. [2024-11-06 20:15:27,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 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:15:27,286 INFO L276 IsEmpty]: Start isEmpty. Operand 60724 states and 63369 transitions. [2024-11-06 20:15:27,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1401 [2024-11-06 20:15:27,306 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:27,306 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, 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, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:27,306 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 20:15:27,306 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:27,307 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:27,307 INFO L85 PathProgramCache]: Analyzing trace with hash 748132239, now seen corresponding path program 1 times [2024-11-06 20:15:27,307 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:27,307 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463571544] [2024-11-06 20:15:27,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:27,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:28,068 INFO L134 CoverageAnalysis]: Checked inductivity of 1978 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 1791 trivial. 0 not checked. [2024-11-06 20:15:28,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:28,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463571544] [2024-11-06 20:15:28,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463571544] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:28,069 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:28,069 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:15:28,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770205997] [2024-11-06 20:15:28,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:28,070 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:15:28,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:28,071 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:15:28,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:15:28,071 INFO L87 Difference]: Start difference. First operand 60724 states and 63369 transitions. Second operand has 3 states, 3 states have (on average 185.0) 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:15:29,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:29,549 INFO L93 Difference]: Finished difference Result 130416 states and 136273 transitions. [2024-11-06 20:15:29,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:15:29,549 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 185.0) 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 1400 [2024-11-06 20:15:29,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:29,619 INFO L225 Difference]: With dead ends: 130416 [2024-11-06 20:15:29,619 INFO L226 Difference]: Without dead ends: 70384 [2024-11-06 20:15:29,652 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:15:29,652 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 667 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1733 mSolverCounterSat, 196 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 667 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 1929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 196 IncrementalHoareTripleChecker+Valid, 1733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:29,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [667 Valid, 258 Invalid, 1929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [196 Valid, 1733 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 20:15:29,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70384 states. [2024-11-06 20:15:30,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70384 to 61414. [2024-11-06 20:15:30,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61414 states, 61413 states have (on average 1.0432807386058327) internal successors, (64071), 61413 states have internal predecessors, (64071), 0 states have call successors, (0), 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:15:30,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61414 states to 61414 states and 64071 transitions. [2024-11-06 20:15:30,514 INFO L78 Accepts]: Start accepts. Automaton has 61414 states and 64071 transitions. Word has length 1400 [2024-11-06 20:15:30,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:30,515 INFO L471 AbstractCegarLoop]: Abstraction has 61414 states and 64071 transitions. [2024-11-06 20:15:30,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 185.0) 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:15:30,515 INFO L276 IsEmpty]: Start isEmpty. Operand 61414 states and 64071 transitions. [2024-11-06 20:15:30,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1410 [2024-11-06 20:15:30,534 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:30,535 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:30,535 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-06 20:15:30,535 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:30,535 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:30,539 INFO L85 PathProgramCache]: Analyzing trace with hash -1151800699, now seen corresponding path program 1 times [2024-11-06 20:15:30,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:30,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795045220] [2024-11-06 20:15:30,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:30,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:30,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:31,104 INFO L134 CoverageAnalysis]: Checked inductivity of 1776 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 1620 trivial. 0 not checked. [2024-11-06 20:15:31,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:31,104 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795045220] [2024-11-06 20:15:31,104 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795045220] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:31,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:31,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:15:31,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529577257] [2024-11-06 20:15:31,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:31,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:15:31,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:31,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:15:31,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:15:31,106 INFO L87 Difference]: Start difference. First operand 61414 states and 64071 transitions. Second operand has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 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:15:32,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:32,470 INFO L93 Difference]: Finished difference Result 122136 states and 127449 transitions. [2024-11-06 20:15:32,471 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:15:32,471 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 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 1409 [2024-11-06 20:15:32,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:32,621 INFO L225 Difference]: With dead ends: 122136 [2024-11-06 20:15:32,621 INFO L226 Difference]: Without dead ends: 61414 [2024-11-06 20:15:32,647 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:15:32,648 INFO L432 NwaCegarLoop]: 880 mSDtfsCounter, 725 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 1604 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 725 SdHoareTripleChecker+Valid, 887 SdHoareTripleChecker+Invalid, 1824 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 1604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:32,648 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [725 Valid, 887 Invalid, 1824 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 1604 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 20:15:32,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61414 states. [2024-11-06 20:15:33,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61414 to 60034. [2024-11-06 20:15:33,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60034 states, 60033 states have (on average 1.0307830693118785) internal successors, (61881), 60033 states have internal predecessors, (61881), 0 states have call successors, (0), 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:15:33,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60034 states to 60034 states and 61881 transitions. [2024-11-06 20:15:33,125 INFO L78 Accepts]: Start accepts. Automaton has 60034 states and 61881 transitions. Word has length 1409 [2024-11-06 20:15:33,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:33,125 INFO L471 AbstractCegarLoop]: Abstraction has 60034 states and 61881 transitions. [2024-11-06 20:15:33,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.66666666666666) internal successors, (554), 3 states have internal predecessors, (554), 0 states have call successors, (0), 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:15:33,125 INFO L276 IsEmpty]: Start isEmpty. Operand 60034 states and 61881 transitions. [2024-11-06 20:15:33,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1418 [2024-11-06 20:15:33,143 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:33,144 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 20:15:33,144 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-06 20:15:33,144 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:33,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:33,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1918970608, now seen corresponding path program 1 times [2024-11-06 20:15:33,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:33,144 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1850105625] [2024-11-06 20:15:33,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:33,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:33,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:33,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1700 backedges. 123 proven. 0 refuted. 0 times theorem prover too weak. 1577 trivial. 0 not checked. [2024-11-06 20:15:33,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:33,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1850105625] [2024-11-06 20:15:33,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1850105625] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:33,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:33,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:15:33,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749218573] [2024-11-06 20:15:33,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:33,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:15:33,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:33,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:15:33,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:15:33,895 INFO L87 Difference]: Start difference. First operand 60034 states and 61881 transitions. Second operand has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 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:15:35,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:35,310 INFO L93 Difference]: Finished difference Result 120066 states and 123765 transitions. [2024-11-06 20:15:35,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:15:35,311 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 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 1417 [2024-11-06 20:15:35,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:35,363 INFO L225 Difference]: With dead ends: 120066 [2024-11-06 20:15:35,364 INFO L226 Difference]: Without dead ends: 60724 [2024-11-06 20:15:35,396 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:15:35,397 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 676 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1700 mSolverCounterSat, 257 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 676 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 1957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 257 IncrementalHoareTripleChecker+Valid, 1700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:35,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [676 Valid, 78 Invalid, 1957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [257 Valid, 1700 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 20:15:35,433 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60724 states. [2024-11-06 20:15:35,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60724 to 59344. [2024-11-06 20:15:35,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59344 states, 59343 states have (on average 1.0300962202787187) internal successors, (61129), 59343 states have internal predecessors, (61129), 0 states have call successors, (0), 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:15:35,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59344 states to 59344 states and 61129 transitions. [2024-11-06 20:15:35,880 INFO L78 Accepts]: Start accepts. Automaton has 59344 states and 61129 transitions. Word has length 1417 [2024-11-06 20:15:35,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:35,881 INFO L471 AbstractCegarLoop]: Abstraction has 59344 states and 61129 transitions. [2024-11-06 20:15:35,881 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 0 states have call successors, (0), 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:15:35,881 INFO L276 IsEmpty]: Start isEmpty. Operand 59344 states and 61129 transitions. [2024-11-06 20:15:35,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1476 [2024-11-06 20:15:35,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:15:35,917 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:15:35,917 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-06 20:15:35,917 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:15:35,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:15:35,917 INFO L85 PathProgramCache]: Analyzing trace with hash -2020479322, now seen corresponding path program 1 times [2024-11-06 20:15:35,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:15:35,918 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119769187] [2024-11-06 20:15:35,918 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:15:35,918 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:15:36,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:15:36,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1870 backedges. 1049 proven. 0 refuted. 0 times theorem prover too weak. 821 trivial. 0 not checked. [2024-11-06 20:15:36,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:15:36,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119769187] [2024-11-06 20:15:36,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119769187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:15:36,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:15:36,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:15:36,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022077456] [2024-11-06 20:15:36,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:15:36,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:15:36,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:15:36,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:15:36,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:15:36,792 INFO L87 Difference]: Start difference. First operand 59344 states and 61129 transitions. Second operand has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 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:15:38,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:15:38,012 INFO L93 Difference]: Finished difference Result 117994 states and 121564 transitions. [2024-11-06 20:15:38,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:15:38,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 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 1475 [2024-11-06 20:15:38,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:15:38,014 INFO L225 Difference]: With dead ends: 117994 [2024-11-06 20:15:38,014 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 20:15:38,046 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:15:38,046 INFO L432 NwaCegarLoop]: 837 mSDtfsCounter, 304 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 1724 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 843 SdHoareTripleChecker+Invalid, 1794 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 1724 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 20:15:38,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 843 Invalid, 1794 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 1724 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 20:15:38,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 20:15:38,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 20:15:38,046 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:15:38,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 20:15:38,047 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1475 [2024-11-06 20:15:38,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:15:38,047 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 20:15:38,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 315.3333333333333) internal successors, (946), 3 states have internal predecessors, (946), 0 states have call successors, (0), 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:15:38,047 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 20:15:38,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 20:15:38,050 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 20:15:38,050 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-06 20:15:38,052 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] [2024-11-06 20:15:38,053 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 20:15:38,927 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 20:15:38,943 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 08:15:38 BoogieIcfgContainer [2024-11-06 20:15:38,943 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 20:15:38,943 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 20:15:38,943 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 20:15:38,943 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 20:15:38,944 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:14:48" (3/4) ... [2024-11-06 20:15:38,945 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 20:15:38,982 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-11-06 20:15:38,985 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 20:15:38,989 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 20:15:38,992 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 20:15:39,187 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 20:15:39,188 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 20:15:39,188 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 20:15:39,188 INFO L158 Benchmark]: Toolchain (without parser) took 55089.64ms. Allocated memory was 100.7MB in the beginning and 3.1GB in the end (delta: 3.0GB). Free memory was 66.4MB in the beginning and 1.4GB in the end (delta: -1.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2024-11-06 20:15:39,190 INFO L158 Benchmark]: CDTParser took 0.47ms. Allocated memory is still 83.9MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 20:15:39,191 INFO L158 Benchmark]: CACSL2BoogieTranslator took 786.11ms. Allocated memory is still 100.7MB. Free memory was 66.2MB in the beginning and 30.4MB in the end (delta: 35.8MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. [2024-11-06 20:15:39,191 INFO L158 Benchmark]: Boogie Procedure Inliner took 252.66ms. Allocated memory was 100.7MB in the beginning and 184.5MB in the end (delta: 83.9MB). Free memory was 30.4MB in the beginning and 111.0MB in the end (delta: -80.6MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. [2024-11-06 20:15:39,191 INFO L158 Benchmark]: Boogie Preprocessor took 277.45ms. Allocated memory is still 184.5MB. Free memory was 111.0MB in the beginning and 81.5MB in the end (delta: 29.5MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. [2024-11-06 20:15:39,191 INFO L158 Benchmark]: RCFGBuilder took 3004.83ms. Allocated memory was 184.5MB in the beginning and 369.1MB in the end (delta: 184.5MB). Free memory was 80.8MB in the beginning and 92.1MB in the end (delta: -11.3MB). Peak memory consumption was 175.3MB. Max. memory is 16.1GB. [2024-11-06 20:15:39,191 INFO L158 Benchmark]: TraceAbstraction took 50516.80ms. Allocated memory was 369.1MB in the beginning and 3.1GB in the end (delta: 2.7GB). Free memory was 92.1MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-06 20:15:39,191 INFO L158 Benchmark]: Witness Printer took 244.40ms. Allocated memory is still 3.1GB. Free memory was 1.5GB in the beginning and 1.4GB in the end (delta: 45.9MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-06 20:15:39,192 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.47ms. Allocated memory is still 83.9MB. Free memory is still 48.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 786.11ms. Allocated memory is still 100.7MB. Free memory was 66.2MB in the beginning and 30.4MB in the end (delta: 35.8MB). Peak memory consumption was 49.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 252.66ms. Allocated memory was 100.7MB in the beginning and 184.5MB in the end (delta: 83.9MB). Free memory was 30.4MB in the beginning and 111.0MB in the end (delta: -80.6MB). Peak memory consumption was 40.8MB. Max. memory is 16.1GB. * Boogie Preprocessor took 277.45ms. Allocated memory is still 184.5MB. Free memory was 111.0MB in the beginning and 81.5MB in the end (delta: 29.5MB). Peak memory consumption was 41.4MB. Max. memory is 16.1GB. * RCFGBuilder took 3004.83ms. Allocated memory was 184.5MB in the beginning and 369.1MB in the end (delta: 184.5MB). Free memory was 80.8MB in the beginning and 92.1MB in the end (delta: -11.3MB). Peak memory consumption was 175.3MB. Max. memory is 16.1GB. * TraceAbstraction took 50516.80ms. Allocated memory was 369.1MB in the beginning and 3.1GB in the end (delta: 2.7GB). Free memory was 92.1MB in the beginning and 1.5GB in the end (delta: -1.4GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 244.40ms. Allocated memory is still 3.1GB. Free memory was 1.5GB in the beginning and 1.4GB in the end (delta: 45.9MB). Peak memory consumption was 41.9MB. 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: 118]: 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, 757 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 49.6s, OverallIterations: 19, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 32.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 12285 SdHoareTripleChecker+Valid, 28.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 12285 mSDsluCounter, 11390 SdHoareTripleChecker+Invalid, 22.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 142 mSDsCounter, 6129 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37625 IncrementalHoareTripleChecker+Invalid, 43754 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6129 mSolverCounterUnsat, 11248 mSDtfsCounter, 37625 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1686 GetRequests, 1656 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=61414occurred in iteration=16, InterpolantAutomatonStates: 60, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 5.5s AutomataMinimizationTime, 19 MinimizatonAttempts, 18630 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 8.9s InterpolantComputationTime, 17234 NumberOfCodeBlocks, 17234 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 17213 ConstructedInterpolants, 0 QuantifiedInterpolants, 35220 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1944 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 21 InterpolantComputations, 19 PerfectInterpolantSequences, 19832/20476 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: 4269]: Loop Invariant Derived loop invariant: (((((((((((((a18 <= 11) && (a24 <= 3)) && (a15 == 6)) || (((5 == a15) && (a24 <= 3)) && (a18 == 12))) || ((5 == a15) && (a18 <= 11))) || ((a24 == 0) && (a15 <= 4))) || (((3 <= a24) && (a15 <= 4)) && (a18 == 12))) || (((a24 <= 3) && (a18 == 12)) && (a15 == 6))) || (((a15 <= 4) && (a18 == 12)) && (a3 <= 99))) || (((5 == a15) && (a18 == 12)) && (a3 <= 99))) || ((a24 == 1) && (a15 <= 4))) || ((a15 <= 4) && (a18 <= 11))) || (((a24 == 1) && (a15 == 6)) && (a3 <= 99))) RESULT: Ultimate proved your program to be correct! [2024-11-06 20:15:39,218 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