./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem11_label07.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/Problem11_label07.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', 'd275ae72fa22fefb6f99ff85ffd06b7323c3e625d2728e4b56df52786497f790'] 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/Problem11_label07.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 d275ae72fa22fefb6f99ff85ffd06b7323c3e625d2728e4b56df52786497f790 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:37:24,445 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:37:24,524 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:37:24,529 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:37:24,529 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:37:24,563 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:37:24,564 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:37:24,564 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:37:24,565 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:37:24,565 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:37:24,565 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:37:24,565 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:37:24,566 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:37:24,566 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:37:24,566 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:37:24,567 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:37:24,568 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:37:24,568 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:37:24,568 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:37:24,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:37:24,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:37:24,568 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:37:24,568 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:37:24,568 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:37:24,568 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:37:24,568 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:37:24,568 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:37:24,569 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:37:24,569 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:37:24,569 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:37:24,569 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:37:24,569 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:37:24,569 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:37:24,569 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:37:24,570 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:37:24,570 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:37:24,570 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:37:24,570 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:37:24,570 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:37:24,570 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:37:24,570 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:37:24,570 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:37:24,570 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 -> d275ae72fa22fefb6f99ff85ffd06b7323c3e625d2728e4b56df52786497f790 [2024-11-06 19:37:24,864 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:37:24,875 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:37:24,877 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:37:24,879 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:37:24,879 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:37:24,880 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem11_label07.c [2024-11-06 19:37:26,260 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:37:26,666 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:37:26,666 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem11_label07.c [2024-11-06 19:37:26,688 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ddcf093e/50c491f85fed4152a3142fbc1f0a240d/FLAG11a7b7d38 [2024-11-06 19:37:26,838 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5ddcf093e/50c491f85fed4152a3142fbc1f0a240d [2024-11-06 19:37:26,841 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:37:26,843 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:37:26,845 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:37:26,845 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:37:26,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:37:26,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:37:26" (1/1) ... [2024-11-06 19:37:26,851 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e374ac7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:26, skipping insertion in model container [2024-11-06 19:37:26,851 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:37:26" (1/1) ... [2024-11-06 19:37:26,904 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:37:27,092 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/Problem11_label07.c[3406,3419] [2024-11-06 19:37:27,328 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:37:27,337 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:37:27,354 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/Problem11_label07.c[3406,3419] [2024-11-06 19:37:27,479 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:37:27,497 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:37:27,498 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:27 WrapperNode [2024-11-06 19:37:27,499 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:37:27,500 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:37:27,501 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:37:27,501 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:37:27,506 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:37:27" (1/1) ... [2024-11-06 19:37:27,544 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:37:27" (1/1) ... [2024-11-06 19:37:27,645 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 1000 [2024-11-06 19:37:27,645 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:37:27,646 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:37:27,646 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:37:27,646 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:37:27,654 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:27" (1/1) ... [2024-11-06 19:37:27,654 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:27" (1/1) ... [2024-11-06 19:37:27,672 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:27" (1/1) ... [2024-11-06 19:37:27,714 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:37:27,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:27" (1/1) ... [2024-11-06 19:37:27,714 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:27" (1/1) ... [2024-11-06 19:37:27,751 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:27" (1/1) ... [2024-11-06 19:37:27,759 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:27" (1/1) ... [2024-11-06 19:37:27,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:27" (1/1) ... [2024-11-06 19:37:27,780 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:27" (1/1) ... [2024-11-06 19:37:27,808 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:37:27,810 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:37:27,811 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:37:27,811 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:37:27,812 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:27" (1/1) ... [2024-11-06 19:37:27,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:37:27,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:37:27,849 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:37:27,853 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:37:27,882 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:37:27,883 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:37:27,884 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:37:27,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:37:27,954 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:37:27,956 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:37:29,733 INFO L? ?]: Removed 129 outVars from TransFormulas that were not future-live. [2024-11-06 19:37:29,734 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:37:29,760 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:37:29,760 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:37:29,760 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:37:29 BoogieIcfgContainer [2024-11-06 19:37:29,760 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:37:29,763 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:37:29,763 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:37:29,768 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:37:29,768 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:37:26" (1/3) ... [2024-11-06 19:37:29,768 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6749f2d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:37:29, skipping insertion in model container [2024-11-06 19:37:29,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:37:27" (2/3) ... [2024-11-06 19:37:29,769 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6749f2d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:37:29, skipping insertion in model container [2024-11-06 19:37:29,769 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:37:29" (3/3) ... [2024-11-06 19:37:29,771 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem11_label07.c [2024-11-06 19:37:29,786 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:37:29,786 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:37:29,856 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:37:29,869 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;@21230e06, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:37:29,869 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:37:29,875 INFO L276 IsEmpty]: Start isEmpty. Operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 0 states have 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:37:29,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-06 19:37:29,880 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:29,881 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] [2024-11-06 19:37:29,881 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:29,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:29,886 INFO L85 PathProgramCache]: Analyzing trace with hash -573341295, now seen corresponding path program 1 times [2024-11-06 19:37:29,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:29,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1515634524] [2024-11-06 19:37:29,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:29,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:30,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:30,231 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:37:30,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:30,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1515634524] [2024-11-06 19:37:30,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1515634524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:30,234 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:37:30,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:37:30,236 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755773800] [2024-11-06 19:37:30,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:30,241 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:37:30,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:30,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:37:30,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:30,265 INFO L87 Difference]: Start difference. First operand has 283 states, 281 states have (on average 1.7153024911032029) internal successors, (482), 282 states have internal predecessors, (482), 0 states have call successors, (0), 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 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have 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:37:31,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:31,579 INFO L93 Difference]: Finished difference Result 761 states and 1345 transitions. [2024-11-06 19:37:31,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:37:31,582 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2024-11-06 19:37:31,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:31,592 INFO L225 Difference]: With dead ends: 761 [2024-11-06 19:37:31,595 INFO L226 Difference]: Without dead ends: 413 [2024-11-06 19:37:31,599 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:37:31,601 INFO L432 NwaCegarLoop]: 190 mSDtfsCounter, 205 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 753 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:31,602 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 222 Invalid, 753 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 19:37:31,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2024-11-06 19:37:31,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 413. [2024-11-06 19:37:31,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 412 states have (on average 1.453883495145631) internal successors, (599), 412 states have internal predecessors, (599), 0 states have call successors, (0), 0 states have 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:37:31,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 599 transitions. [2024-11-06 19:37:31,672 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 599 transitions. Word has length 23 [2024-11-06 19:37:31,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:31,672 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 599 transitions. [2024-11-06 19:37:31,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 2 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have 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:37:31,673 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 599 transitions. [2024-11-06 19:37:31,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2024-11-06 19:37:31,675 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:31,675 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:37:31,675 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:37:31,675 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:31,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:31,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1631989384, now seen corresponding path program 1 times [2024-11-06 19:37:31,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:31,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918059392] [2024-11-06 19:37:31,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:31,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:31,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:31,961 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:37:31,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:31,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918059392] [2024-11-06 19:37:31,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [918059392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:31,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:37:31,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:37:31,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814706679] [2024-11-06 19:37:31,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:31,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:37:31,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:31,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:37:31,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:31,964 INFO L87 Difference]: Start difference. First operand 413 states and 599 transitions. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have 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:37:32,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:32,866 INFO L93 Difference]: Finished difference Result 1211 states and 1763 transitions. [2024-11-06 19:37:32,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:37:32,867 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 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 91 [2024-11-06 19:37:32,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:32,871 INFO L225 Difference]: With dead ends: 1211 [2024-11-06 19:37:32,871 INFO L226 Difference]: Without dead ends: 800 [2024-11-06 19:37:32,873 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:37:32,874 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 142 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:32,874 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 120 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:37:32,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-06 19:37:32,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 789. [2024-11-06 19:37:32,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 789 states, 788 states have (on average 1.3743654822335025) internal successors, (1083), 788 states have internal predecessors, (1083), 0 states have call successors, (0), 0 states have 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:37:32,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1083 transitions. [2024-11-06 19:37:32,906 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1083 transitions. Word has length 91 [2024-11-06 19:37:32,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:32,906 INFO L471 AbstractCegarLoop]: Abstraction has 789 states and 1083 transitions. [2024-11-06 19:37:32,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 2 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have 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:37:32,906 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1083 transitions. [2024-11-06 19:37:32,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2024-11-06 19:37:32,908 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:32,908 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:37:32,909 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:37:32,909 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:32,909 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:32,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1083200579, now seen corresponding path program 1 times [2024-11-06 19:37:32,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:32,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [951228602] [2024-11-06 19:37:32,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:32,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:32,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:33,343 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:37:33,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:33,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [951228602] [2024-11-06 19:37:33,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [951228602] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:33,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:37:33,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:37:33,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511024121] [2024-11-06 19:37:33,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:33,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:37:33,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:33,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:37:33,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:33,345 INFO L87 Difference]: Start difference. First operand 789 states and 1083 transitions. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:37:34,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:34,049 INFO L93 Difference]: Finished difference Result 1945 states and 2612 transitions. [2024-11-06 19:37:34,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:37:34,050 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 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 93 [2024-11-06 19:37:34,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:34,055 INFO L225 Difference]: With dead ends: 1945 [2024-11-06 19:37:34,055 INFO L226 Difference]: Without dead ends: 1158 [2024-11-06 19:37:34,056 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:37:34,057 INFO L432 NwaCegarLoop]: 168 mSDtfsCounter, 119 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 531 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 568 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 531 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:34,057 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 190 Invalid, 568 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 531 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:37:34,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2024-11-06 19:37:34,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1157. [2024-11-06 19:37:34,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.2707612456747406) internal successors, (1469), 1156 states have internal predecessors, (1469), 0 states have call successors, (0), 0 states have 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:37:34,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1469 transitions. [2024-11-06 19:37:34,085 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1469 transitions. Word has length 93 [2024-11-06 19:37:34,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:34,086 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1469 transitions. [2024-11-06 19:37:34,086 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 2 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have 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:37:34,086 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1469 transitions. [2024-11-06 19:37:34,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-06 19:37:34,090 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:34,090 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:37:34,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:37:34,090 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:34,091 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:34,091 INFO L85 PathProgramCache]: Analyzing trace with hash -1119260003, now seen corresponding path program 1 times [2024-11-06 19:37:34,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:34,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937551751] [2024-11-06 19:37:34,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:34,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:34,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:34,374 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:37:34,374 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:34,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937551751] [2024-11-06 19:37:34,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1937551751] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:34,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:37:34,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:37:34,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491138959] [2024-11-06 19:37:34,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:34,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:37:34,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:34,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:37:34,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:34,376 INFO L87 Difference]: Start difference. First operand 1157 states and 1469 transitions. Second operand has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have 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:37:35,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:35,194 INFO L93 Difference]: Finished difference Result 2519 states and 3349 transitions. [2024-11-06 19:37:35,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:37:35,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 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 150 [2024-11-06 19:37:35,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:35,201 INFO L225 Difference]: With dead ends: 2519 [2024-11-06 19:37:35,201 INFO L226 Difference]: Without dead ends: 1548 [2024-11-06 19:37:35,203 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:37:35,205 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 212 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 583 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 634 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 583 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:35,206 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 322 Invalid, 634 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 583 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:37:35,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1548 states. [2024-11-06 19:37:35,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1548 to 1545. [2024-11-06 19:37:35,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1545 states, 1544 states have (on average 1.2933937823834196) internal successors, (1997), 1544 states have internal predecessors, (1997), 0 states have call successors, (0), 0 states have 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:37:35,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1545 states to 1545 states and 1997 transitions. [2024-11-06 19:37:35,243 INFO L78 Accepts]: Start accepts. Automaton has 1545 states and 1997 transitions. Word has length 150 [2024-11-06 19:37:35,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:35,244 INFO L471 AbstractCegarLoop]: Abstraction has 1545 states and 1997 transitions. [2024-11-06 19:37:35,244 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have 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:37:35,245 INFO L276 IsEmpty]: Start isEmpty. Operand 1545 states and 1997 transitions. [2024-11-06 19:37:35,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-06 19:37:35,249 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:35,249 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:35,249 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:37:35,253 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:35,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:35,254 INFO L85 PathProgramCache]: Analyzing trace with hash -41328736, now seen corresponding path program 1 times [2024-11-06 19:37:35,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:35,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833937148] [2024-11-06 19:37:35,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:35,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:35,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:35,597 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2024-11-06 19:37:35,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:35,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833937148] [2024-11-06 19:37:35,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833937148] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:35,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:37:35,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:37:35,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634931258] [2024-11-06 19:37:35,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:35,598 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:37:35,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:35,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:37:35,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:35,599 INFO L87 Difference]: Start difference. First operand 1545 states and 1997 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:36,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:36,479 INFO L93 Difference]: Finished difference Result 3650 states and 4815 transitions. [2024-11-06 19:37:36,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:37:36,481 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2024-11-06 19:37:36,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:36,491 INFO L225 Difference]: With dead ends: 3650 [2024-11-06 19:37:36,492 INFO L226 Difference]: Without dead ends: 2291 [2024-11-06 19:37:36,494 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:36,497 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 174 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:36,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 392 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:37:36,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2291 states. [2024-11-06 19:37:36,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2291 to 2098. [2024-11-06 19:37:36,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2098 states, 2097 states have (on average 1.2675250357653791) internal successors, (2658), 2097 states have internal predecessors, (2658), 0 states have call successors, (0), 0 states have 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:37:36,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2098 states to 2098 states and 2658 transitions. [2024-11-06 19:37:36,543 INFO L78 Accepts]: Start accepts. Automaton has 2098 states and 2658 transitions. Word has length 205 [2024-11-06 19:37:36,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:36,544 INFO L471 AbstractCegarLoop]: Abstraction has 2098 states and 2658 transitions. [2024-11-06 19:37:36,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:36,544 INFO L276 IsEmpty]: Start isEmpty. Operand 2098 states and 2658 transitions. [2024-11-06 19:37:36,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2024-11-06 19:37:36,548 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:36,549 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:36,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:37:36,549 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:36,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:36,550 INFO L85 PathProgramCache]: Analyzing trace with hash 1687662639, now seen corresponding path program 1 times [2024-11-06 19:37:36,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:36,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536332202] [2024-11-06 19:37:36,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:36,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:36,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:37,018 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 25 proven. 16 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-06 19:37:37,018 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:37,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536332202] [2024-11-06 19:37:37,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536332202] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:37:37,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [615954509] [2024-11-06 19:37:37,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:37,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:37:37,019 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:37:37,023 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:37:37,048 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:37:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:37,161 INFO L255 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:37:37,168 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:37:37,252 INFO L134 CoverageAnalysis]: Checked inductivity of 116 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-06 19:37:37,252 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:37:37,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [615954509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:37,253 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:37:37,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-06 19:37:37,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606940381] [2024-11-06 19:37:37,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:37,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:37:37,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:37,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:37:37,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 19:37:37,255 INFO L87 Difference]: Start difference. First operand 2098 states and 2658 transitions. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:38,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:38,142 INFO L93 Difference]: Finished difference Result 4940 states and 6327 transitions. [2024-11-06 19:37:38,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:37:38,142 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 211 [2024-11-06 19:37:38,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:38,154 INFO L225 Difference]: With dead ends: 4940 [2024-11-06 19:37:38,154 INFO L226 Difference]: Without dead ends: 2844 [2024-11-06 19:37:38,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-06 19:37:38,158 INFO L432 NwaCegarLoop]: 369 mSDtfsCounter, 173 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 586 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 391 SdHoareTripleChecker+Invalid, 678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 586 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:38,158 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 391 Invalid, 678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 586 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:37:38,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2844 states. [2024-11-06 19:37:38,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2844 to 2835. [2024-11-06 19:37:38,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2835 states, 2834 states have (on average 1.2399435426958363) internal successors, (3514), 2834 states have internal predecessors, (3514), 0 states have call successors, (0), 0 states have 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:37:38,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2835 states to 2835 states and 3514 transitions. [2024-11-06 19:37:38,229 INFO L78 Accepts]: Start accepts. Automaton has 2835 states and 3514 transitions. Word has length 211 [2024-11-06 19:37:38,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:38,229 INFO L471 AbstractCegarLoop]: Abstraction has 2835 states and 3514 transitions. [2024-11-06 19:37:38,229 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:38,230 INFO L276 IsEmpty]: Start isEmpty. Operand 2835 states and 3514 transitions. [2024-11-06 19:37:38,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2024-11-06 19:37:38,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:38,234 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:38,253 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:37:38,438 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:37:38,439 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:38,439 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:38,439 INFO L85 PathProgramCache]: Analyzing trace with hash 152223707, now seen corresponding path program 1 times [2024-11-06 19:37:38,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:38,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132495668] [2024-11-06 19:37:38,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:38,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:38,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:38,767 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:37:38,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:38,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132495668] [2024-11-06 19:37:38,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132495668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:38,768 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:37:38,768 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:37:38,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1145735818] [2024-11-06 19:37:38,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:38,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:37:38,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:38,769 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:37:38,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:37:38,769 INFO L87 Difference]: Start difference. First operand 2835 states and 3514 transitions. Second operand has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have 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:37:40,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:40,111 INFO L93 Difference]: Finished difference Result 9389 states and 11845 transitions. [2024-11-06 19:37:40,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:37:40,112 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 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 250 [2024-11-06 19:37:40,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:40,136 INFO L225 Difference]: With dead ends: 9389 [2024-11-06 19:37:40,136 INFO L226 Difference]: Without dead ends: 6556 [2024-11-06 19:37:40,141 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:37:40,142 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 292 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1055 mSolverCounterSat, 173 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 1228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 173 IncrementalHoareTripleChecker+Valid, 1055 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:40,142 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [292 Valid, 90 Invalid, 1228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [173 Valid, 1055 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 19:37:40,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6556 states. [2024-11-06 19:37:40,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6556 to 6552. [2024-11-06 19:37:40,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6552 states, 6551 states have (on average 1.2399633643718517) internal successors, (8123), 6551 states have internal predecessors, (8123), 0 states have call successors, (0), 0 states have 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:37:40,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6552 states to 6552 states and 8123 transitions. [2024-11-06 19:37:40,271 INFO L78 Accepts]: Start accepts. Automaton has 6552 states and 8123 transitions. Word has length 250 [2024-11-06 19:37:40,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:40,271 INFO L471 AbstractCegarLoop]: Abstraction has 6552 states and 8123 transitions. [2024-11-06 19:37:40,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 62.5) internal successors, (250), 3 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have 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:37:40,272 INFO L276 IsEmpty]: Start isEmpty. Operand 6552 states and 8123 transitions. [2024-11-06 19:37:40,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2024-11-06 19:37:40,277 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:40,278 INFO L215 NwaCegarLoop]: trace histogram [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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:37:40,278 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:37:40,278 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:40,278 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:40,279 INFO L85 PathProgramCache]: Analyzing trace with hash 886593799, now seen corresponding path program 1 times [2024-11-06 19:37:40,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:40,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583698033] [2024-11-06 19:37:40,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:40,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:40,532 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 254 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-06 19:37:40,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:40,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583698033] [2024-11-06 19:37:40,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583698033] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:40,533 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:37:40,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:37:40,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [421467913] [2024-11-06 19:37:40,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:40,534 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:37:40,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:40,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:37:40,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:40,535 INFO L87 Difference]: Start difference. First operand 6552 states and 8123 transitions. Second operand has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have 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:37:41,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:41,386 INFO L93 Difference]: Finished difference Result 12754 states and 15902 transitions. [2024-11-06 19:37:41,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:37:41,387 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 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 282 [2024-11-06 19:37:41,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:41,410 INFO L225 Difference]: With dead ends: 12754 [2024-11-06 19:37:41,410 INFO L226 Difference]: Without dead ends: 6572 [2024-11-06 19:37:41,418 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:37:41,418 INFO L432 NwaCegarLoop]: 325 mSDtfsCounter, 137 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 555 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 649 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:41,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 345 Invalid, 649 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 555 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:37:41,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6572 states. [2024-11-06 19:37:41,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6572 to 6368. [2024-11-06 19:37:41,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6368 states, 6367 states have (on average 1.1941259619915188) internal successors, (7603), 6367 states have internal predecessors, (7603), 0 states have call successors, (0), 0 states have 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:37:41,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6368 states to 6368 states and 7603 transitions. [2024-11-06 19:37:41,540 INFO L78 Accepts]: Start accepts. Automaton has 6368 states and 7603 transitions. Word has length 282 [2024-11-06 19:37:41,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:41,541 INFO L471 AbstractCegarLoop]: Abstraction has 6368 states and 7603 transitions. [2024-11-06 19:37:41,541 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 87.33333333333333) internal successors, (262), 3 states have internal predecessors, (262), 0 states have call successors, (0), 0 states have 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:37:41,541 INFO L276 IsEmpty]: Start isEmpty. Operand 6368 states and 7603 transitions. [2024-11-06 19:37:41,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2024-11-06 19:37:41,546 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:41,547 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:41,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:37:41,547 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:41,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:41,547 INFO L85 PathProgramCache]: Analyzing trace with hash -1199418419, now seen corresponding path program 1 times [2024-11-06 19:37:41,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:41,547 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502419815] [2024-11-06 19:37:41,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:41,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:41,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:41,750 INFO L134 CoverageAnalysis]: Checked inductivity of 277 backedges. 209 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-06 19:37:41,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:41,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502419815] [2024-11-06 19:37:41,751 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502419815] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:41,751 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:37:41,751 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:37:41,752 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273603831] [2024-11-06 19:37:41,752 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:41,752 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:37:41,752 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:41,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:37:41,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:41,755 INFO L87 Difference]: Start difference. First operand 6368 states and 7603 transitions. Second operand has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have 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:37:42,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:42,557 INFO L93 Difference]: Finished difference Result 11961 states and 14349 transitions. [2024-11-06 19:37:42,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:37:42,557 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 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 283 [2024-11-06 19:37:42,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:42,582 INFO L225 Difference]: With dead ends: 11961 [2024-11-06 19:37:42,582 INFO L226 Difference]: Without dead ends: 5963 [2024-11-06 19:37:42,593 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:37:42,594 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 161 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 589 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:42,594 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 150 Invalid, 589 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:37:42,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5963 states. [2024-11-06 19:37:42,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5963 to 5777. [2024-11-06 19:37:42,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5777 states, 5776 states have (on average 1.143005540166205) internal successors, (6602), 5776 states have internal predecessors, (6602), 0 states have call successors, (0), 0 states have 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:37:42,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5777 states to 5777 states and 6602 transitions. [2024-11-06 19:37:42,713 INFO L78 Accepts]: Start accepts. Automaton has 5777 states and 6602 transitions. Word has length 283 [2024-11-06 19:37:42,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:42,714 INFO L471 AbstractCegarLoop]: Abstraction has 5777 states and 6602 transitions. [2024-11-06 19:37:42,718 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.0) internal successors, (216), 3 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have 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:37:42,718 INFO L276 IsEmpty]: Start isEmpty. Operand 5777 states and 6602 transitions. [2024-11-06 19:37:42,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2024-11-06 19:37:42,725 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:42,725 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-06 19:37:42,726 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 19:37:42,726 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:42,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:42,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1173523924, now seen corresponding path program 1 times [2024-11-06 19:37:42,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:42,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103475449] [2024-11-06 19:37:42,726 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:42,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:42,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:42,912 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 221 trivial. 0 not checked. [2024-11-06 19:37:42,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:42,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103475449] [2024-11-06 19:37:42,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103475449] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:42,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:37:42,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:37:42,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672179988] [2024-11-06 19:37:42,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:42,914 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:37:42,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:42,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:37:42,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:42,916 INFO L87 Difference]: Start difference. First operand 5777 states and 6602 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have 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:37:43,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:43,734 INFO L93 Difference]: Finished difference Result 15048 states and 17294 transitions. [2024-11-06 19:37:43,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:37:43,734 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 288 [2024-11-06 19:37:43,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:43,760 INFO L225 Difference]: With dead ends: 15048 [2024-11-06 19:37:43,760 INFO L226 Difference]: Without dead ends: 9641 [2024-11-06 19:37:43,768 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:37:43,771 INFO L432 NwaCegarLoop]: 323 mSDtfsCounter, 183 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 145 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 145 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:43,771 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 347 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [145 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:37:43,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9641 states. [2024-11-06 19:37:43,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9641 to 9641. [2024-11-06 19:37:43,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9641 states, 9640 states have (on average 1.1198132780082988) internal successors, (10795), 9640 states have internal predecessors, (10795), 0 states have call successors, (0), 0 states have 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:37:43,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9641 states to 9641 states and 10795 transitions. [2024-11-06 19:37:43,963 INFO L78 Accepts]: Start accepts. Automaton has 9641 states and 10795 transitions. Word has length 288 [2024-11-06 19:37:43,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:43,964 INFO L471 AbstractCegarLoop]: Abstraction has 9641 states and 10795 transitions. [2024-11-06 19:37:43,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have 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:37:43,964 INFO L276 IsEmpty]: Start isEmpty. Operand 9641 states and 10795 transitions. [2024-11-06 19:37:43,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 317 [2024-11-06 19:37:43,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:43,972 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2024-11-06 19:37:43,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:37:43,972 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:43,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:43,973 INFO L85 PathProgramCache]: Analyzing trace with hash -290095560, now seen corresponding path program 1 times [2024-11-06 19:37:43,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:43,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029389017] [2024-11-06 19:37:43,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:43,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:44,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:44,186 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-11-06 19:37:44,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:44,186 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029389017] [2024-11-06 19:37:44,187 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029389017] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:44,187 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:37:44,187 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:37:44,187 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1299669834] [2024-11-06 19:37:44,187 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:44,188 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:37:44,188 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:44,188 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:37:44,188 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:44,188 INFO L87 Difference]: Start difference. First operand 9641 states and 10795 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have 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:37:44,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:44,879 INFO L93 Difference]: Finished difference Result 19459 states and 21827 transitions. [2024-11-06 19:37:44,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:37:44,880 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 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 316 [2024-11-06 19:37:44,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:44,902 INFO L225 Difference]: With dead ends: 19459 [2024-11-06 19:37:44,902 INFO L226 Difference]: Without dead ends: 11296 [2024-11-06 19:37:44,910 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:37:44,911 INFO L432 NwaCegarLoop]: 127 mSDtfsCounter, 196 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:44,911 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [196 Valid, 151 Invalid, 560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 500 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 19:37:44,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11296 states. [2024-11-06 19:37:45,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11296 to 7424. [2024-11-06 19:37:45,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7424 states, 7423 states have (on average 1.1225919439579686) internal successors, (8333), 7423 states have internal predecessors, (8333), 0 states have call successors, (0), 0 states have 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:37:45,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7424 states to 7424 states and 8333 transitions. [2024-11-06 19:37:45,037 INFO L78 Accepts]: Start accepts. Automaton has 7424 states and 8333 transitions. Word has length 316 [2024-11-06 19:37:45,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:45,038 INFO L471 AbstractCegarLoop]: Abstraction has 7424 states and 8333 transitions. [2024-11-06 19:37:45,038 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have 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:37:45,038 INFO L276 IsEmpty]: Start isEmpty. Operand 7424 states and 8333 transitions. [2024-11-06 19:37:45,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2024-11-06 19:37:45,046 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:45,046 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:37:45,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 19:37:45,046 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:45,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:45,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1432121809, now seen corresponding path program 1 times [2024-11-06 19:37:45,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:45,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958235011] [2024-11-06 19:37:45,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:45,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:45,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:45,387 INFO L134 CoverageAnalysis]: Checked inductivity of 165 backedges. 165 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:37:45,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:45,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958235011] [2024-11-06 19:37:45,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958235011] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:45,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:37:45,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:37:45,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451689175] [2024-11-06 19:37:45,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:45,392 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:37:45,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:45,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:37:45,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:37:45,393 INFO L87 Difference]: Start difference. First operand 7424 states and 8333 transitions. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:46,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:46,169 INFO L93 Difference]: Finished difference Result 17607 states and 19807 transitions. [2024-11-06 19:37:46,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:37:46,170 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 325 [2024-11-06 19:37:46,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:46,192 INFO L225 Difference]: With dead ends: 17607 [2024-11-06 19:37:46,192 INFO L226 Difference]: Without dead ends: 10553 [2024-11-06 19:37:46,201 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:37:46,202 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 59 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 141 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 141 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:46,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 71 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [141 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 19:37:46,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10553 states. [2024-11-06 19:37:46,302 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10553 to 10548. [2024-11-06 19:37:46,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10548 states, 10547 states have (on average 1.1107423912012895) internal successors, (11715), 10547 states have internal predecessors, (11715), 0 states have call successors, (0), 0 states have 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:37:46,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10548 states to 10548 states and 11715 transitions. [2024-11-06 19:37:46,330 INFO L78 Accepts]: Start accepts. Automaton has 10548 states and 11715 transitions. Word has length 325 [2024-11-06 19:37:46,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:46,330 INFO L471 AbstractCegarLoop]: Abstraction has 10548 states and 11715 transitions. [2024-11-06 19:37:46,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:46,331 INFO L276 IsEmpty]: Start isEmpty. Operand 10548 states and 11715 transitions. [2024-11-06 19:37:46,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 329 [2024-11-06 19:37:46,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:46,339 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 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:37:46,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:37:46,339 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:46,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:46,339 INFO L85 PathProgramCache]: Analyzing trace with hash -625671799, now seen corresponding path program 1 times [2024-11-06 19:37:46,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:46,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440788030] [2024-11-06 19:37:46,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:46,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:46,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:46,664 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 183 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:37:46,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:46,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440788030] [2024-11-06 19:37:46,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [440788030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:46,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:37:46,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 19:37:46,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [575488907] [2024-11-06 19:37:46,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:46,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:37:46,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:46,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:37:46,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:37:46,666 INFO L87 Difference]: Start difference. First operand 10548 states and 11715 transitions. Second operand has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have 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:37:47,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:47,723 INFO L93 Difference]: Finished difference Result 23857 states and 26561 transitions. [2024-11-06 19:37:47,723 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:37:47,724 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 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 328 [2024-11-06 19:37:47,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:47,750 INFO L225 Difference]: With dead ends: 23857 [2024-11-06 19:37:47,750 INFO L226 Difference]: Without dead ends: 13679 [2024-11-06 19:37:47,760 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:37:47,760 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 279 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1017 mSolverCounterSat, 250 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 1267 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 250 IncrementalHoareTripleChecker+Valid, 1017 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:47,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 59 Invalid, 1267 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [250 Valid, 1017 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 19:37:47,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13679 states. [2024-11-06 19:37:47,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13679 to 12756. [2024-11-06 19:37:47,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12756 states, 12755 states have (on average 1.0953351626813015) internal successors, (13971), 12755 states have internal predecessors, (13971), 0 states have call successors, (0), 0 states have 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:37:47,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12756 states to 12756 states and 13971 transitions. [2024-11-06 19:37:47,924 INFO L78 Accepts]: Start accepts. Automaton has 12756 states and 13971 transitions. Word has length 328 [2024-11-06 19:37:47,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:47,925 INFO L471 AbstractCegarLoop]: Abstraction has 12756 states and 13971 transitions. [2024-11-06 19:37:47,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 82.0) internal successors, (328), 4 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have 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:37:47,925 INFO L276 IsEmpty]: Start isEmpty. Operand 12756 states and 13971 transitions. [2024-11-06 19:37:47,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 403 [2024-11-06 19:37:47,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:47,940 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 19:37:47,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 19:37:47,940 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:47,940 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:47,941 INFO L85 PathProgramCache]: Analyzing trace with hash 489054109, now seen corresponding path program 1 times [2024-11-06 19:37:47,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:47,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246286372] [2024-11-06 19:37:47,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:47,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:47,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:48,321 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 278 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-06 19:37:48,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:48,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246286372] [2024-11-06 19:37:48,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246286372] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:48,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:37:48,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 19:37:48,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772026433] [2024-11-06 19:37:48,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:48,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:37:48,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:48,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:37:48,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:37:48,323 INFO L87 Difference]: Start difference. First operand 12756 states and 13971 transitions. Second operand has 4 states, 4 states have (on average 74.75) internal successors, (299), 4 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have 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:37:49,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:49,407 INFO L93 Difference]: Finished difference Result 27169 states and 29817 transitions. [2024-11-06 19:37:49,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:37:49,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.75) internal successors, (299), 4 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 402 [2024-11-06 19:37:49,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:49,432 INFO L225 Difference]: With dead ends: 27169 [2024-11-06 19:37:49,432 INFO L226 Difference]: Without dead ends: 14783 [2024-11-06 19:37:49,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:37:49,444 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 262 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 189 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 1209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 189 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:49,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 59 Invalid, 1209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [189 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 19:37:49,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14783 states. [2024-11-06 19:37:49,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14783 to 12756. [2024-11-06 19:37:49,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12756 states, 12755 states have (on average 1.0953351626813015) internal successors, (13971), 12755 states have internal predecessors, (13971), 0 states have call successors, (0), 0 states have 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:37:49,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12756 states to 12756 states and 13971 transitions. [2024-11-06 19:37:49,630 INFO L78 Accepts]: Start accepts. Automaton has 12756 states and 13971 transitions. Word has length 402 [2024-11-06 19:37:49,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:49,630 INFO L471 AbstractCegarLoop]: Abstraction has 12756 states and 13971 transitions. [2024-11-06 19:37:49,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.75) internal successors, (299), 4 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have 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:37:49,631 INFO L276 IsEmpty]: Start isEmpty. Operand 12756 states and 13971 transitions. [2024-11-06 19:37:49,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 896 [2024-11-06 19:37:49,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:37:49,652 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:37:49,652 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 19:37:49,652 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:37:49,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:37:49,653 INFO L85 PathProgramCache]: Analyzing trace with hash -453324163, now seen corresponding path program 1 times [2024-11-06 19:37:49,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:37:49,653 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1942066466] [2024-11-06 19:37:49,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:49,653 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:37:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:50,843 INFO L134 CoverageAnalysis]: Checked inductivity of 2355 backedges. 1521 proven. 52 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2024-11-06 19:37:50,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:37:50,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1942066466] [2024-11-06 19:37:50,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1942066466] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:37:50,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1637221531] [2024-11-06 19:37:50,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:37:50,844 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:37:50,844 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:37:50,846 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:37:50,848 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:37:51,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:37:51,159 INFO L255 TraceCheckSpWp]: Trace formula consists of 1131 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:37:51,178 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:37:51,391 INFO L134 CoverageAnalysis]: Checked inductivity of 2355 backedges. 1573 proven. 0 refuted. 0 times theorem prover too weak. 782 trivial. 0 not checked. [2024-11-06 19:37:51,392 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:37:51,392 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1637221531] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:37:51,392 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:37:51,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-06 19:37:51,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502096832] [2024-11-06 19:37:51,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:37:51,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:37:51,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:37:51,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:37:51,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:37:51,396 INFO L87 Difference]: Start difference. First operand 12756 states and 13971 transitions. Second operand has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have 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:37:51,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:37:51,951 INFO L93 Difference]: Finished difference Result 24770 states and 27159 transitions. [2024-11-06 19:37:51,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:37:51,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 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 895 [2024-11-06 19:37:51,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:37:51,953 INFO L225 Difference]: With dead ends: 24770 [2024-11-06 19:37:51,953 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 19:37:51,962 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 899 GetRequests, 894 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:37:51,963 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 67 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 591 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:37:51,963 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 116 Invalid, 591 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 523 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 19:37:51,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 19:37:51,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 19:37:51,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:37:51,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 19:37:51,964 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 895 [2024-11-06 19:37:51,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:37:51,964 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 19:37:51,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 153.66666666666666) internal successors, (461), 3 states have internal predecessors, (461), 0 states have call successors, (0), 0 states have 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:37:51,964 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 19:37:51,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 19:37:51,967 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 19:37:51,985 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-06 19:37:52,171 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-06 19:37:52,174 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:37:52,176 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 19:37:53,595 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 19:37:53,620 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:37:53 BoogieIcfgContainer [2024-11-06 19:37:53,620 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 19:37:53,623 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 19:37:53,624 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 19:37:53,624 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 19:37:53,624 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:37:29" (3/4) ... [2024-11-06 19:37:53,626 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 19:37:53,652 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-06 19:37:53,653 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 19:37:53,655 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 19:37:53,656 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 19:37:53,812 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 19:37:53,812 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 19:37:53,812 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 19:37:53,813 INFO L158 Benchmark]: Toolchain (without parser) took 26970.21ms. Allocated memory was 117.4MB in the beginning and 696.3MB in the end (delta: 578.8MB). Free memory was 89.2MB in the beginning and 238.1MB in the end (delta: -149.0MB). Peak memory consumption was 431.6MB. Max. memory is 16.1GB. [2024-11-06 19:37:53,813 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 19:37:53,814 INFO L158 Benchmark]: CACSL2BoogieTranslator took 654.88ms. Allocated memory is still 117.4MB. Free memory was 89.0MB in the beginning and 45.9MB in the end (delta: 43.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-11-06 19:37:53,814 INFO L158 Benchmark]: Boogie Procedure Inliner took 145.26ms. Allocated memory is still 117.4MB. Free memory was 45.9MB in the beginning and 73.3MB in the end (delta: -27.4MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. [2024-11-06 19:37:53,814 INFO L158 Benchmark]: Boogie Preprocessor took 162.92ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 48.9MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-06 19:37:53,815 INFO L158 Benchmark]: RCFGBuilder took 1950.03ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 48.9MB in the beginning and 90.0MB in the end (delta: -41.1MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. [2024-11-06 19:37:53,815 INFO L158 Benchmark]: TraceAbstraction took 23857.49ms. Allocated memory was 167.8MB in the beginning and 696.3MB in the end (delta: 528.5MB). Free memory was 90.0MB in the beginning and 250.7MB in the end (delta: -160.8MB). Peak memory consumption was 453.0MB. Max. memory is 16.1GB. [2024-11-06 19:37:53,815 INFO L158 Benchmark]: Witness Printer took 188.95ms. Allocated memory is still 696.3MB. Free memory was 250.7MB in the beginning and 238.1MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-06 19:37:53,818 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 81.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 654.88ms. Allocated memory is still 117.4MB. Free memory was 89.0MB in the beginning and 45.9MB in the end (delta: 43.1MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 145.26ms. Allocated memory is still 117.4MB. Free memory was 45.9MB in the beginning and 73.3MB in the end (delta: -27.4MB). Peak memory consumption was 13.9MB. Max. memory is 16.1GB. * Boogie Preprocessor took 162.92ms. Allocated memory is still 117.4MB. Free memory was 73.3MB in the beginning and 48.9MB in the end (delta: 24.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1950.03ms. Allocated memory was 117.4MB in the beginning and 167.8MB in the end (delta: 50.3MB). Free memory was 48.9MB in the beginning and 90.0MB in the end (delta: -41.1MB). Peak memory consumption was 62.0MB. Max. memory is 16.1GB. * TraceAbstraction took 23857.49ms. Allocated memory was 167.8MB in the beginning and 696.3MB in the end (delta: 528.5MB). Free memory was 90.0MB in the beginning and 250.7MB in the end (delta: -160.8MB). Peak memory consumption was 453.0MB. Max. memory is 16.1GB. * Witness Printer took 188.95ms. Allocated memory is still 696.3MB. Free memory was 250.7MB in the beginning and 238.1MB in the end (delta: 12.6MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 85]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 283 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 22.3s, OverallIterations: 15, TraceHistogramMax: 8, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 13.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2661 SdHoareTripleChecker+Valid, 12.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2661 mSDsluCounter, 3025 SdHoareTripleChecker+Invalid, 10.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 366 mSDsCounter, 1832 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9582 IncrementalHoareTripleChecker+Invalid, 11414 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1832 mSolverCounterUnsat, 2659 mSDtfsCounter, 9582 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1151 GetRequests, 1126 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=12756occurred in iteration=13, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 7438 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 4.8s InterpolantComputationTime, 5248 NumberOfCodeBlocks, 5248 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 5231 ConstructedInterpolants, 0 QuantifiedInterpolants, 16336 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1451 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 17 InterpolantComputations, 15 PerfectInterpolantSequences, 7059/7127 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 1044]: Loop Invariant Derived loop invariant: ((((((((((((((((307 <= a23) && (a29 <= 599998)) && (a4 == 1)) || (((((a4 == 0) && (a25 == 11)) && (a29 <= 599998)) && (a23 <= 312)) && (246 <= a29))) || ((((a29 <= 140) && (a4 == 0)) && (a25 == 11)) && (a23 <= 312))) || (((a25 == 11) && (a29 <= 599999)) && (a4 == 1))) || (((((a4 == 0) && (a25 <= 10)) && (a29 <= 599998)) && (a23 <= 312)) && (246 <= a29))) || (((a4 == 0) && (((long long) a29 + 22) <= 0)) && (a25 <= 10))) || ((((long long) a29 + 21) <= 0) && (a4 == 1))) || (((a25 == 12) && (a4 == 0)) && (a29 <= 599998))) || (((a25 <= 10) && (a29 <= 599999)) && (a4 == 1))) || ((((a4 == 0) && (a29 <= 274)) && (a23 <= 312)) && (246 <= a29))) || ((((a29 <= 599999) && (((long long) a23 + 599772) <= 0)) && (a4 == 1)) && (13 <= a25))) || ((((a29 <= 140) && (a4 == 0)) && (a25 <= 10)) && (a23 <= 312))) || (((a29 <= 599998) && (a4 == 1)) && (13 <= a25))) || (((a4 == 0) && (((long long) a29 + 22) <= 0)) && (a23 <= 312))) RESULT: Ultimate proved your program to be correct! [2024-11-06 19:37:53,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE