./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label39.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/Problem02_label39.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', '1e4f61af9a0cb0797f7e34da0b07a857e7ae44f0a7943fff0d2a78c0cd17574b'] 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/Problem02_label39.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 1e4f61af9a0cb0797f7e34da0b07a857e7ae44f0a7943fff0d2a78c0cd17574b --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 18:55:14,785 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 18:55:14,858 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 18:55:14,866 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 18:55:14,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 18:55:14,890 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 18:55:14,892 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 18:55:14,893 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 18:55:14,893 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 18:55:14,894 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 18:55:14,894 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 18:55:14,894 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 18:55:14,895 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 18:55:14,895 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 18:55:14,895 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 18:55:14,895 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 18:55:14,895 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 18:55:14,895 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 18:55:14,896 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 18:55:14,896 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 18:55:14,896 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 18:55:14,896 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 18:55:14,896 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 18:55:14,896 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 18:55:14,896 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 18:55:14,896 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 18:55:14,896 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 18:55:14,896 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 18:55:14,897 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 18:55:14,897 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 18:55:14,897 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 18:55:14,897 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 18:55:14,897 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:55:14,897 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 18:55:14,898 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 18:55:14,898 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 18:55:14,898 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 18:55:14,898 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 18:55:14,898 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 18:55:14,898 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 18:55:14,898 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 18:55:14,898 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 18:55:14,898 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 -> 1e4f61af9a0cb0797f7e34da0b07a857e7ae44f0a7943fff0d2a78c0cd17574b [2024-11-06 18:55:15,105 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 18:55:15,112 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 18:55:15,117 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 18:55:15,119 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 18:55:15,119 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 18:55:15,120 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label39.c [2024-11-06 18:55:16,255 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 18:55:16,495 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 18:55:16,496 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label39.c [2024-11-06 18:55:16,504 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f75a03387/a3e97374d239461b8b76f3109d6e9fe5/FLAG67c2dc6c2 [2024-11-06 18:55:16,831 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f75a03387/a3e97374d239461b8b76f3109d6e9fe5 [2024-11-06 18:55:16,833 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 18:55:16,835 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 18:55:16,837 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 18:55:16,837 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 18:55:16,840 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 18:55:16,841 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:55:16" (1/1) ... [2024-11-06 18:55:16,841 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c899e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:16, skipping insertion in model container [2024-11-06 18:55:16,841 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:55:16" (1/1) ... [2024-11-06 18:55:16,866 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 18:55:17,075 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/Problem02_label39.c[18036,18049] [2024-11-06 18:55:17,097 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:55:17,107 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 18:55:17,161 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/Problem02_label39.c[18036,18049] [2024-11-06 18:55:17,174 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:55:17,186 INFO L204 MainTranslator]: Completed translation [2024-11-06 18:55:17,187 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17 WrapperNode [2024-11-06 18:55:17,188 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 18:55:17,189 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 18:55:17,189 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 18:55:17,190 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 18:55:17,194 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17" (1/1) ... [2024-11-06 18:55:17,206 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17" (1/1) ... [2024-11-06 18:55:17,243 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-11-06 18:55:17,243 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 18:55:17,244 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 18:55:17,244 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 18:55:17,244 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 18:55:17,250 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17" (1/1) ... [2024-11-06 18:55:17,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17" (1/1) ... [2024-11-06 18:55:17,255 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17" (1/1) ... [2024-11-06 18:55:17,280 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 18:55:17,281 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17" (1/1) ... [2024-11-06 18:55:17,281 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17" (1/1) ... [2024-11-06 18:55:17,298 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17" (1/1) ... [2024-11-06 18:55:17,306 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17" (1/1) ... [2024-11-06 18:55:17,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17" (1/1) ... [2024-11-06 18:55:17,312 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17" (1/1) ... [2024-11-06 18:55:17,317 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 18:55:17,318 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 18:55:17,318 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 18:55:17,318 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 18:55:17,319 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17" (1/1) ... [2024-11-06 18:55:17,323 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:55:17,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:55:17,351 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 18:55:17,356 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 18:55:17,371 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 18:55:17,372 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 18:55:17,372 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 18:55:17,373 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 18:55:17,435 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 18:55:17,437 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 18:55:18,226 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-06 18:55:18,226 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 18:55:18,241 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 18:55:18,241 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 18:55:18,241 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:55:18 BoogieIcfgContainer [2024-11-06 18:55:18,241 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 18:55:18,243 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 18:55:18,243 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 18:55:18,246 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 18:55:18,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:55:16" (1/3) ... [2024-11-06 18:55:18,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@336713b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:55:18, skipping insertion in model container [2024-11-06 18:55:18,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:17" (2/3) ... [2024-11-06 18:55:18,247 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@336713b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:55:18, skipping insertion in model container [2024-11-06 18:55:18,247 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:55:18" (3/3) ... [2024-11-06 18:55:18,248 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label39.c [2024-11-06 18:55:18,261 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 18:55:18,261 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 18:55:18,313 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 18:55:18,324 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;@6685364f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 18:55:18,325 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 18:55:18,330 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:18,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2024-11-06 18:55:18,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:18,339 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:55:18,340 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:18,343 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:18,344 INFO L85 PathProgramCache]: Analyzing trace with hash -1738135197, now seen corresponding path program 1 times [2024-11-06 18:55:18,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:18,350 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1954353960] [2024-11-06 18:55:18,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:18,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:18,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:18,794 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 18:55:18,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:18,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1954353960] [2024-11-06 18:55:18,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1954353960] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:18,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:18,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:55:18,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1883705493] [2024-11-06 18:55:18,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:18,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:18,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:18,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:18,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:18,819 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 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 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:19,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:19,434 INFO L93 Difference]: Finished difference Result 630 states and 1070 transitions. [2024-11-06 18:55:19,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:19,436 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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 111 [2024-11-06 18:55:19,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:19,443 INFO L225 Difference]: With dead ends: 630 [2024-11-06 18:55:19,444 INFO L226 Difference]: Without dead ends: 318 [2024-11-06 18:55:19,446 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 18:55:19,448 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 119 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:19,448 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 119 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:55:19,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-06 18:55:19,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2024-11-06 18:55:19,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 317 states have (on average 1.473186119873817) internal successors, (467), 317 states have internal predecessors, (467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:19,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 467 transitions. [2024-11-06 18:55:19,486 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 467 transitions. Word has length 111 [2024-11-06 18:55:19,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:19,487 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 467 transitions. [2024-11-06 18:55:19,487 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:19,488 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 467 transitions. [2024-11-06 18:55:19,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-11-06 18:55:19,489 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:19,489 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-06 18:55:19,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 18:55:19,490 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:19,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:19,491 INFO L85 PathProgramCache]: Analyzing trace with hash -215551336, now seen corresponding path program 1 times [2024-11-06 18:55:19,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:19,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895098473] [2024-11-06 18:55:19,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:19,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:19,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:19,805 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:55:19,805 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:19,805 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895098473] [2024-11-06 18:55:19,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895098473] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:19,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:19,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:19,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689578293] [2024-11-06 18:55:19,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:19,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:55:19,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:19,807 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:55:19,807 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:55:19,807 INFO L87 Difference]: Start difference. First operand 318 states and 467 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:20,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:20,432 INFO L93 Difference]: Finished difference Result 999 states and 1508 transitions. [2024-11-06 18:55:20,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:55:20,433 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 115 [2024-11-06 18:55:20,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:20,435 INFO L225 Difference]: With dead ends: 999 [2024-11-06 18:55:20,435 INFO L226 Difference]: Without dead ends: 600 [2024-11-06 18:55:20,436 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 18:55:20,437 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 171 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 665 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 800 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:20,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 113 Invalid, 800 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 665 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:55:20,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 600 states. [2024-11-06 18:55:20,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 600 to 600. [2024-11-06 18:55:20,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 600 states, 599 states have (on average 1.358931552587646) internal successors, (814), 599 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:20,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 600 states to 600 states and 814 transitions. [2024-11-06 18:55:20,453 INFO L78 Accepts]: Start accepts. Automaton has 600 states and 814 transitions. Word has length 115 [2024-11-06 18:55:20,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:20,453 INFO L471 AbstractCegarLoop]: Abstraction has 600 states and 814 transitions. [2024-11-06 18:55:20,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:20,453 INFO L276 IsEmpty]: Start isEmpty. Operand 600 states and 814 transitions. [2024-11-06 18:55:20,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-06 18:55:20,455 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:20,455 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-06 18:55:20,455 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 18:55:20,455 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:20,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:20,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1229678270, now seen corresponding path program 1 times [2024-11-06 18:55:20,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:20,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630102664] [2024-11-06 18:55:20,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:20,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:20,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:20,545 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:55:20,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:20,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630102664] [2024-11-06 18:55:20,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630102664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:20,545 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:20,545 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:55:20,545 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [584322725] [2024-11-06 18:55:20,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:20,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:20,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:20,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:20,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:20,546 INFO L87 Difference]: Start difference. First operand 600 states and 814 transitions. Second operand has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:20,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:20,897 INFO L93 Difference]: Finished difference Result 1779 states and 2420 transitions. [2024-11-06 18:55:20,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:20,897 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 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 129 [2024-11-06 18:55:20,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:20,901 INFO L225 Difference]: With dead ends: 1779 [2024-11-06 18:55:20,901 INFO L226 Difference]: Without dead ends: 1181 [2024-11-06 18:55:20,902 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 18:55:20,902 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 156 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 429 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:20,902 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 100 Invalid, 429 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:55:20,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2024-11-06 18:55:20,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1173. [2024-11-06 18:55:20,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1173 states, 1172 states have (on average 1.3114334470989761) internal successors, (1537), 1172 states have internal predecessors, (1537), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:20,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1173 states to 1173 states and 1537 transitions. [2024-11-06 18:55:20,932 INFO L78 Accepts]: Start accepts. Automaton has 1173 states and 1537 transitions. Word has length 129 [2024-11-06 18:55:20,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:20,932 INFO L471 AbstractCegarLoop]: Abstraction has 1173 states and 1537 transitions. [2024-11-06 18:55:20,934 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.0) internal successors, (129), 2 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:20,934 INFO L276 IsEmpty]: Start isEmpty. Operand 1173 states and 1537 transitions. [2024-11-06 18:55:20,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-06 18:55:20,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:20,941 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:55:20,941 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 18:55:20,941 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:20,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:20,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1106094347, now seen corresponding path program 1 times [2024-11-06 18:55:20,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:20,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312626854] [2024-11-06 18:55:20,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:20,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:20,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:21,062 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 18:55:21,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:21,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312626854] [2024-11-06 18:55:21,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312626854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:21,063 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:21,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:55:21,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069648882] [2024-11-06 18:55:21,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:21,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:21,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:21,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:21,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:21,064 INFO L87 Difference]: Start difference. First operand 1173 states and 1537 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:21,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:21,467 INFO L93 Difference]: Finished difference Result 3329 states and 4387 transitions. [2024-11-06 18:55:21,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:21,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 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 141 [2024-11-06 18:55:21,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:21,475 INFO L225 Difference]: With dead ends: 3329 [2024-11-06 18:55:21,476 INFO L226 Difference]: Without dead ends: 2158 [2024-11-06 18:55:21,477 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 18:55:21,477 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 126 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:21,478 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 127 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 18:55:21,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2024-11-06 18:55:21,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 2155. [2024-11-06 18:55:21,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2155 states, 2154 states have (on average 1.200557103064067) internal successors, (2586), 2154 states have internal predecessors, (2586), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:21,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2155 states to 2155 states and 2586 transitions. [2024-11-06 18:55:21,509 INFO L78 Accepts]: Start accepts. Automaton has 2155 states and 2586 transitions. Word has length 141 [2024-11-06 18:55:21,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:21,510 INFO L471 AbstractCegarLoop]: Abstraction has 2155 states and 2586 transitions. [2024-11-06 18:55:21,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 2 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:21,510 INFO L276 IsEmpty]: Start isEmpty. Operand 2155 states and 2586 transitions. [2024-11-06 18:55:21,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-11-06 18:55:21,513 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:21,513 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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] [2024-11-06 18:55:21,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 18:55:21,513 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:21,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:21,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1261230373, now seen corresponding path program 1 times [2024-11-06 18:55:21,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:21,514 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317332895] [2024-11-06 18:55:21,514 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:21,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:21,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:21,623 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-06 18:55:21,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:21,624 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317332895] [2024-11-06 18:55:21,624 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317332895] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:21,624 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:21,624 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:21,624 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523087374] [2024-11-06 18:55:21,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:21,625 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:21,625 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:21,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:21,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:21,626 INFO L87 Difference]: Start difference. First operand 2155 states and 2586 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:21,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:21,991 INFO L93 Difference]: Finished difference Result 5309 states and 6453 transitions. [2024-11-06 18:55:21,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:21,992 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 144 [2024-11-06 18:55:21,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:22,001 INFO L225 Difference]: With dead ends: 5309 [2024-11-06 18:55:22,001 INFO L226 Difference]: Without dead ends: 3156 [2024-11-06 18:55:22,003 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 18:55:22,004 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 158 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:22,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 254 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:55:22,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3156 states. [2024-11-06 18:55:22,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3156 to 2876. [2024-11-06 18:55:22,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2876 states, 2875 states have (on average 1.1822608695652175) internal successors, (3399), 2875 states have internal predecessors, (3399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:22,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2876 states to 2876 states and 3399 transitions. [2024-11-06 18:55:22,052 INFO L78 Accepts]: Start accepts. Automaton has 2876 states and 3399 transitions. Word has length 144 [2024-11-06 18:55:22,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:22,052 INFO L471 AbstractCegarLoop]: Abstraction has 2876 states and 3399 transitions. [2024-11-06 18:55:22,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:22,052 INFO L276 IsEmpty]: Start isEmpty. Operand 2876 states and 3399 transitions. [2024-11-06 18:55:22,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2024-11-06 18:55:22,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:22,057 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:55:22,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 18:55:22,057 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:22,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:22,058 INFO L85 PathProgramCache]: Analyzing trace with hash -39522805, now seen corresponding path program 1 times [2024-11-06 18:55:22,058 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:22,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181997660] [2024-11-06 18:55:22,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:22,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:22,149 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:55:22,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:22,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181997660] [2024-11-06 18:55:22,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181997660] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:22,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:22,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:22,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141614402] [2024-11-06 18:55:22,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:22,150 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:22,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:22,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:22,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:22,151 INFO L87 Difference]: Start difference. First operand 2876 states and 3399 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:22,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:22,558 INFO L93 Difference]: Finished difference Result 6735 states and 8088 transitions. [2024-11-06 18:55:22,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:22,558 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 147 [2024-11-06 18:55:22,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:22,569 INFO L225 Difference]: With dead ends: 6735 [2024-11-06 18:55:22,569 INFO L226 Difference]: Without dead ends: 3861 [2024-11-06 18:55:22,573 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 18:55:22,573 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 152 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 118 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 468 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 118 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:22,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 59 Invalid, 468 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [118 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 18:55:22,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3861 states. [2024-11-06 18:55:22,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3861 to 3714. [2024-11-06 18:55:22,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3714 states, 3713 states have (on average 1.2011850255857797) internal successors, (4460), 3713 states have internal predecessors, (4460), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:22,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3714 states to 3714 states and 4460 transitions. [2024-11-06 18:55:22,637 INFO L78 Accepts]: Start accepts. Automaton has 3714 states and 4460 transitions. Word has length 147 [2024-11-06 18:55:22,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:22,638 INFO L471 AbstractCegarLoop]: Abstraction has 3714 states and 4460 transitions. [2024-11-06 18:55:22,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:22,638 INFO L276 IsEmpty]: Start isEmpty. Operand 3714 states and 4460 transitions. [2024-11-06 18:55:22,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-06 18:55:22,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:22,642 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:55:22,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 18:55:22,642 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:22,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:22,643 INFO L85 PathProgramCache]: Analyzing trace with hash -35348223, now seen corresponding path program 1 times [2024-11-06 18:55:22,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:22,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555815007] [2024-11-06 18:55:22,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:22,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:22,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:22,698 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 47 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:55:22,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:22,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555815007] [2024-11-06 18:55:22,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555815007] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:22,698 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:22,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:22,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125941292] [2024-11-06 18:55:22,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:22,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:22,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:22,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:22,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:22,699 INFO L87 Difference]: Start difference. First operand 3714 states and 4460 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:23,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:23,063 INFO L93 Difference]: Finished difference Result 7573 states and 9010 transitions. [2024-11-06 18:55:23,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:23,064 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 151 [2024-11-06 18:55:23,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:23,074 INFO L225 Difference]: With dead ends: 7573 [2024-11-06 18:55:23,074 INFO L226 Difference]: Without dead ends: 3721 [2024-11-06 18:55:23,078 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 18:55:23,078 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 138 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 357 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 357 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:23,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 281 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 357 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:55:23,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3721 states. [2024-11-06 18:55:23,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3721 to 3423. [2024-11-06 18:55:23,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3423 states, 3422 states have (on average 1.1531268264172998) internal successors, (3946), 3422 states have internal predecessors, (3946), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:23,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3423 states to 3423 states and 3946 transitions. [2024-11-06 18:55:23,133 INFO L78 Accepts]: Start accepts. Automaton has 3423 states and 3946 transitions. Word has length 151 [2024-11-06 18:55:23,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:23,134 INFO L471 AbstractCegarLoop]: Abstraction has 3423 states and 3946 transitions. [2024-11-06 18:55:23,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:23,135 INFO L276 IsEmpty]: Start isEmpty. Operand 3423 states and 3946 transitions. [2024-11-06 18:55:23,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2024-11-06 18:55:23,139 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:23,139 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:55:23,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 18:55:23,139 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:23,139 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:23,140 INFO L85 PathProgramCache]: Analyzing trace with hash 96919813, now seen corresponding path program 1 times [2024-11-06 18:55:23,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:23,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416563074] [2024-11-06 18:55:23,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:23,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:23,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:23,219 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 72 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-06 18:55:23,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:23,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416563074] [2024-11-06 18:55:23,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416563074] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:23,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:23,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:23,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767507555] [2024-11-06 18:55:23,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:23,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:23,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:23,220 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:23,220 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:23,221 INFO L87 Difference]: Start difference. First operand 3423 states and 3946 transitions. Second operand has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:23,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:23,624 INFO L93 Difference]: Finished difference Result 7821 states and 9061 transitions. [2024-11-06 18:55:23,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:23,624 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 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 158 [2024-11-06 18:55:23,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:23,633 INFO L225 Difference]: With dead ends: 7821 [2024-11-06 18:55:23,633 INFO L226 Difference]: Without dead ends: 2987 [2024-11-06 18:55:23,637 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 18:55:23,638 INFO L432 NwaCegarLoop]: 242 mSDtfsCounter, 124 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:23,638 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 262 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 18:55:23,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2987 states. [2024-11-06 18:55:23,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2987 to 2987. [2024-11-06 18:55:23,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2987 states, 2986 states have (on average 1.1121902210314802) internal successors, (3321), 2986 states have internal predecessors, (3321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:23,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2987 states to 2987 states and 3321 transitions. [2024-11-06 18:55:23,682 INFO L78 Accepts]: Start accepts. Automaton has 2987 states and 3321 transitions. Word has length 158 [2024-11-06 18:55:23,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:23,683 INFO L471 AbstractCegarLoop]: Abstraction has 2987 states and 3321 transitions. [2024-11-06 18:55:23,683 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.333333333333336) internal successors, (151), 3 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:23,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2987 states and 3321 transitions. [2024-11-06 18:55:23,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2024-11-06 18:55:23,686 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:23,687 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 18:55:23,687 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 18:55:23,687 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:23,687 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:23,687 INFO L85 PathProgramCache]: Analyzing trace with hash -1697406424, now seen corresponding path program 1 times [2024-11-06 18:55:23,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:23,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304314209] [2024-11-06 18:55:23,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:23,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:23,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:23,768 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 76 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-06 18:55:23,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:23,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304314209] [2024-11-06 18:55:23,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304314209] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:23,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:23,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:23,769 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [146017883] [2024-11-06 18:55:23,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:23,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:23,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:23,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:23,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:23,771 INFO L87 Difference]: Start difference. First operand 2987 states and 3321 transitions. Second operand has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:24,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:24,091 INFO L93 Difference]: Finished difference Result 6113 states and 6793 transitions. [2024-11-06 18:55:24,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:24,092 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 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 172 [2024-11-06 18:55:24,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:24,099 INFO L225 Difference]: With dead ends: 6113 [2024-11-06 18:55:24,099 INFO L226 Difference]: Without dead ends: 3128 [2024-11-06 18:55:24,102 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 18:55:24,102 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 111 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:24,103 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 233 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:55:24,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3128 states. [2024-11-06 18:55:24,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3128 to 3127. [2024-11-06 18:55:24,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3127 states, 3126 states have (on average 1.099488163787588) internal successors, (3437), 3126 states have internal predecessors, (3437), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:24,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3127 states to 3127 states and 3437 transitions. [2024-11-06 18:55:24,143 INFO L78 Accepts]: Start accepts. Automaton has 3127 states and 3437 transitions. Word has length 172 [2024-11-06 18:55:24,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:24,143 INFO L471 AbstractCegarLoop]: Abstraction has 3127 states and 3437 transitions. [2024-11-06 18:55:24,143 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 51.0) internal successors, (153), 3 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:24,143 INFO L276 IsEmpty]: Start isEmpty. Operand 3127 states and 3437 transitions. [2024-11-06 18:55:24,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 194 [2024-11-06 18:55:24,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:24,146 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:55:24,146 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 18:55:24,147 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:24,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:24,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1661181254, now seen corresponding path program 1 times [2024-11-06 18:55:24,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:24,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231523503] [2024-11-06 18:55:24,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:24,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:24,252 INFO L134 CoverageAnalysis]: Checked inductivity of 149 backedges. 129 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2024-11-06 18:55:24,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:24,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231523503] [2024-11-06 18:55:24,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231523503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:24,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:24,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:24,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [734609785] [2024-11-06 18:55:24,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:24,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:24,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:24,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:24,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:24,255 INFO L87 Difference]: Start difference. First operand 3127 states and 3437 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:24,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:24,604 INFO L93 Difference]: Finished difference Result 7376 states and 8187 transitions. [2024-11-06 18:55:24,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:24,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 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 193 [2024-11-06 18:55:24,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:24,616 INFO L225 Difference]: With dead ends: 7376 [2024-11-06 18:55:24,616 INFO L226 Difference]: Without dead ends: 4251 [2024-11-06 18:55:24,620 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 18:55:24,622 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 131 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:24,623 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 206 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:55:24,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4251 states. [2024-11-06 18:55:24,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4251 to 4249. [2024-11-06 18:55:24,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4249 states, 4248 states have (on average 1.0995762711864407) internal successors, (4671), 4248 states have internal predecessors, (4671), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:24,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4249 states to 4249 states and 4671 transitions. [2024-11-06 18:55:24,687 INFO L78 Accepts]: Start accepts. Automaton has 4249 states and 4671 transitions. Word has length 193 [2024-11-06 18:55:24,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:24,687 INFO L471 AbstractCegarLoop]: Abstraction has 4249 states and 4671 transitions. [2024-11-06 18:55:24,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 3 states have internal predecessors, (174), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:24,688 INFO L276 IsEmpty]: Start isEmpty. Operand 4249 states and 4671 transitions. [2024-11-06 18:55:24,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2024-11-06 18:55:24,694 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:24,695 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 18:55:24,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 18:55:24,695 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:24,695 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:24,695 INFO L85 PathProgramCache]: Analyzing trace with hash -981115828, now seen corresponding path program 1 times [2024-11-06 18:55:24,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:24,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867026709] [2024-11-06 18:55:24,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:24,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:24,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:24,817 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-06 18:55:24,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:24,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867026709] [2024-11-06 18:55:24,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867026709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:24,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:24,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:24,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882895291] [2024-11-06 18:55:24,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:24,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:24,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:24,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:24,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:24,819 INFO L87 Difference]: Start difference. First operand 4249 states and 4671 transitions. Second operand has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:25,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:25,161 INFO L93 Difference]: Finished difference Result 9196 states and 10094 transitions. [2024-11-06 18:55:25,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:25,161 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 227 [2024-11-06 18:55:25,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:25,170 INFO L225 Difference]: With dead ends: 9196 [2024-11-06 18:55:25,171 INFO L226 Difference]: Without dead ends: 4247 [2024-11-06 18:55:25,174 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 18:55:25,175 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 82 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:25,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 219 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:55:25,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4247 states. [2024-11-06 18:55:25,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4247 to 4107. [2024-11-06 18:55:25,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4107 states, 4106 states have (on average 1.0606429615197273) internal successors, (4355), 4106 states have internal predecessors, (4355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:25,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4107 states to 4107 states and 4355 transitions. [2024-11-06 18:55:25,226 INFO L78 Accepts]: Start accepts. Automaton has 4107 states and 4355 transitions. Word has length 227 [2024-11-06 18:55:25,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:25,226 INFO L471 AbstractCegarLoop]: Abstraction has 4107 states and 4355 transitions. [2024-11-06 18:55:25,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 63.666666666666664) internal successors, (191), 3 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:25,227 INFO L276 IsEmpty]: Start isEmpty. Operand 4107 states and 4355 transitions. [2024-11-06 18:55:25,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2024-11-06 18:55:25,232 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:25,233 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:55:25,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 18:55:25,233 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:25,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:25,233 INFO L85 PathProgramCache]: Analyzing trace with hash -1369005853, now seen corresponding path program 1 times [2024-11-06 18:55:25,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:25,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [87162863] [2024-11-06 18:55:25,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:25,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:25,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:25,317 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 213 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2024-11-06 18:55:25,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:25,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [87162863] [2024-11-06 18:55:25,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [87162863] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:25,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:25,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:25,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987293285] [2024-11-06 18:55:25,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:25,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:25,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:25,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:25,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:25,319 INFO L87 Difference]: Start difference. First operand 4107 states and 4355 transitions. Second operand has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:25,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:25,589 INFO L93 Difference]: Finished difference Result 6510 states and 6850 transitions. [2024-11-06 18:55:25,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:25,589 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 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 245 [2024-11-06 18:55:25,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:25,598 INFO L225 Difference]: With dead ends: 6510 [2024-11-06 18:55:25,599 INFO L226 Difference]: Without dead ends: 2405 [2024-11-06 18:55:25,602 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 18:55:25,602 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 152 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:25,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 46 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 305 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 18:55:25,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2405 states. [2024-11-06 18:55:25,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2405 to 2265. [2024-11-06 18:55:25,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2265 states, 2264 states have (on average 1.0331272084805654) internal successors, (2339), 2264 states have internal predecessors, (2339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:25,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2265 states to 2265 states and 2339 transitions. [2024-11-06 18:55:25,634 INFO L78 Accepts]: Start accepts. Automaton has 2265 states and 2339 transitions. Word has length 245 [2024-11-06 18:55:25,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:25,635 INFO L471 AbstractCegarLoop]: Abstraction has 2265 states and 2339 transitions. [2024-11-06 18:55:25,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 61.0) internal successors, (183), 3 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:25,639 INFO L276 IsEmpty]: Start isEmpty. Operand 2265 states and 2339 transitions. [2024-11-06 18:55:25,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2024-11-06 18:55:25,642 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:25,642 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:55:25,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 18:55:25,642 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:25,643 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:25,643 INFO L85 PathProgramCache]: Analyzing trace with hash 995979598, now seen corresponding path program 1 times [2024-11-06 18:55:25,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:25,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58701949] [2024-11-06 18:55:25,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:25,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:25,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:25,866 INFO L134 CoverageAnalysis]: Checked inductivity of 242 backedges. 242 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:55:25,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:25,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58701949] [2024-11-06 18:55:25,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58701949] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:25,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:25,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:55:25,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924012814] [2024-11-06 18:55:25,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:25,867 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:55:25,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:25,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:55:25,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:55:25,868 INFO L87 Difference]: Start difference. First operand 2265 states and 2339 transitions. Second operand has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:26,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:26,310 INFO L93 Difference]: Finished difference Result 4387 states and 4531 transitions. [2024-11-06 18:55:26,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:55:26,310 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 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 246 [2024-11-06 18:55:26,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:26,313 INFO L225 Difference]: With dead ends: 4387 [2024-11-06 18:55:26,313 INFO L226 Difference]: Without dead ends: 2264 [2024-11-06 18:55:26,315 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:55:26,315 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 218 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 723 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:26,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [218 Valid, 220 Invalid, 734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 723 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 18:55:26,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2024-11-06 18:55:26,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 1981. [2024-11-06 18:55:26,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1981 states, 1980 states have (on average 1.0328282828282829) internal successors, (2045), 1980 states have internal predecessors, (2045), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:26,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1981 states to 1981 states and 2045 transitions. [2024-11-06 18:55:26,334 INFO L78 Accepts]: Start accepts. Automaton has 1981 states and 2045 transitions. Word has length 246 [2024-11-06 18:55:26,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:26,334 INFO L471 AbstractCegarLoop]: Abstraction has 1981 states and 2045 transitions. [2024-11-06 18:55:26,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 61.5) internal successors, (246), 4 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:26,335 INFO L276 IsEmpty]: Start isEmpty. Operand 1981 states and 2045 transitions. [2024-11-06 18:55:26,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-06 18:55:26,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:26,338 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:55:26,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 18:55:26,338 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:26,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:26,338 INFO L85 PathProgramCache]: Analyzing trace with hash 1088030914, now seen corresponding path program 1 times [2024-11-06 18:55:26,338 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:26,338 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809608766] [2024-11-06 18:55:26,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:26,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:26,427 INFO L134 CoverageAnalysis]: Checked inductivity of 321 backedges. 259 proven. 0 refuted. 0 times theorem prover too weak. 62 trivial. 0 not checked. [2024-11-06 18:55:26,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:26,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809608766] [2024-11-06 18:55:26,427 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809608766] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:26,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:26,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:26,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622834355] [2024-11-06 18:55:26,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:26,428 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:26,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:26,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:26,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:26,429 INFO L87 Difference]: Start difference. First operand 1981 states and 2045 transitions. Second operand has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:26,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:26,676 INFO L93 Difference]: Finished difference Result 2401 states and 2476 transitions. [2024-11-06 18:55:26,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:26,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 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 268 [2024-11-06 18:55:26,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:26,678 INFO L225 Difference]: With dead ends: 2401 [2024-11-06 18:55:26,678 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 18:55:26,679 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 18:55:26,680 INFO L432 NwaCegarLoop]: 179 mSDtfsCounter, 101 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:26,680 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 191 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 18:55:26,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 18:55:26,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 18:55:26,681 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 18:55:26,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 18:55:26,681 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 268 [2024-11-06 18:55:26,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:26,681 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 18:55:26,681 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 74.0) internal successors, (222), 3 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:26,681 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 18:55:26,682 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 18:55:26,683 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 18:55:26,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 18:55:26,686 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:55:26,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 18:55:27,067 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 18:55:27,078 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 06:55:27 BoogieIcfgContainer [2024-11-06 18:55:27,078 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 18:55:27,078 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 18:55:27,078 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 18:55:27,078 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 18:55:27,079 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:55:18" (3/4) ... [2024-11-06 18:55:27,080 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 18:55:27,099 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-06 18:55:27,100 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 18:55:27,100 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 18:55:27,101 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 18:55:27,195 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 18:55:27,196 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 18:55:27,196 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 18:55:27,196 INFO L158 Benchmark]: Toolchain (without parser) took 10361.35ms. Allocated memory was 117.4MB in the beginning and 302.0MB in the end (delta: 184.5MB). Free memory was 90.4MB in the beginning and 149.1MB in the end (delta: -58.7MB). Peak memory consumption was 124.8MB. Max. memory is 16.1GB. [2024-11-06 18:55:27,196 INFO L158 Benchmark]: CDTParser took 0.85ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:55:27,197 INFO L158 Benchmark]: CACSL2BoogieTranslator took 351.32ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 64.1MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-06 18:55:27,197 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.80ms. Allocated memory is still 117.4MB. Free memory was 64.1MB in the beginning and 59.1MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:55:27,197 INFO L158 Benchmark]: Boogie Preprocessor took 73.14ms. Allocated memory is still 117.4MB. Free memory was 58.9MB in the beginning and 54.4MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:55:27,197 INFO L158 Benchmark]: RCFGBuilder took 923.54ms. Allocated memory is still 117.4MB. Free memory was 54.2MB in the beginning and 66.6MB in the end (delta: -12.4MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. [2024-11-06 18:55:27,197 INFO L158 Benchmark]: TraceAbstraction took 8835.01ms. Allocated memory was 117.4MB in the beginning and 302.0MB in the end (delta: 184.5MB). Free memory was 66.0MB in the beginning and 160.1MB in the end (delta: -94.1MB). Peak memory consumption was 89.5MB. Max. memory is 16.1GB. [2024-11-06 18:55:27,197 INFO L158 Benchmark]: Witness Printer took 117.63ms. Allocated memory is still 302.0MB. Free memory was 160.1MB in the beginning and 149.1MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:55:27,198 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.85ms. Allocated memory is still 117.4MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 351.32ms. Allocated memory is still 117.4MB. Free memory was 90.2MB in the beginning and 64.1MB in the end (delta: 26.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.80ms. Allocated memory is still 117.4MB. Free memory was 64.1MB in the beginning and 59.1MB in the end (delta: 5.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.14ms. Allocated memory is still 117.4MB. Free memory was 58.9MB in the beginning and 54.4MB in the end (delta: 4.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 923.54ms. Allocated memory is still 117.4MB. Free memory was 54.2MB in the beginning and 66.6MB in the end (delta: -12.4MB). Peak memory consumption was 32.9MB. Max. memory is 16.1GB. * TraceAbstraction took 8835.01ms. Allocated memory was 117.4MB in the beginning and 302.0MB in the end (delta: 184.5MB). Free memory was 66.0MB in the beginning and 160.1MB in the end (delta: -94.1MB). Peak memory consumption was 89.5MB. Max. memory is 16.1GB. * Witness Printer took 117.63ms. Allocated memory is still 302.0MB. Free memory was 160.1MB in the beginning and 149.1MB in the end (delta: 11.0MB). Peak memory consumption was 8.4MB. 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: 515]: 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, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.4s, OverallIterations: 14, TraceHistogramMax: 7, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1939 SdHoareTripleChecker+Valid, 5.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1939 mSDsluCounter, 2430 SdHoareTripleChecker+Invalid, 4.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 266 mSDsCounter, 841 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5641 IncrementalHoareTripleChecker+Invalid, 6482 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 841 mSolverCounterUnsat, 2164 mSDtfsCounter, 5641 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4249occurred in iteration=10, InterpolantAutomatonStates: 44, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 1302 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 2447 NumberOfCodeBlocks, 2447 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2433 ConstructedInterpolants, 0 QuantifiedInterpolants, 5169 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 1552/1552 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: 616]: Loop Invariant Derived loop invariant: ((((((((((((((((a17 <= 7) && (a25 <= 0)) || (((a19 == 0) && (a11 <= 0)) && (a25 <= 0))) || (((((a17 == 8) && (a25 == 1)) && (a28 == 10)) && (a21 == 1)) && (a19 == 1))) || (((a25 == 1) && (a17 <= 7)) && (a28 <= 10))) || ((((a25 == 1) && (a11 <= 0)) && (a28 <= 10)) && (a19 == 1))) || ((((a19 == 0) && (a25 == 1)) && (a28 == 10)) && (a11 <= 0))) || (((a19 == 0) && (a11 <= 0)) && (a28 <= 7))) || (((a19 == 0) && (a11 == 1)) && (a28 <= 7))) || ((((((a17 == 8) && (a21 == 1)) && (a11 <= 0)) && (a19 == 1)) && (a28 <= 7)) && (a25 <= 0))) || (((((a17 == 8) && (a28 == 10)) && (a21 == 1)) && (a19 == 1)) && (a25 <= 0))) || (((a25 == 1) && (a17 <= 7)) && (a11 <= 0))) || ((((((a17 == 8) && (a25 == 1)) && (a11 == 1)) && (a21 == 1)) && (a19 == 1)) && (a28 == 9))) || (((((((a17 == 8) && (9 <= a28)) && (a21 == 1)) && (a11 <= 0)) && (a28 <= 10)) && (a19 == 1)) && (a25 <= 0))) || (((((a17 == 8) && (11 <= a28)) && (a25 == 1)) && (a21 == 1)) && (a19 == 1))) || (((((((a17 == 8) && (9 <= a28)) && (a11 == 1)) && (a21 == 1)) && (a28 <= 10)) && (a19 == 1)) && (a25 <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-06 18:55:27,219 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE