./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label22.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/Problem13_label22.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', 'a5646bd4d96b8fcc9e551b79d403a795dc3f85c7ce3ca7ca69beb4234714a055'] 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/Problem13_label22.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 a5646bd4d96b8fcc9e551b79d403a795dc3f85c7ce3ca7ca69beb4234714a055 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:47:50,753 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:47:50,834 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 19:47:50,841 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:47:50,844 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:47:50,874 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:47:50,877 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:47:50,877 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:47:50,877 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:47:50,878 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:47:50,878 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:47:50,878 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:47:50,879 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:47:50,879 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:47:50,879 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:47:50,880 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:47:50,880 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:47:50,880 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:47:50,880 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:47:50,880 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:47:50,880 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:47:50,880 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:47:50,881 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:47:50,881 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:47:50,881 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:47:50,881 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:47:50,881 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:47:50,882 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:47:50,882 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:47:50,882 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:47:50,882 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:47:50,882 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:47:50,882 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:47:50,883 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:47:50,883 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:47:50,883 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:47:50,884 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:47:50,884 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:47:50,884 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:47:50,884 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:47:50,884 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:47:50,884 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:47:50,884 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 -> a5646bd4d96b8fcc9e551b79d403a795dc3f85c7ce3ca7ca69beb4234714a055 [2024-11-06 19:47:51,110 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:47:51,121 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:47:51,124 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:47:51,126 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:47:51,126 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:47:51,127 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label22.c [2024-11-06 19:47:52,422 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:47:53,017 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:47:53,019 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label22.c [2024-11-06 19:47:53,060 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e5e965634/950c1f3667bd4dd69228a275a8c4951b/FLAG443bd55d8 [2024-11-06 19:47:53,081 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/e5e965634/950c1f3667bd4dd69228a275a8c4951b [2024-11-06 19:47:53,083 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:47:53,085 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:47:53,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:47:53,086 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:47:53,090 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:47:53,091 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:47:53" (1/1) ... [2024-11-06 19:47:53,093 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@470a769d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:53, skipping insertion in model container [2024-11-06 19:47:53,093 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:47:53" (1/1) ... [2024-11-06 19:47:53,192 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:47:53,428 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/Problem13_label22.c[4777,4790] [2024-11-06 19:47:54,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:47:54,103 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:47:54,127 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/Problem13_label22.c[4777,4790] [2024-11-06 19:47:54,478 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:47:54,500 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:47:54,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:54 WrapperNode [2024-11-06 19:47:54,502 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:47:54,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:47:54,504 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:47:54,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:47:54,509 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:54" (1/1) ... [2024-11-06 19:47:54,571 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:54" (1/1) ... [2024-11-06 19:47:55,140 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-11-06 19:47:55,141 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:47:55,142 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:47:55,142 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:47:55,143 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:47:55,156 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:54" (1/1) ... [2024-11-06 19:47:55,157 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:54" (1/1) ... [2024-11-06 19:47:55,235 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:54" (1/1) ... [2024-11-06 19:47:55,497 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-06 19:47:55,497 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:54" (1/1) ... [2024-11-06 19:47:55,497 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:54" (1/1) ... [2024-11-06 19:47:55,678 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:54" (1/1) ... [2024-11-06 19:47:55,726 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:54" (1/1) ... [2024-11-06 19:47:55,770 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:54" (1/1) ... [2024-11-06 19:47:55,808 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:54" (1/1) ... [2024-11-06 19:47:55,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:47:55,969 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:47:55,969 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:47:55,970 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:47:55,971 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:54" (1/1) ... [2024-11-06 19:47:55,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:47:56,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:47:56,033 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 19:47:56,041 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 19:47:56,073 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:47:56,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:47:56,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:47:56,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:47:56,144 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:47:56,145 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:48:01,514 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-11-06 19:48:01,514 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:48:01,553 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:48:01,553 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:48:01,554 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:48:01 BoogieIcfgContainer [2024-11-06 19:48:01,554 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:48:01,556 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:48:01,556 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:48:01,561 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:48:01,561 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:47:53" (1/3) ... [2024-11-06 19:48:01,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754a257e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:48:01, skipping insertion in model container [2024-11-06 19:48:01,562 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:54" (2/3) ... [2024-11-06 19:48:01,562 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@754a257e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:48:01, skipping insertion in model container [2024-11-06 19:48:01,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:48:01" (3/3) ... [2024-11-06 19:48:01,564 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label22.c [2024-11-06 19:48:01,578 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:48:01,579 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:48:01,672 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:48:01,684 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;@2ab5fd57, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:48:01,685 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:48:01,695 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:01,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-06 19:48:01,702 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:01,704 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] [2024-11-06 19:48:01,705 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:01,709 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:01,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1317301102, now seen corresponding path program 1 times [2024-11-06 19:48:01,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:01,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21046556] [2024-11-06 19:48:01,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:01,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:01,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:02,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:48:02,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:02,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21046556] [2024-11-06 19:48:02,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21046556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:02,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:48:02,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:48:02,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1929837224] [2024-11-06 19:48:02,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:02,023 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:48:02,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:02,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:48:02,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:02,047 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 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 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:06,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:06,016 INFO L93 Difference]: Finished difference Result 3121 states and 5804 transitions. [2024-11-06 19:48:06,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:48:06,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 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 32 [2024-11-06 19:48:06,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:06,037 INFO L225 Difference]: With dead ends: 3121 [2024-11-06 19:48:06,038 INFO L226 Difference]: Without dead ends: 1944 [2024-11-06 19:48:06,047 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:06,049 INFO L432 NwaCegarLoop]: 438 mSDtfsCounter, 957 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 3124 mSolverCounterSat, 577 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 957 SdHoareTripleChecker+Valid, 575 SdHoareTripleChecker+Invalid, 3701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 577 IncrementalHoareTripleChecker+Valid, 3124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:06,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [957 Valid, 575 Invalid, 3701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [577 Valid, 3124 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-06 19:48:06,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1944 states. [2024-11-06 19:48:06,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1944 to 1873. [2024-11-06 19:48:06,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1873 states, 1872 states have (on average 1.7393162393162394) internal successors, (3256), 1872 states have internal predecessors, (3256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:06,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1873 states to 1873 states and 3256 transitions. [2024-11-06 19:48:06,159 INFO L78 Accepts]: Start accepts. Automaton has 1873 states and 3256 transitions. Word has length 32 [2024-11-06 19:48:06,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:06,159 INFO L471 AbstractCegarLoop]: Abstraction has 1873 states and 3256 transitions. [2024-11-06 19:48:06,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 10.666666666666666) internal successors, (32), 2 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:06,159 INFO L276 IsEmpty]: Start isEmpty. Operand 1873 states and 3256 transitions. [2024-11-06 19:48:06,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2024-11-06 19:48:06,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:06,162 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:48:06,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:48:06,162 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:06,163 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:06,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1153859322, now seen corresponding path program 1 times [2024-11-06 19:48:06,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:06,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [703693590] [2024-11-06 19:48:06,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:06,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:06,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:06,438 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:48:06,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:06,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [703693590] [2024-11-06 19:48:06,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [703693590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:06,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:48:06,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:48:06,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1583212287] [2024-11-06 19:48:06,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:06,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:48:06,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:06,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:48:06,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:06,442 INFO L87 Difference]: Start difference. First operand 1873 states and 3256 transitions. Second operand has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:09,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:09,631 INFO L93 Difference]: Finished difference Result 5351 states and 9369 transitions. [2024-11-06 19:48:09,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:48:09,632 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 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 97 [2024-11-06 19:48:09,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:09,646 INFO L225 Difference]: With dead ends: 5351 [2024-11-06 19:48:09,647 INFO L226 Difference]: Without dead ends: 3480 [2024-11-06 19:48:09,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:09,651 INFO L432 NwaCegarLoop]: 926 mSDtfsCounter, 884 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2338 mSolverCounterSat, 878 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 884 SdHoareTripleChecker+Valid, 1079 SdHoareTripleChecker+Invalid, 3216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 878 IncrementalHoareTripleChecker+Valid, 2338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:09,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [884 Valid, 1079 Invalid, 3216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [878 Valid, 2338 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-06 19:48:09,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3480 states. [2024-11-06 19:48:09,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3480 to 3479. [2024-11-06 19:48:09,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3479 states, 3478 states have (on average 1.518688901667625) internal successors, (5282), 3478 states have internal predecessors, (5282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:09,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3479 states to 3479 states and 5282 transitions. [2024-11-06 19:48:09,730 INFO L78 Accepts]: Start accepts. Automaton has 3479 states and 5282 transitions. Word has length 97 [2024-11-06 19:48:09,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:09,731 INFO L471 AbstractCegarLoop]: Abstraction has 3479 states and 5282 transitions. [2024-11-06 19:48:09,731 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.333333333333336) internal successors, (97), 2 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:09,731 INFO L276 IsEmpty]: Start isEmpty. Operand 3479 states and 5282 transitions. [2024-11-06 19:48:09,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-06 19:48:09,737 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:09,737 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:48:09,738 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:48:09,738 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:09,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:09,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1724311179, now seen corresponding path program 1 times [2024-11-06 19:48:09,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:09,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [754415013] [2024-11-06 19:48:09,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:09,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:09,941 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:48:09,942 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:09,942 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [754415013] [2024-11-06 19:48:09,942 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [754415013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:09,942 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:48:09,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:48:09,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093041114] [2024-11-06 19:48:09,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:09,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:48:09,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:09,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:48:09,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:09,944 INFO L87 Difference]: Start difference. First operand 3479 states and 5282 transitions. Second operand has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:12,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:12,899 INFO L93 Difference]: Finished difference Result 10142 states and 15438 transitions. [2024-11-06 19:48:12,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:48:12,899 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 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 99 [2024-11-06 19:48:12,900 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:12,923 INFO L225 Difference]: With dead ends: 10142 [2024-11-06 19:48:12,923 INFO L226 Difference]: Without dead ends: 6665 [2024-11-06 19:48:12,929 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:12,930 INFO L432 NwaCegarLoop]: 744 mSDtfsCounter, 976 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2553 mSolverCounterSat, 772 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 976 SdHoareTripleChecker+Valid, 877 SdHoareTripleChecker+Invalid, 3325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 772 IncrementalHoareTripleChecker+Valid, 2553 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:12,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [976 Valid, 877 Invalid, 3325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [772 Valid, 2553 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-06 19:48:12,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6665 states. [2024-11-06 19:48:13,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6665 to 6657. [2024-11-06 19:48:13,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6657 states, 6656 states have (on average 1.3728966346153846) internal successors, (9138), 6656 states have internal predecessors, (9138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:13,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6657 states to 6657 states and 9138 transitions. [2024-11-06 19:48:13,046 INFO L78 Accepts]: Start accepts. Automaton has 6657 states and 9138 transitions. Word has length 99 [2024-11-06 19:48:13,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:13,046 INFO L471 AbstractCegarLoop]: Abstraction has 6657 states and 9138 transitions. [2024-11-06 19:48:13,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.0) internal successors, (99), 2 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:13,047 INFO L276 IsEmpty]: Start isEmpty. Operand 6657 states and 9138 transitions. [2024-11-06 19:48:13,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-06 19:48:13,048 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:13,048 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:48:13,048 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:48:13,048 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:13,049 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:13,049 INFO L85 PathProgramCache]: Analyzing trace with hash 40058662, now seen corresponding path program 1 times [2024-11-06 19:48:13,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:13,049 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1445163041] [2024-11-06 19:48:13,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:13,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:13,222 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:48:13,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:13,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1445163041] [2024-11-06 19:48:13,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1445163041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:13,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:48:13,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:48:13,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1060025988] [2024-11-06 19:48:13,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:13,224 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:48:13,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:13,224 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:48:13,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:13,225 INFO L87 Difference]: Start difference. First operand 6657 states and 9138 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:15,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:15,980 INFO L93 Difference]: Finished difference Result 19637 states and 26969 transitions. [2024-11-06 19:48:15,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:48:15,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 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 105 [2024-11-06 19:48:15,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:16,005 INFO L225 Difference]: With dead ends: 19637 [2024-11-06 19:48:16,005 INFO L226 Difference]: Without dead ends: 12982 [2024-11-06 19:48:16,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:16,018 INFO L432 NwaCegarLoop]: 1012 mSDtfsCounter, 792 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 2485 mSolverCounterSat, 792 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 792 SdHoareTripleChecker+Valid, 1162 SdHoareTripleChecker+Invalid, 3277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 792 IncrementalHoareTripleChecker+Valid, 2485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:16,019 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [792 Valid, 1162 Invalid, 3277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [792 Valid, 2485 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-06 19:48:16,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12982 states. [2024-11-06 19:48:16,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12982 to 12964. [2024-11-06 19:48:16,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12964 states, 12963 states have (on average 1.2390650312427678) internal successors, (16062), 12963 states have internal predecessors, (16062), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:16,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12964 states to 12964 states and 16062 transitions. [2024-11-06 19:48:16,226 INFO L78 Accepts]: Start accepts. Automaton has 12964 states and 16062 transitions. Word has length 105 [2024-11-06 19:48:16,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:16,226 INFO L471 AbstractCegarLoop]: Abstraction has 12964 states and 16062 transitions. [2024-11-06 19:48:16,226 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:16,227 INFO L276 IsEmpty]: Start isEmpty. Operand 12964 states and 16062 transitions. [2024-11-06 19:48:16,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-06 19:48:16,228 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:16,228 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:48:16,228 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:48:16,229 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:16,229 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:16,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1375773890, now seen corresponding path program 1 times [2024-11-06 19:48:16,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:16,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150516654] [2024-11-06 19:48:16,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:16,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:16,382 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:48:16,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:16,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150516654] [2024-11-06 19:48:16,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150516654] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:16,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:48:16,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:48:16,383 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608051111] [2024-11-06 19:48:16,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:16,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:48:16,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:16,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:48:16,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:16,384 INFO L87 Difference]: Start difference. First operand 12964 states and 16062 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:19,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:19,504 INFO L93 Difference]: Finished difference Result 32235 states and 40792 transitions. [2024-11-06 19:48:19,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:48:19,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 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 121 [2024-11-06 19:48:19,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:19,537 INFO L225 Difference]: With dead ends: 32235 [2024-11-06 19:48:19,538 INFO L226 Difference]: Without dead ends: 19273 [2024-11-06 19:48:19,548 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:19,549 INFO L432 NwaCegarLoop]: 1590 mSDtfsCounter, 965 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 2555 mSolverCounterSat, 812 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 965 SdHoareTripleChecker+Valid, 1688 SdHoareTripleChecker+Invalid, 3367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 812 IncrementalHoareTripleChecker+Valid, 2555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:19,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [965 Valid, 1688 Invalid, 3367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [812 Valid, 2555 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-06 19:48:19,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19273 states. [2024-11-06 19:48:19,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19273 to 19263. [2024-11-06 19:48:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19263 states, 19262 states have (on average 1.2407849652164884) internal successors, (23900), 19262 states have internal predecessors, (23900), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:19,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19263 states to 19263 states and 23900 transitions. [2024-11-06 19:48:19,794 INFO L78 Accepts]: Start accepts. Automaton has 19263 states and 23900 transitions. Word has length 121 [2024-11-06 19:48:19,795 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:19,795 INFO L471 AbstractCegarLoop]: Abstraction has 19263 states and 23900 transitions. [2024-11-06 19:48:19,796 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:19,797 INFO L276 IsEmpty]: Start isEmpty. Operand 19263 states and 23900 transitions. [2024-11-06 19:48:19,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-11-06 19:48:19,798 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:19,798 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:48:19,798 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:48:19,798 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:19,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:19,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1196887405, now seen corresponding path program 1 times [2024-11-06 19:48:19,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:19,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508533929] [2024-11-06 19:48:19,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:19,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:19,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:19,942 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:48:19,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:19,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508533929] [2024-11-06 19:48:19,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508533929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:19,943 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:48:19,943 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:48:19,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580691803] [2024-11-06 19:48:19,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:19,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:48:19,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:19,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:48:19,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:19,945 INFO L87 Difference]: Start difference. First operand 19263 states and 23900 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:22,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:22,422 INFO L93 Difference]: Finished difference Result 38542 states and 47831 transitions. [2024-11-06 19:48:22,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:48:22,422 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 128 [2024-11-06 19:48:22,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:22,453 INFO L225 Difference]: With dead ends: 38542 [2024-11-06 19:48:22,454 INFO L226 Difference]: Without dead ends: 19281 [2024-11-06 19:48:22,472 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:22,473 INFO L432 NwaCegarLoop]: 1306 mSDtfsCounter, 1092 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 2468 mSolverCounterSat, 616 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1092 SdHoareTripleChecker+Valid, 1359 SdHoareTripleChecker+Invalid, 3084 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 616 IncrementalHoareTripleChecker+Valid, 2468 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:22,474 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1092 Valid, 1359 Invalid, 3084 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [616 Valid, 2468 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-06 19:48:22,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19281 states. [2024-11-06 19:48:22,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19281 to 19263. [2024-11-06 19:48:22,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19263 states, 19262 states have (on average 1.225262174229052) internal successors, (23601), 19262 states have internal predecessors, (23601), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:22,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19263 states to 19263 states and 23601 transitions. [2024-11-06 19:48:22,759 INFO L78 Accepts]: Start accepts. Automaton has 19263 states and 23601 transitions. Word has length 128 [2024-11-06 19:48:22,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:22,760 INFO L471 AbstractCegarLoop]: Abstraction has 19263 states and 23601 transitions. [2024-11-06 19:48:22,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:22,760 INFO L276 IsEmpty]: Start isEmpty. Operand 19263 states and 23601 transitions. [2024-11-06 19:48:22,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-06 19:48:22,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:22,763 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:48:22,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:48:22,763 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:22,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:22,764 INFO L85 PathProgramCache]: Analyzing trace with hash 401334377, now seen corresponding path program 1 times [2024-11-06 19:48:22,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:22,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1915400258] [2024-11-06 19:48:22,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:22,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:23,141 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 110 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-06 19:48:23,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:23,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1915400258] [2024-11-06 19:48:23,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1915400258] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:23,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:48:23,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:48:23,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738824155] [2024-11-06 19:48:23,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:23,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:48:23,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:23,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:48:23,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:23,144 INFO L87 Difference]: Start difference. First operand 19263 states and 23601 transitions. Second operand has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 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 19:48:25,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:25,670 INFO L93 Difference]: Finished difference Result 39311 states and 48002 transitions. [2024-11-06 19:48:25,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:48:25,670 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 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 203 [2024-11-06 19:48:25,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:25,695 INFO L225 Difference]: With dead ends: 39311 [2024-11-06 19:48:25,695 INFO L226 Difference]: Without dead ends: 20050 [2024-11-06 19:48:25,714 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:25,715 INFO L432 NwaCegarLoop]: 1077 mSDtfsCounter, 700 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 2514 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 700 SdHoareTripleChecker+Valid, 1206 SdHoareTripleChecker+Invalid, 2523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:25,715 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [700 Valid, 1206 Invalid, 2523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2514 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 19:48:25,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20050 states. [2024-11-06 19:48:26,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20050 to 20050. [2024-11-06 19:48:26,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20050 states, 20049 states have (on average 1.2166691605566362) internal successors, (24393), 20049 states have internal predecessors, (24393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:26,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20050 states to 20050 states and 24393 transitions. [2024-11-06 19:48:26,061 INFO L78 Accepts]: Start accepts. Automaton has 20050 states and 24393 transitions. Word has length 203 [2024-11-06 19:48:26,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:26,061 INFO L471 AbstractCegarLoop]: Abstraction has 20050 states and 24393 transitions. [2024-11-06 19:48:26,061 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.0) internal successors, (174), 2 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 19:48:26,061 INFO L276 IsEmpty]: Start isEmpty. Operand 20050 states and 24393 transitions. [2024-11-06 19:48:26,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2024-11-06 19:48:26,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:26,065 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:48:26,065 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:48:26,065 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:26,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:26,066 INFO L85 PathProgramCache]: Analyzing trace with hash 199558270, now seen corresponding path program 1 times [2024-11-06 19:48:26,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:26,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066247751] [2024-11-06 19:48:26,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:26,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:26,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:26,284 INFO L134 CoverageAnalysis]: Checked inductivity of 140 backedges. 140 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:48:26,285 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:26,285 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066247751] [2024-11-06 19:48:26,286 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1066247751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:26,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:48:26,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:48:26,286 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575232697] [2024-11-06 19:48:26,286 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:26,286 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:48:26,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:26,287 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:48:26,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:26,287 INFO L87 Difference]: Start difference. First operand 20050 states and 24393 transitions. Second operand has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:29,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:29,213 INFO L93 Difference]: Finished difference Result 39321 states and 48009 transitions. [2024-11-06 19:48:29,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:48:29,214 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 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 210 [2024-11-06 19:48:29,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:29,233 INFO L225 Difference]: With dead ends: 39321 [2024-11-06 19:48:29,233 INFO L226 Difference]: Without dead ends: 20060 [2024-11-06 19:48:29,246 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:29,246 INFO L432 NwaCegarLoop]: 810 mSDtfsCounter, 887 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 764 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 887 SdHoareTripleChecker+Valid, 928 SdHoareTripleChecker+Invalid, 3145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 764 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:29,247 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [887 Valid, 928 Invalid, 3145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [764 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-06 19:48:29,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20060 states. [2024-11-06 19:48:29,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20060 to 20050. [2024-11-06 19:48:29,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20050 states, 20049 states have (on average 1.1535737443264003) internal successors, (23128), 20049 states have internal predecessors, (23128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:29,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20050 states to 20050 states and 23128 transitions. [2024-11-06 19:48:29,456 INFO L78 Accepts]: Start accepts. Automaton has 20050 states and 23128 transitions. Word has length 210 [2024-11-06 19:48:29,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:29,456 INFO L471 AbstractCegarLoop]: Abstraction has 20050 states and 23128 transitions. [2024-11-06 19:48:29,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.0) internal successors, (210), 3 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:29,457 INFO L276 IsEmpty]: Start isEmpty. Operand 20050 states and 23128 transitions. [2024-11-06 19:48:29,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2024-11-06 19:48:29,461 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:29,461 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:48:29,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:48:29,462 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:29,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:29,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1013398472, now seen corresponding path program 1 times [2024-11-06 19:48:29,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:29,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727370557] [2024-11-06 19:48:29,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:29,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:29,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:29,653 INFO L134 CoverageAnalysis]: Checked inductivity of 340 backedges. 252 proven. 0 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2024-11-06 19:48:29,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:29,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727370557] [2024-11-06 19:48:29,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727370557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:29,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:48:29,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:48:29,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956012649] [2024-11-06 19:48:29,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:29,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:48:29,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:29,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:48:29,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:29,657 INFO L87 Difference]: Start difference. First operand 20050 states and 23128 transitions. Second operand has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:32,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:32,610 INFO L93 Difference]: Finished difference Result 45630 states and 53337 transitions. [2024-11-06 19:48:32,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:48:32,611 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 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 299 [2024-11-06 19:48:32,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:32,638 INFO L225 Difference]: With dead ends: 45630 [2024-11-06 19:48:32,638 INFO L226 Difference]: Without dead ends: 26369 [2024-11-06 19:48:32,651 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:32,652 INFO L432 NwaCegarLoop]: 698 mSDtfsCounter, 968 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 844 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 968 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 3227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 844 IncrementalHoareTripleChecker+Valid, 2383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:32,652 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [968 Valid, 786 Invalid, 3227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [844 Valid, 2383 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-06 19:48:32,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26369 states. [2024-11-06 19:48:32,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26369 to 26357. [2024-11-06 19:48:32,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26357 states, 26356 states have (on average 1.145204128092275) internal successors, (30183), 26356 states have internal predecessors, (30183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:32,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26357 states to 26357 states and 30183 transitions. [2024-11-06 19:48:32,916 INFO L78 Accepts]: Start accepts. Automaton has 26357 states and 30183 transitions. Word has length 299 [2024-11-06 19:48:32,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:32,916 INFO L471 AbstractCegarLoop]: Abstraction has 26357 states and 30183 transitions. [2024-11-06 19:48:32,917 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 70.66666666666667) internal successors, (212), 3 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:32,917 INFO L276 IsEmpty]: Start isEmpty. Operand 26357 states and 30183 transitions. [2024-11-06 19:48:32,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 352 [2024-11-06 19:48:32,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:32,924 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:48:32,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 19:48:32,924 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:32,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:32,925 INFO L85 PathProgramCache]: Analyzing trace with hash 466056108, now seen corresponding path program 1 times [2024-11-06 19:48:32,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:32,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34411529] [2024-11-06 19:48:32,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:32,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:33,299 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-11-06 19:48:33,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:33,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34411529] [2024-11-06 19:48:33,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34411529] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:33,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:48:33,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:48:33,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188630880] [2024-11-06 19:48:33,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:33,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:48:33,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:33,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:48:33,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:33,303 INFO L87 Difference]: Start difference. First operand 26357 states and 30183 transitions. Second operand has 3 states, 3 states have (on average 76.0) internal successors, (228), 2 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:36,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:36,208 INFO L93 Difference]: Finished difference Result 61387 states and 70044 transitions. [2024-11-06 19:48:36,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:48:36,208 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 2 states have internal predecessors, (228), 0 states have call successors, (0), 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 351 [2024-11-06 19:48:36,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:36,240 INFO L225 Difference]: With dead ends: 61387 [2024-11-06 19:48:36,240 INFO L226 Difference]: Without dead ends: 35819 [2024-11-06 19:48:36,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:36,260 INFO L432 NwaCegarLoop]: 1041 mSDtfsCounter, 726 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 2726 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 726 SdHoareTripleChecker+Valid, 1223 SdHoareTripleChecker+Invalid, 2907 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 2726 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:36,260 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [726 Valid, 1223 Invalid, 2907 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 2726 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-06 19:48:36,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35819 states. [2024-11-06 19:48:36,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35819 to 35811. [2024-11-06 19:48:36,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35811 states, 35810 states have (on average 1.1199385646467468) internal successors, (40105), 35810 states have internal predecessors, (40105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:36,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35811 states to 35811 states and 40105 transitions. [2024-11-06 19:48:36,553 INFO L78 Accepts]: Start accepts. Automaton has 35811 states and 40105 transitions. Word has length 351 [2024-11-06 19:48:36,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:36,553 INFO L471 AbstractCegarLoop]: Abstraction has 35811 states and 40105 transitions. [2024-11-06 19:48:36,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.0) internal successors, (228), 2 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:36,554 INFO L276 IsEmpty]: Start isEmpty. Operand 35811 states and 40105 transitions. [2024-11-06 19:48:36,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-11-06 19:48:36,558 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:36,558 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-06 19:48:36,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:48:36,558 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:36,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:36,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1671520665, now seen corresponding path program 1 times [2024-11-06 19:48:36,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:36,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592571678] [2024-11-06 19:48:36,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:36,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:36,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:37,221 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 119 proven. 75 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-11-06 19:48:37,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:37,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592571678] [2024-11-06 19:48:37,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592571678] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:48:37,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [960332772] [2024-11-06 19:48:37,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:37,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:48:37,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:48:37,226 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:48:37,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 19:48:37,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:37,410 INFO L255 TraceCheckSpWp]: Trace formula consists of 521 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:48:37,425 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:48:37,850 INFO L134 CoverageAnalysis]: Checked inductivity of 558 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 439 trivial. 0 not checked. [2024-11-06 19:48:37,851 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:48:37,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [960332772] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:37,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:48:37,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [3] total 4 [2024-11-06 19:48:37,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216871370] [2024-11-06 19:48:37,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:37,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:48:37,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:37,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:48:37,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:48:37,852 INFO L87 Difference]: Start difference. First operand 35811 states and 40105 transitions. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:40,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:40,834 INFO L93 Difference]: Finished difference Result 101690 states and 114343 transitions. [2024-11-06 19:48:40,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:48:40,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 359 [2024-11-06 19:48:40,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:40,906 INFO L225 Difference]: With dead ends: 101690 [2024-11-06 19:48:40,906 INFO L226 Difference]: Without dead ends: 66668 [2024-11-06 19:48:40,934 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:48:40,934 INFO L432 NwaCegarLoop]: 933 mSDtfsCounter, 1045 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 2717 mSolverCounterSat, 533 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1045 SdHoareTripleChecker+Valid, 1141 SdHoareTripleChecker+Invalid, 3250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 533 IncrementalHoareTripleChecker+Valid, 2717 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:40,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1045 Valid, 1141 Invalid, 3250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [533 Valid, 2717 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-06 19:48:40,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66668 states. [2024-11-06 19:48:41,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66668 to 66647. [2024-11-06 19:48:41,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66647 states, 66646 states have (on average 1.1020466344566815) internal successors, (73447), 66646 states have internal predecessors, (73447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:41,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66647 states to 66647 states and 73447 transitions. [2024-11-06 19:48:41,524 INFO L78 Accepts]: Start accepts. Automaton has 66647 states and 73447 transitions. Word has length 359 [2024-11-06 19:48:41,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:41,525 INFO L471 AbstractCegarLoop]: Abstraction has 66647 states and 73447 transitions. [2024-11-06 19:48:41,525 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 2 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:41,525 INFO L276 IsEmpty]: Start isEmpty. Operand 66647 states and 73447 transitions. [2024-11-06 19:48:41,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-11-06 19:48:41,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:41,530 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:48:41,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 19:48:41,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-06 19:48:41,731 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:41,731 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:41,731 INFO L85 PathProgramCache]: Analyzing trace with hash -223688760, now seen corresponding path program 1 times [2024-11-06 19:48:41,731 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:41,731 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467838671] [2024-11-06 19:48:41,731 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:41,732 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:41,891 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 89 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-06 19:48:41,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:41,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467838671] [2024-11-06 19:48:41,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467838671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:41,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:48:41,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:48:41,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793543856] [2024-11-06 19:48:41,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:41,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:48:41,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:41,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:48:41,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:41,895 INFO L87 Difference]: Start difference. First operand 66647 states and 73447 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:44,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:44,785 INFO L93 Difference]: Finished difference Result 128406 states and 141788 transitions. [2024-11-06 19:48:44,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:48:44,786 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 359 [2024-11-06 19:48:44,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:44,844 INFO L225 Difference]: With dead ends: 128406 [2024-11-06 19:48:44,844 INFO L226 Difference]: Without dead ends: 61761 [2024-11-06 19:48:44,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:44,869 INFO L432 NwaCegarLoop]: 1491 mSDtfsCounter, 1085 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 2344 mSolverCounterSat, 600 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1085 SdHoareTripleChecker+Valid, 1628 SdHoareTripleChecker+Invalid, 2944 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 600 IncrementalHoareTripleChecker+Valid, 2344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:44,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1085 Valid, 1628 Invalid, 2944 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [600 Valid, 2344 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 19:48:44,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61761 states. [2024-11-06 19:48:45,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61761 to 56242. [2024-11-06 19:48:45,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56242 states, 56241 states have (on average 1.0810618587862948) internal successors, (60800), 56241 states have internal predecessors, (60800), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:45,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56242 states to 56242 states and 60800 transitions. [2024-11-06 19:48:45,290 INFO L78 Accepts]: Start accepts. Automaton has 56242 states and 60800 transitions. Word has length 359 [2024-11-06 19:48:45,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:45,290 INFO L471 AbstractCegarLoop]: Abstraction has 56242 states and 60800 transitions. [2024-11-06 19:48:45,290 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:45,290 INFO L276 IsEmpty]: Start isEmpty. Operand 56242 states and 60800 transitions. [2024-11-06 19:48:45,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 381 [2024-11-06 19:48:45,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:45,295 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:48:45,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:48:45,295 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:45,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:45,295 INFO L85 PathProgramCache]: Analyzing trace with hash -122794750, now seen corresponding path program 1 times [2024-11-06 19:48:45,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:45,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583575139] [2024-11-06 19:48:45,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:45,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:45,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:46,788 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 272 proven. 113 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-06 19:48:46,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:46,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583575139] [2024-11-06 19:48:46,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [583575139] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:48:46,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1875316192] [2024-11-06 19:48:46,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:46,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:48:46,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:48:46,792 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:48:46,794 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-06 19:48:46,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:46,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:48:46,953 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:48:47,100 INFO L134 CoverageAnalysis]: Checked inductivity of 415 backedges. 302 proven. 0 refuted. 0 times theorem prover too weak. 113 trivial. 0 not checked. [2024-11-06 19:48:47,101 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:48:47,101 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1875316192] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:47,101 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:48:47,101 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-06 19:48:47,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544896762] [2024-11-06 19:48:47,101 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:47,102 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:48:47,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:47,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:48:47,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:48:47,103 INFO L87 Difference]: Start difference. First operand 56242 states and 60800 transitions. Second operand has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:49,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:49,884 INFO L93 Difference]: Finished difference Result 111676 states and 121615 transitions. [2024-11-06 19:48:49,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:48:49,884 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 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 380 [2024-11-06 19:48:49,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:49,949 INFO L225 Difference]: With dead ends: 111676 [2024-11-06 19:48:49,949 INFO L226 Difference]: Without dead ends: 66462 [2024-11-06 19:48:49,980 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 386 GetRequests, 379 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:48:49,980 INFO L432 NwaCegarLoop]: 387 mSDtfsCounter, 1217 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 2266 mSolverCounterSat, 971 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1217 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 3237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 971 IncrementalHoareTripleChecker+Valid, 2266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:49,980 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1217 Valid, 404 Invalid, 3237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [971 Valid, 2266 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 19:48:50,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66462 states. [2024-11-06 19:48:50,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66462 to 66462. [2024-11-06 19:48:50,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66462 states, 66461 states have (on average 1.0791892989873761) internal successors, (71724), 66461 states have internal predecessors, (71724), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:50,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66462 states to 66462 states and 71724 transitions. [2024-11-06 19:48:50,532 INFO L78 Accepts]: Start accepts. Automaton has 66462 states and 71724 transitions. Word has length 380 [2024-11-06 19:48:50,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:50,533 INFO L471 AbstractCegarLoop]: Abstraction has 66462 states and 71724 transitions. [2024-11-06 19:48:50,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.33333333333333) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:50,533 INFO L276 IsEmpty]: Start isEmpty. Operand 66462 states and 71724 transitions. [2024-11-06 19:48:50,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2024-11-06 19:48:50,538 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:50,538 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:48:50,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 19:48:50,739 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:48:50,739 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:50,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:50,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1998945486, now seen corresponding path program 1 times [2024-11-06 19:48:50,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:50,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127017687] [2024-11-06 19:48:50,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:50,740 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:51,028 INFO L134 CoverageAnalysis]: Checked inductivity of 597 backedges. 325 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-06 19:48:51,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:51,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127017687] [2024-11-06 19:48:51,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127017687] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:51,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:48:51,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:48:51,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853443443] [2024-11-06 19:48:51,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:51,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:48:51,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:51,030 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:48:51,030 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:51,030 INFO L87 Difference]: Start difference. First operand 66462 states and 71724 transitions. Second operand has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:53,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:53,873 INFO L93 Difference]: Finished difference Result 144731 states and 156792 transitions. [2024-11-06 19:48:53,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:48:53,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 389 [2024-11-06 19:48:53,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:53,951 INFO L225 Difference]: With dead ends: 144731 [2024-11-06 19:48:53,951 INFO L226 Difference]: Without dead ends: 79058 [2024-11-06 19:48:53,990 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:53,990 INFO L432 NwaCegarLoop]: 1750 mSDtfsCounter, 788 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 2485 mSolverCounterSat, 443 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 788 SdHoareTripleChecker+Valid, 1890 SdHoareTripleChecker+Invalid, 2928 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 443 IncrementalHoareTripleChecker+Valid, 2485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:53,991 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [788 Valid, 1890 Invalid, 2928 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [443 Valid, 2485 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 19:48:54,043 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79058 states. [2024-11-06 19:48:54,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79058 to 78265. [2024-11-06 19:48:54,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78265 states, 78264 states have (on average 1.0746959010528467) internal successors, (84110), 78264 states have internal predecessors, (84110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:54,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78265 states to 78265 states and 84110 transitions. [2024-11-06 19:48:54,869 INFO L78 Accepts]: Start accepts. Automaton has 78265 states and 84110 transitions. Word has length 389 [2024-11-06 19:48:54,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:54,870 INFO L471 AbstractCegarLoop]: Abstraction has 78265 states and 84110 transitions. [2024-11-06 19:48:54,870 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 69.0) internal successors, (207), 3 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:54,870 INFO L276 IsEmpty]: Start isEmpty. Operand 78265 states and 84110 transitions. [2024-11-06 19:48:54,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 395 [2024-11-06 19:48:54,875 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:54,876 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-06 19:48:54,876 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 19:48:54,876 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:54,877 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:54,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1737086632, now seen corresponding path program 1 times [2024-11-06 19:48:54,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:54,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759406329] [2024-11-06 19:48:54,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:54,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:54,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:55,266 INFO L134 CoverageAnalysis]: Checked inductivity of 617 backedges. 478 proven. 0 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-06 19:48:55,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:55,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759406329] [2024-11-06 19:48:55,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759406329] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:55,267 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:48:55,267 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:48:55,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79246663] [2024-11-06 19:48:55,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:55,268 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:48:55,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:55,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:48:55,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:48:55,269 INFO L87 Difference]: Start difference. First operand 78265 states and 84110 transitions. Second operand has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:49:00,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:49:00,992 INFO L93 Difference]: Finished difference Result 213352 states and 229648 transitions. [2024-11-06 19:49:00,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:49:00,992 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 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 394 [2024-11-06 19:49:00,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:49:01,288 INFO L225 Difference]: With dead ends: 213352 [2024-11-06 19:49:01,288 INFO L226 Difference]: Without dead ends: 135876 [2024-11-06 19:49:01,325 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:49:01,326 INFO L432 NwaCegarLoop]: 659 mSDtfsCounter, 1679 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 5866 mSolverCounterSat, 963 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1679 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 6829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 963 IncrementalHoareTripleChecker+Valid, 5866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:49:01,326 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1679 Valid, 838 Invalid, 6829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [963 Valid, 5866 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2024-11-06 19:49:01,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135876 states. [2024-11-06 19:49:02,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135876 to 132622. [2024-11-06 19:49:02,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132622 states, 132621 states have (on average 1.071723181095) internal successors, (142133), 132621 states have internal predecessors, (142133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:49:02,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132622 states to 132622 states and 142133 transitions. [2024-11-06 19:49:02,759 INFO L78 Accepts]: Start accepts. Automaton has 132622 states and 142133 transitions. Word has length 394 [2024-11-06 19:49:02,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:49:02,760 INFO L471 AbstractCegarLoop]: Abstraction has 132622 states and 142133 transitions. [2024-11-06 19:49:02,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 71.75) internal successors, (287), 3 states have internal predecessors, (287), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:49:02,760 INFO L276 IsEmpty]: Start isEmpty. Operand 132622 states and 142133 transitions. [2024-11-06 19:49:02,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 424 [2024-11-06 19:49:02,769 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:49:02,769 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:49:02,769 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 19:49:02,769 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:49:02,770 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:49:02,770 INFO L85 PathProgramCache]: Analyzing trace with hash -1578591018, now seen corresponding path program 1 times [2024-11-06 19:49:02,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:49:02,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [203257403] [2024-11-06 19:49:02,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:49:02,770 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:49:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:49:03,282 INFO L134 CoverageAnalysis]: Checked inductivity of 615 backedges. 343 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-06 19:49:03,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:49:03,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [203257403] [2024-11-06 19:49:03,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [203257403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:49:03,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:49:03,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:49:03,283 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595841087] [2024-11-06 19:49:03,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:49:03,283 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:49:03,283 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:49:03,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:49:03,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:49:03,285 INFO L87 Difference]: Start difference. First operand 132622 states and 142133 transitions. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:49:06,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:49:06,291 INFO L93 Difference]: Finished difference Result 265235 states and 284216 transitions. [2024-11-06 19:49:06,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:49:06,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 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 423 [2024-11-06 19:49:06,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:49:06,453 INFO L225 Difference]: With dead ends: 265235 [2024-11-06 19:49:06,453 INFO L226 Difference]: Without dead ends: 131828 [2024-11-06 19:49:06,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:49:06,535 INFO L432 NwaCegarLoop]: 1665 mSDtfsCounter, 785 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 2466 mSolverCounterSat, 413 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 785 SdHoareTripleChecker+Valid, 1796 SdHoareTripleChecker+Invalid, 2879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 413 IncrementalHoareTripleChecker+Valid, 2466 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:49:06,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [785 Valid, 1796 Invalid, 2879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [413 Valid, 2466 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-06 19:49:06,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131828 states. [2024-11-06 19:49:07,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131828 to 131814. [2024-11-06 19:49:08,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131814 states, 131813 states have (on average 1.0560794458816658) internal successors, (139205), 131813 states have internal predecessors, (139205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:49:08,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131814 states to 131814 states and 139205 transitions. [2024-11-06 19:49:08,163 INFO L78 Accepts]: Start accepts. Automaton has 131814 states and 139205 transitions. Word has length 423 [2024-11-06 19:49:08,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:49:08,163 INFO L471 AbstractCegarLoop]: Abstraction has 131814 states and 139205 transitions. [2024-11-06 19:49:08,163 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:49:08,163 INFO L276 IsEmpty]: Start isEmpty. Operand 131814 states and 139205 transitions. [2024-11-06 19:49:08,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 431 [2024-11-06 19:49:08,171 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:49:08,171 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:49:08,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-06 19:49:08,171 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:49:08,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:49:08,172 INFO L85 PathProgramCache]: Analyzing trace with hash -835118328, now seen corresponding path program 1 times [2024-11-06 19:49:08,172 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:49:08,172 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644647822] [2024-11-06 19:49:08,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:49:08,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:49:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:49:08,679 INFO L134 CoverageAnalysis]: Checked inductivity of 636 backedges. 364 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-06 19:49:08,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:49:08,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644647822] [2024-11-06 19:49:08,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644647822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:49:08,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:49:08,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:49:08,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781078544] [2024-11-06 19:49:08,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:49:08,680 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:49:08,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:49:08,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:49:08,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:49:08,681 INFO L87 Difference]: Start difference. First operand 131814 states and 139205 transitions. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)