./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem15_label20.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/Problem15_label20.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', '536acb696ed94b995033527813aeda4f29ece00fad0635ae3527f772205996b1'] 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/Problem15_label20.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 536acb696ed94b995033527813aeda4f29ece00fad0635ae3527f772205996b1 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:56:26,375 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:56:26,479 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:56:26,485 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:56:26,485 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:56:26,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:56:26,507 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:56:26,507 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:56:26,508 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:56:26,508 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:56:26,508 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:56:26,508 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:56:26,508 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:56:26,508 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:56:26,509 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:56:26,509 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:56:26,509 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:56:26,509 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:56:26,510 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:56:26,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:56:26,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:56:26,511 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:56:26,511 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:56:26,511 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:56:26,511 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:56:26,511 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:56:26,511 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:56:26,511 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:56:26,511 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:56:26,511 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:56:26,511 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:56:26,511 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:56:26,511 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:56:26,511 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:56:26,512 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:56:26,512 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:56:26,512 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:56:26,512 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:56:26,512 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:56:26,512 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:56:26,512 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:56:26,512 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:56:26,512 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 -> 536acb696ed94b995033527813aeda4f29ece00fad0635ae3527f772205996b1 [2024-11-06 19:56:26,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:56:26,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:56:26,803 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:56:26,803 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:56:26,804 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:56:26,805 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem15_label20.c [2024-11-06 19:56:28,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:56:28,431 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:56:28,431 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem15_label20.c [2024-11-06 19:56:28,451 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcd115aa1/8418c8ac59384f0fa9cd9404dec800cb/FLAGa303e0f51 [2024-11-06 19:56:28,686 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/bcd115aa1/8418c8ac59384f0fa9cd9404dec800cb [2024-11-06 19:56:28,688 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:56:28,689 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:56:28,690 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:56:28,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:56:28,693 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:56:28,694 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:56:28" (1/1) ... [2024-11-06 19:56:28,694 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40adb635 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:28, skipping insertion in model container [2024-11-06 19:56:28,695 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:56:28" (1/1) ... [2024-11-06 19:56:28,737 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:56:28,910 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/Problem15_label20.c[5247,5260] [2024-11-06 19:56:29,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:56:29,248 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:56:29,265 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/Problem15_label20.c[5247,5260] [2024-11-06 19:56:29,424 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:56:29,441 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:56:29,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:29 WrapperNode [2024-11-06 19:56:29,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:56:29,444 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:56:29,444 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:56:29,445 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:56:29,450 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:56:29" (1/1) ... [2024-11-06 19:56:29,481 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:56:29" (1/1) ... [2024-11-06 19:56:29,674 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1760 [2024-11-06 19:56:29,675 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:56:29,676 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:56:29,676 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:56:29,677 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:56:29,684 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:29" (1/1) ... [2024-11-06 19:56:29,685 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:29" (1/1) ... [2024-11-06 19:56:29,712 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:29" (1/1) ... [2024-11-06 19:56:29,783 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:56:29,784 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:29" (1/1) ... [2024-11-06 19:56:29,784 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:29" (1/1) ... [2024-11-06 19:56:29,877 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:29" (1/1) ... [2024-11-06 19:56:29,898 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:29" (1/1) ... [2024-11-06 19:56:29,908 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:29" (1/1) ... [2024-11-06 19:56:29,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:29" (1/1) ... [2024-11-06 19:56:29,976 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:56:29,978 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:56:29,978 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:56:29,978 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:56:29,979 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:29" (1/1) ... [2024-11-06 19:56:29,983 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:56:29,995 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:56:30,008 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:56:30,012 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:56:30,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:56:30,033 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:56:30,033 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:56:30,033 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:56:30,098 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:56:30,100 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:56:32,510 INFO L? ?]: Removed 246 outVars from TransFormulas that were not future-live. [2024-11-06 19:56:32,511 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:56:32,536 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:56:32,536 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:56:32,536 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:56:32 BoogieIcfgContainer [2024-11-06 19:56:32,538 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:56:32,540 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:56:32,540 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:56:32,544 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:56:32,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:56:28" (1/3) ... [2024-11-06 19:56:32,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b856062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:56:32, skipping insertion in model container [2024-11-06 19:56:32,545 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:56:29" (2/3) ... [2024-11-06 19:56:32,545 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b856062 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:56:32, skipping insertion in model container [2024-11-06 19:56:32,546 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:56:32" (3/3) ... [2024-11-06 19:56:32,547 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem15_label20.c [2024-11-06 19:56:32,560 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:56:32,560 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:56:32,622 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:56:32,634 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;@45aeaa7e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:56:32,635 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:56:32,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have 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:56:32,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-06 19:56:32,652 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:32,653 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:56:32,653 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:32,657 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:32,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1824112922, now seen corresponding path program 1 times [2024-11-06 19:56:32,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:32,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917210108] [2024-11-06 19:56:32,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:32,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:32,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:32,995 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:56:32,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:56:32,996 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917210108] [2024-11-06 19:56:32,996 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917210108] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:56:32,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:56:32,997 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:56:32,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018312134] [2024-11-06 19:56:33,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:56:33,003 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:56:33,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:33,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:56:33,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:33,026 INFO L87 Difference]: Start difference. First operand has 424 states, 422 states have (on average 1.7772511848341233) internal successors, (750), 423 states have internal predecessors, (750), 0 states have call successors, (0), 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 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have 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:56:34,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:56:34,918 INFO L93 Difference]: Finished difference Result 1154 states and 2106 transitions. [2024-11-06 19:56:34,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:56:34,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2024-11-06 19:56:34,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:56:34,932 INFO L225 Difference]: With dead ends: 1154 [2024-11-06 19:56:34,932 INFO L226 Difference]: Without dead ends: 665 [2024-11-06 19:56:34,936 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:56:34,938 INFO L432 NwaCegarLoop]: 334 mSDtfsCounter, 279 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 976 mSolverCounterSat, 254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 1230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 254 IncrementalHoareTripleChecker+Valid, 976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:56:34,938 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 383 Invalid, 1230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [254 Valid, 976 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-06 19:56:34,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2024-11-06 19:56:34,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2024-11-06 19:56:34,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 662 states have (on average 1.4818731117824773) internal successors, (981), 662 states have internal predecessors, (981), 0 states have call successors, (0), 0 states have 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:56:34,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 981 transitions. [2024-11-06 19:56:34,993 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 981 transitions. Word has length 42 [2024-11-06 19:56:34,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:56:34,993 INFO L471 AbstractCegarLoop]: Abstraction has 663 states and 981 transitions. [2024-11-06 19:56:34,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have 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:56:34,994 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 981 transitions. [2024-11-06 19:56:34,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2024-11-06 19:56:34,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:34,997 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 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:56:34,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:56:34,997 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:34,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:34,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1233355541, now seen corresponding path program 1 times [2024-11-06 19:56:34,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:34,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992187712] [2024-11-06 19:56:34,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:34,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:35,506 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:56:35,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:56:35,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992187712] [2024-11-06 19:56:35,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992187712] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:56:35,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:56:35,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:56:35,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206529980] [2024-11-06 19:56:35,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:56:35,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:56:35,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:35,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:56:35,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:35,510 INFO L87 Difference]: Start difference. First operand 663 states and 981 transitions. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have 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:56:36,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:56:36,672 INFO L93 Difference]: Finished difference Result 1624 states and 2315 transitions. [2024-11-06 19:56:36,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:56:36,674 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 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 107 [2024-11-06 19:56:36,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:56:36,678 INFO L225 Difference]: With dead ends: 1624 [2024-11-06 19:56:36,678 INFO L226 Difference]: Without dead ends: 963 [2024-11-06 19:56:36,680 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:56:36,681 INFO L432 NwaCegarLoop]: 299 mSDtfsCounter, 237 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 910 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 910 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:56:36,681 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 337 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 910 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 19:56:36,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2024-11-06 19:56:36,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2024-11-06 19:56:36,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 962 states have (on average 1.362785862785863) internal successors, (1311), 962 states have internal predecessors, (1311), 0 states have call successors, (0), 0 states have 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:56:36,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1311 transitions. [2024-11-06 19:56:36,726 INFO L78 Accepts]: Start accepts. Automaton has 963 states and 1311 transitions. Word has length 107 [2024-11-06 19:56:36,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:56:36,727 INFO L471 AbstractCegarLoop]: Abstraction has 963 states and 1311 transitions. [2024-11-06 19:56:36,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 2 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have 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:56:36,730 INFO L276 IsEmpty]: Start isEmpty. Operand 963 states and 1311 transitions. [2024-11-06 19:56:36,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2024-11-06 19:56:36,734 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:36,735 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:36,735 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:56:36,735 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:36,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:36,738 INFO L85 PathProgramCache]: Analyzing trace with hash 443347812, now seen corresponding path program 1 times [2024-11-06 19:56:36,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:36,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890494053] [2024-11-06 19:56:36,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:36,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:36,976 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:56:36,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:56:36,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890494053] [2024-11-06 19:56:36,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890494053] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:56:36,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:56:36,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:56:36,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618276261] [2024-11-06 19:56:36,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:56:36,977 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:56:36,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:36,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:56:36,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:36,978 INFO L87 Difference]: Start difference. First operand 963 states and 1311 transitions. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have 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:56:38,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:56:38,349 INFO L93 Difference]: Finished difference Result 2229 states and 3186 transitions. [2024-11-06 19:56:38,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:56:38,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 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 112 [2024-11-06 19:56:38,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:56:38,356 INFO L225 Difference]: With dead ends: 2229 [2024-11-06 19:56:38,356 INFO L226 Difference]: Without dead ends: 1567 [2024-11-06 19:56:38,359 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:56:38,360 INFO L432 NwaCegarLoop]: 278 mSDtfsCounter, 258 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 839 mSolverCounterSat, 285 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 285 IncrementalHoareTripleChecker+Valid, 839 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:56:38,360 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 316 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [285 Valid, 839 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-06 19:56:38,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1567 states. [2024-11-06 19:56:38,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1567 to 1266. [2024-11-06 19:56:38,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1266 states, 1265 states have (on average 1.3051383399209486) internal successors, (1651), 1265 states have internal predecessors, (1651), 0 states have call successors, (0), 0 states have 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:56:38,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1266 states to 1266 states and 1651 transitions. [2024-11-06 19:56:38,390 INFO L78 Accepts]: Start accepts. Automaton has 1266 states and 1651 transitions. Word has length 112 [2024-11-06 19:56:38,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:56:38,391 INFO L471 AbstractCegarLoop]: Abstraction has 1266 states and 1651 transitions. [2024-11-06 19:56:38,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 2 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have 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:56:38,391 INFO L276 IsEmpty]: Start isEmpty. Operand 1266 states and 1651 transitions. [2024-11-06 19:56:38,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-06 19:56:38,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:38,393 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:38,393 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:56:38,393 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:38,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:38,393 INFO L85 PathProgramCache]: Analyzing trace with hash 112945190, now seen corresponding path program 1 times [2024-11-06 19:56:38,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:38,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034194750] [2024-11-06 19:56:38,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:38,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:38,646 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:56:38,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:56:38,647 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034194750] [2024-11-06 19:56:38,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034194750] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:56:38,647 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:56:38,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:56:38,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783606962] [2024-11-06 19:56:38,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:56:38,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:56:38,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:38,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:56:38,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:56:38,649 INFO L87 Difference]: Start difference. First operand 1266 states and 1651 transitions. Second operand has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have 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:56:41,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:56:41,427 INFO L93 Difference]: Finished difference Result 4670 states and 6174 transitions. [2024-11-06 19:56:41,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:56:41,428 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 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 133 [2024-11-06 19:56:41,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:56:41,440 INFO L225 Difference]: With dead ends: 4670 [2024-11-06 19:56:41,440 INFO L226 Difference]: Without dead ends: 3406 [2024-11-06 19:56:41,441 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:56:41,442 INFO L432 NwaCegarLoop]: 290 mSDtfsCounter, 521 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 2278 mSolverCounterSat, 269 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 521 SdHoareTripleChecker+Valid, 376 SdHoareTripleChecker+Invalid, 2547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 269 IncrementalHoareTripleChecker+Valid, 2278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:56:41,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [521 Valid, 376 Invalid, 2547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [269 Valid, 2278 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-06 19:56:41,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3406 states. [2024-11-06 19:56:41,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3406 to 3381. [2024-11-06 19:56:41,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3381 states, 3380 states have (on average 1.2372781065088758) internal successors, (4182), 3380 states have internal predecessors, (4182), 0 states have call successors, (0), 0 states have 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:56:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3381 states to 3381 states and 4182 transitions. [2024-11-06 19:56:41,497 INFO L78 Accepts]: Start accepts. Automaton has 3381 states and 4182 transitions. Word has length 133 [2024-11-06 19:56:41,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:56:41,497 INFO L471 AbstractCegarLoop]: Abstraction has 3381 states and 4182 transitions. [2024-11-06 19:56:41,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 33.25) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have 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:56:41,497 INFO L276 IsEmpty]: Start isEmpty. Operand 3381 states and 4182 transitions. [2024-11-06 19:56:41,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-06 19:56:41,500 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:41,500 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 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] [2024-11-06 19:56:41,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:56:41,500 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:41,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:41,501 INFO L85 PathProgramCache]: Analyzing trace with hash 649130362, now seen corresponding path program 1 times [2024-11-06 19:56:41,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:41,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78353540] [2024-11-06 19:56:41,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:41,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:41,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:41,701 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-06 19:56:41,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:56:41,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78353540] [2024-11-06 19:56:41,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78353540] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:56:41,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:56:41,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:56:41,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137244787] [2024-11-06 19:56:41,702 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:56:41,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:56:41,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:41,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:56:41,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:41,703 INFO L87 Difference]: Start difference. First operand 3381 states and 4182 transitions. Second operand has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have 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:56:42,944 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:56:42,944 INFO L93 Difference]: Finished difference Result 8563 states and 10760 transitions. [2024-11-06 19:56:42,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:56:42,945 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 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 199 [2024-11-06 19:56:42,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:56:42,961 INFO L225 Difference]: With dead ends: 8563 [2024-11-06 19:56:42,961 INFO L226 Difference]: Without dead ends: 5483 [2024-11-06 19:56:42,965 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:56:42,966 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 257 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 1089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 298 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:56:42,966 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 337 Invalid, 1089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [298 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 19:56:42,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5483 states. [2024-11-06 19:56:43,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5483 to 5478. [2024-11-06 19:56:43,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1694358225305825) internal successors, (6405), 5477 states have internal predecessors, (6405), 0 states have call successors, (0), 0 states have 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:56:43,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6405 transitions. [2024-11-06 19:56:43,059 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6405 transitions. Word has length 199 [2024-11-06 19:56:43,060 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:56:43,060 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6405 transitions. [2024-11-06 19:56:43,060 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.0) internal successors, (135), 2 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have 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:56:43,060 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6405 transitions. [2024-11-06 19:56:43,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-06 19:56:43,062 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:43,063 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:43,063 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:56:43,063 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:43,063 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:43,063 INFO L85 PathProgramCache]: Analyzing trace with hash -448210480, now seen corresponding path program 1 times [2024-11-06 19:56:43,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:43,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050765130] [2024-11-06 19:56:43,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:43,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:43,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:43,505 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:56:43,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:56:43,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050765130] [2024-11-06 19:56:43,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050765130] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:56:43,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:56:43,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:56:43,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867580190] [2024-11-06 19:56:43,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:56:43,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:56:43,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:43,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:56:43,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:43,508 INFO L87 Difference]: Start difference. First operand 5478 states and 6405 transitions. Second operand has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have 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:56:44,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:56:44,626 INFO L93 Difference]: Finished difference Result 10655 states and 12497 transitions. [2024-11-06 19:56:44,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:56:44,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 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 200 [2024-11-06 19:56:44,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:56:44,646 INFO L225 Difference]: With dead ends: 10655 [2024-11-06 19:56:44,646 INFO L226 Difference]: Without dead ends: 5478 [2024-11-06 19:56:44,653 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:56:44,654 INFO L432 NwaCegarLoop]: 324 mSDtfsCounter, 143 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 359 SdHoareTripleChecker+Invalid, 893 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:56:44,656 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 359 Invalid, 893 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 888 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 19:56:44,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5478 states. [2024-11-06 19:56:44,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5478 to 5478. [2024-11-06 19:56:44,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5478 states, 5477 states have (on average 1.1683403322987036) internal successors, (6399), 5477 states have internal predecessors, (6399), 0 states have call successors, (0), 0 states have 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:56:44,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5478 states to 5478 states and 6399 transitions. [2024-11-06 19:56:44,750 INFO L78 Accepts]: Start accepts. Automaton has 5478 states and 6399 transitions. Word has length 200 [2024-11-06 19:56:44,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:56:44,750 INFO L471 AbstractCegarLoop]: Abstraction has 5478 states and 6399 transitions. [2024-11-06 19:56:44,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.66666666666667) internal successors, (200), 2 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have 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:56:44,751 INFO L276 IsEmpty]: Start isEmpty. Operand 5478 states and 6399 transitions. [2024-11-06 19:56:44,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 219 [2024-11-06 19:56:44,753 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:44,753 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:44,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:56:44,753 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:44,754 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:44,754 INFO L85 PathProgramCache]: Analyzing trace with hash -883201789, now seen corresponding path program 1 times [2024-11-06 19:56:44,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:44,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [772746987] [2024-11-06 19:56:44,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:44,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:45,005 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:56:45,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:56:45,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [772746987] [2024-11-06 19:56:45,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [772746987] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:56:45,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:56:45,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:56:45,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082586004] [2024-11-06 19:56:45,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:56:45,007 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:56:45,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:45,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:56:45,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:56:45,008 INFO L87 Difference]: Start difference. First operand 5478 states and 6399 transitions. Second operand has 4 states, 4 states have (on average 54.5) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have 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:56:47,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:56:47,685 INFO L93 Difference]: Finished difference Result 12184 states and 14319 transitions. [2024-11-06 19:56:47,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:56:47,685 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 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 218 [2024-11-06 19:56:47,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:56:47,702 INFO L225 Difference]: With dead ends: 12184 [2024-11-06 19:56:47,702 INFO L226 Difference]: Without dead ends: 7007 [2024-11-06 19:56:47,708 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:56:47,709 INFO L432 NwaCegarLoop]: 301 mSDtfsCounter, 442 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 1965 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 2172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 1965 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:56:47,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [442 Valid, 355 Invalid, 2172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 1965 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 19:56:47,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7007 states. [2024-11-06 19:56:47,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7007 to 5786. [2024-11-06 19:56:47,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5786 states, 5785 states have (on average 1.1799481417458946) internal successors, (6826), 5785 states have internal predecessors, (6826), 0 states have call successors, (0), 0 states have 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:56:47,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5786 states to 5786 states and 6826 transitions. [2024-11-06 19:56:47,809 INFO L78 Accepts]: Start accepts. Automaton has 5786 states and 6826 transitions. Word has length 218 [2024-11-06 19:56:47,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:56:47,809 INFO L471 AbstractCegarLoop]: Abstraction has 5786 states and 6826 transitions. [2024-11-06 19:56:47,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.5) internal successors, (218), 3 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have 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:56:47,810 INFO L276 IsEmpty]: Start isEmpty. Operand 5786 states and 6826 transitions. [2024-11-06 19:56:47,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 276 [2024-11-06 19:56:47,813 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:47,813 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:47,813 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:56:47,813 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:47,814 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:47,814 INFO L85 PathProgramCache]: Analyzing trace with hash 1474607314, now seen corresponding path program 1 times [2024-11-06 19:56:47,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:47,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730823518] [2024-11-06 19:56:47,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:47,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:48,219 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:56:48,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:56:48,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730823518] [2024-11-06 19:56:48,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730823518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:56:48,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:56:48,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:56:48,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952128170] [2024-11-06 19:56:48,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:56:48,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:56:48,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:48,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:56:48,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:56:48,221 INFO L87 Difference]: Start difference. First operand 5786 states and 6826 transitions. Second operand has 4 states, 4 states have (on average 68.75) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have 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:56:50,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:56:50,213 INFO L93 Difference]: Finished difference Result 13094 states and 15499 transitions. [2024-11-06 19:56:50,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:56:50,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 68.75) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 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 275 [2024-11-06 19:56:50,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:56:50,234 INFO L225 Difference]: With dead ends: 13094 [2024-11-06 19:56:50,234 INFO L226 Difference]: Without dead ends: 7609 [2024-11-06 19:56:50,240 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:56:50,240 INFO L432 NwaCegarLoop]: 310 mSDtfsCounter, 391 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 1894 mSolverCounterSat, 235 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 391 SdHoareTripleChecker+Valid, 361 SdHoareTripleChecker+Invalid, 2129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 235 IncrementalHoareTripleChecker+Valid, 1894 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:56:50,240 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [391 Valid, 361 Invalid, 2129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [235 Valid, 1894 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2024-11-06 19:56:50,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7609 states. [2024-11-06 19:56:50,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7609 to 6086. [2024-11-06 19:56:50,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6086 states, 6085 states have (on average 1.1750205423171733) internal successors, (7150), 6085 states have internal predecessors, (7150), 0 states have call successors, (0), 0 states have 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:56:50,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6086 states to 6086 states and 7150 transitions. [2024-11-06 19:56:50,349 INFO L78 Accepts]: Start accepts. Automaton has 6086 states and 7150 transitions. Word has length 275 [2024-11-06 19:56:50,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:56:50,349 INFO L471 AbstractCegarLoop]: Abstraction has 6086 states and 7150 transitions. [2024-11-06 19:56:50,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.75) internal successors, (275), 3 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have 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:56:50,350 INFO L276 IsEmpty]: Start isEmpty. Operand 6086 states and 7150 transitions. [2024-11-06 19:56:50,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2024-11-06 19:56:50,354 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:50,354 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:56:50,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:56:50,354 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:50,355 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:50,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1319764906, now seen corresponding path program 1 times [2024-11-06 19:56:50,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:50,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712157046] [2024-11-06 19:56:50,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:50,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:50,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:50,614 INFO L134 CoverageAnalysis]: Checked inductivity of 169 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2024-11-06 19:56:50,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:56:50,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712157046] [2024-11-06 19:56:50,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712157046] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:56:50,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:56:50,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:56:50,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823935083] [2024-11-06 19:56:50,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:56:50,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:56:50,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:50,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:56:50,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:50,616 INFO L87 Difference]: Start difference. First operand 6086 states and 7150 transitions. Second operand has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have 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:56:52,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:56:52,257 INFO L93 Difference]: Finished difference Result 14273 states and 17120 transitions. [2024-11-06 19:56:52,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:56:52,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 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 329 [2024-11-06 19:56:52,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:56:52,273 INFO L225 Difference]: With dead ends: 14273 [2024-11-06 19:56:52,273 INFO L226 Difference]: Without dead ends: 8488 [2024-11-06 19:56:52,278 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:56:52,278 INFO L432 NwaCegarLoop]: 632 mSDtfsCounter, 274 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 671 SdHoareTripleChecker+Invalid, 1152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 237 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:56:52,278 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 671 Invalid, 1152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [237 Valid, 915 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-06 19:56:52,283 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8488 states. [2024-11-06 19:56:52,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8488 to 8484. [2024-11-06 19:56:52,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8484 states, 8483 states have (on average 1.1478250618884829) internal successors, (9737), 8483 states have internal predecessors, (9737), 0 states have call successors, (0), 0 states have 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:56:52,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8484 states to 8484 states and 9737 transitions. [2024-11-06 19:56:52,363 INFO L78 Accepts]: Start accepts. Automaton has 8484 states and 9737 transitions. Word has length 329 [2024-11-06 19:56:52,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:56:52,363 INFO L471 AbstractCegarLoop]: Abstraction has 8484 states and 9737 transitions. [2024-11-06 19:56:52,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.0) internal successors, (240), 3 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have 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:56:52,364 INFO L276 IsEmpty]: Start isEmpty. Operand 8484 states and 9737 transitions. [2024-11-06 19:56:52,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 389 [2024-11-06 19:56:52,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:52,369 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:56:52,370 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 19:56:52,370 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:52,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:52,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1620854953, now seen corresponding path program 1 times [2024-11-06 19:56:52,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:52,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1192909985] [2024-11-06 19:56:52,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:52,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:52,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:52,676 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2024-11-06 19:56:52,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:56:52,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1192909985] [2024-11-06 19:56:52,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1192909985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:56:52,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:56:52,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:56:52,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462150079] [2024-11-06 19:56:52,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:56:52,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:56:52,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:52,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:56:52,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:52,678 INFO L87 Difference]: Start difference. First operand 8484 states and 9737 transitions. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have 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:56:53,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:56:53,978 INFO L93 Difference]: Finished difference Result 19663 states and 22941 transitions. [2024-11-06 19:56:53,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:56:53,979 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 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 388 [2024-11-06 19:56:53,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:56:53,998 INFO L225 Difference]: With dead ends: 19663 [2024-11-06 19:56:53,999 INFO L226 Difference]: Without dead ends: 11480 [2024-11-06 19:56:54,007 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:56:54,008 INFO L432 NwaCegarLoop]: 598 mSDtfsCounter, 285 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 895 mSolverCounterSat, 226 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 635 SdHoareTripleChecker+Invalid, 1121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 226 IncrementalHoareTripleChecker+Valid, 895 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:56:54,009 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 635 Invalid, 1121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [226 Valid, 895 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 19:56:54,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11480 states. [2024-11-06 19:56:54,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11480 to 10583. [2024-11-06 19:56:54,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10583 states, 10582 states have (on average 1.1332451332451332) internal successors, (11992), 10582 states have internal predecessors, (11992), 0 states have call successors, (0), 0 states have 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:56:54,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10583 states to 10583 states and 11992 transitions. [2024-11-06 19:56:54,184 INFO L78 Accepts]: Start accepts. Automaton has 10583 states and 11992 transitions. Word has length 388 [2024-11-06 19:56:54,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:56:54,185 INFO L471 AbstractCegarLoop]: Abstraction has 10583 states and 11992 transitions. [2024-11-06 19:56:54,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have 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:56:54,186 INFO L276 IsEmpty]: Start isEmpty. Operand 10583 states and 11992 transitions. [2024-11-06 19:56:54,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2024-11-06 19:56:54,193 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:54,194 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:56:54,194 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:56:54,194 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:54,195 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:54,195 INFO L85 PathProgramCache]: Analyzing trace with hash -944442415, now seen corresponding path program 1 times [2024-11-06 19:56:54,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:54,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272462653] [2024-11-06 19:56:54,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:54,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:54,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:55,000 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 79 proven. 64 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:56:55,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:56:55,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272462653] [2024-11-06 19:56:55,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272462653] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:56:55,001 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199986162] [2024-11-06 19:56:55,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:55,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:56:55,002 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:56:55,004 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:56:55,006 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:56:55,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:55,166 INFO L255 TraceCheckSpWp]: Trace formula consists of 481 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-06 19:56:55,180 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:56:55,916 INFO L134 CoverageAnalysis]: Checked inductivity of 143 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2024-11-06 19:56:55,916 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:56:55,916 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199986162] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:56:55,916 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:56:55,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 6 [2024-11-06 19:56:55,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1469957851] [2024-11-06 19:56:55,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:56:55,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:56:55,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:55,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:56:55,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:56:55,918 INFO L87 Difference]: Start difference. First operand 10583 states and 11992 transitions. Second operand has 4 states, 4 states have (on average 81.5) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have 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:56:58,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:56:58,100 INFO L93 Difference]: Finished difference Result 32858 states and 37474 transitions. [2024-11-06 19:56:58,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:56:58,101 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 389 [2024-11-06 19:56:58,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:56:58,143 INFO L225 Difference]: With dead ends: 32858 [2024-11-06 19:56:58,143 INFO L226 Difference]: Without dead ends: 19586 [2024-11-06 19:56:58,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 392 GetRequests, 387 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-06 19:56:58,160 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 473 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 1768 mSolverCounterSat, 658 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 473 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 2426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 658 IncrementalHoareTripleChecker+Valid, 1768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:56:58,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [473 Valid, 121 Invalid, 2426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [658 Valid, 1768 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-11-06 19:56:58,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19586 states. [2024-11-06 19:56:58,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19586 to 18984. [2024-11-06 19:56:58,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18984 states, 18983 states have (on average 1.1150503081704684) internal successors, (21167), 18983 states have internal predecessors, (21167), 0 states have call successors, (0), 0 states have 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:56:58,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18984 states to 18984 states and 21167 transitions. [2024-11-06 19:56:58,395 INFO L78 Accepts]: Start accepts. Automaton has 18984 states and 21167 transitions. Word has length 389 [2024-11-06 19:56:58,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:56:58,396 INFO L471 AbstractCegarLoop]: Abstraction has 18984 states and 21167 transitions. [2024-11-06 19:56:58,396 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 81.5) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have 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:56:58,396 INFO L276 IsEmpty]: Start isEmpty. Operand 18984 states and 21167 transitions. [2024-11-06 19:56:58,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 398 [2024-11-06 19:56:58,399 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:56:58,399 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:56:58,417 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:56:58,600 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-06 19:56:58,600 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:56:58,600 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:56:58,600 INFO L85 PathProgramCache]: Analyzing trace with hash -885413578, now seen corresponding path program 1 times [2024-11-06 19:56:58,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:56:58,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399963925] [2024-11-06 19:56:58,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:56:58,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:56:58,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:56:58,902 INFO L134 CoverageAnalysis]: Checked inductivity of 151 backedges. 79 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2024-11-06 19:56:58,902 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:56:58,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399963925] [2024-11-06 19:56:58,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399963925] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:56:58,903 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:56:58,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:56:58,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [148758825] [2024-11-06 19:56:58,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:56:58,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:56:58,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:56:58,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:56:58,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:56:58,905 INFO L87 Difference]: Start difference. First operand 18984 states and 21167 transitions. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have 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:57:00,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:00,670 INFO L93 Difference]: Finished difference Result 37973 states and 42348 transitions. [2024-11-06 19:57:00,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:00,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 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 397 [2024-11-06 19:57:00,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:00,709 INFO L225 Difference]: With dead ends: 37973 [2024-11-06 19:57:00,709 INFO L226 Difference]: Without dead ends: 19290 [2024-11-06 19:57:00,728 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:57:00,729 INFO L432 NwaCegarLoop]: 592 mSDtfsCounter, 283 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 966 mSolverCounterSat, 110 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 631 SdHoareTripleChecker+Invalid, 1076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 110 IncrementalHoareTripleChecker+Valid, 966 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:00,729 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [283 Valid, 631 Invalid, 1076 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [110 Valid, 966 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-06 19:57:00,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19290 states. [2024-11-06 19:57:00,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19290 to 14186. [2024-11-06 19:57:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14186 states, 14185 states have (on average 1.112513218188227) internal successors, (15781), 14185 states have internal predecessors, (15781), 0 states have call successors, (0), 0 states have 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:57:00,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14186 states to 14186 states and 15781 transitions. [2024-11-06 19:57:00,953 INFO L78 Accepts]: Start accepts. Automaton has 14186 states and 15781 transitions. Word has length 397 [2024-11-06 19:57:00,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:00,954 INFO L471 AbstractCegarLoop]: Abstraction has 14186 states and 15781 transitions. [2024-11-06 19:57:00,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have 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:57:00,954 INFO L276 IsEmpty]: Start isEmpty. Operand 14186 states and 15781 transitions. [2024-11-06 19:57:00,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 406 [2024-11-06 19:57:00,957 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:00,957 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:00,957 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:57:00,957 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:00,958 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:00,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1150338754, now seen corresponding path program 1 times [2024-11-06 19:57:00,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:00,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795822663] [2024-11-06 19:57:00,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:00,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:01,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:01,200 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 159 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:57:01,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:01,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795822663] [2024-11-06 19:57:01,201 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795822663] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:01,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:01,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:01,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1808716711] [2024-11-06 19:57:01,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:01,202 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:01,202 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:01,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:01,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:01,204 INFO L87 Difference]: Start difference. First operand 14186 states and 15781 transitions. Second operand has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have 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:57:02,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:02,337 INFO L93 Difference]: Finished difference Result 31073 states and 35057 transitions. [2024-11-06 19:57:02,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:02,338 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 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 405 [2024-11-06 19:57:02,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:02,367 INFO L225 Difference]: With dead ends: 31073 [2024-11-06 19:57:02,367 INFO L226 Difference]: Without dead ends: 17188 [2024-11-06 19:57:02,378 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:57:02,380 INFO L432 NwaCegarLoop]: 565 mSDtfsCounter, 246 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 883 mSolverCounterSat, 202 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 246 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 1085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 202 IncrementalHoareTripleChecker+Valid, 883 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:02,380 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [246 Valid, 603 Invalid, 1085 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [202 Valid, 883 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 19:57:02,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17188 states. [2024-11-06 19:57:02,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17188 to 16578. [2024-11-06 19:57:02,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16578 states, 16577 states have (on average 1.1010436146467997) internal successors, (18252), 16577 states have internal predecessors, (18252), 0 states have call successors, (0), 0 states have 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:57:02,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16578 states to 16578 states and 18252 transitions. [2024-11-06 19:57:02,551 INFO L78 Accepts]: Start accepts. Automaton has 16578 states and 18252 transitions. Word has length 405 [2024-11-06 19:57:02,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:02,551 INFO L471 AbstractCegarLoop]: Abstraction has 16578 states and 18252 transitions. [2024-11-06 19:57:02,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 135.0) internal successors, (405), 3 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have 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:57:02,552 INFO L276 IsEmpty]: Start isEmpty. Operand 16578 states and 18252 transitions. [2024-11-06 19:57:02,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 520 [2024-11-06 19:57:02,556 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:02,556 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:02,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 19:57:02,557 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:02,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:02,557 INFO L85 PathProgramCache]: Analyzing trace with hash -692568243, now seen corresponding path program 1 times [2024-11-06 19:57:02,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:02,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165561974] [2024-11-06 19:57:02,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:02,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:02,782 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 305 trivial. 0 not checked. [2024-11-06 19:57:02,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:02,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165561974] [2024-11-06 19:57:02,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165561974] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:02,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:02,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:02,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1968076388] [2024-11-06 19:57:02,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:02,784 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:02,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:02,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:02,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:02,819 INFO L87 Difference]: Start difference. First operand 16578 states and 18252 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have 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:57:04,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:04,024 INFO L93 Difference]: Finished difference Result 38232 states and 42166 transitions. [2024-11-06 19:57:04,024 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:04,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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 519 [2024-11-06 19:57:04,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:04,052 INFO L225 Difference]: With dead ends: 38232 [2024-11-06 19:57:04,052 INFO L226 Difference]: Without dead ends: 20463 [2024-11-06 19:57:04,066 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:57:04,066 INFO L432 NwaCegarLoop]: 582 mSDtfsCounter, 281 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 828 mSolverCounterSat, 253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 281 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 1081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 253 IncrementalHoareTripleChecker+Valid, 828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:04,067 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [281 Valid, 621 Invalid, 1081 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [253 Valid, 828 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 19:57:04,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20463 states. [2024-11-06 19:57:04,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20463 to 15962. [2024-11-06 19:57:04,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15962 states, 15961 states have (on average 1.0853329991855147) internal successors, (17323), 15961 states have internal predecessors, (17323), 0 states have call successors, (0), 0 states have 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:57:04,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15962 states to 15962 states and 17323 transitions. [2024-11-06 19:57:04,251 INFO L78 Accepts]: Start accepts. Automaton has 15962 states and 17323 transitions. Word has length 519 [2024-11-06 19:57:04,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:04,252 INFO L471 AbstractCegarLoop]: Abstraction has 15962 states and 17323 transitions. [2024-11-06 19:57:04,252 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have 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:57:04,252 INFO L276 IsEmpty]: Start isEmpty. Operand 15962 states and 17323 transitions. [2024-11-06 19:57:04,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 544 [2024-11-06 19:57:04,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:04,257 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:04,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 19:57:04,258 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:04,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:04,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1665757917, now seen corresponding path program 1 times [2024-11-06 19:57:04,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:04,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987351771] [2024-11-06 19:57:04,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:04,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:04,556 INFO L134 CoverageAnalysis]: Checked inductivity of 453 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 334 trivial. 0 not checked. [2024-11-06 19:57:04,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:04,557 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987351771] [2024-11-06 19:57:04,558 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987351771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:04,558 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:04,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:04,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570282469] [2024-11-06 19:57:04,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:04,559 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:04,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:04,559 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:04,559 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:04,559 INFO L87 Difference]: Start difference. First operand 15962 states and 17323 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have 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:57:05,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:05,454 INFO L93 Difference]: Finished difference Result 31020 states and 33705 transitions. [2024-11-06 19:57:05,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:05,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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 543 [2024-11-06 19:57:05,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:05,477 INFO L225 Difference]: With dead ends: 31020 [2024-11-06 19:57:05,477 INFO L226 Difference]: Without dead ends: 16259 [2024-11-06 19:57:05,490 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:57:05,491 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 463 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 791 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 891 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 791 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:05,491 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [463 Valid, 69 Invalid, 891 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 791 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:57:05,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16259 states. [2024-11-06 19:57:05,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16259 to 15960. [2024-11-06 19:57:05,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15960 states, 15959 states have (on average 1.085218372078451) internal successors, (17319), 15959 states have internal predecessors, (17319), 0 states have call successors, (0), 0 states have 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:57:05,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15960 states to 15960 states and 17319 transitions. [2024-11-06 19:57:05,656 INFO L78 Accepts]: Start accepts. Automaton has 15960 states and 17319 transitions. Word has length 543 [2024-11-06 19:57:05,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:05,657 INFO L471 AbstractCegarLoop]: Abstraction has 15960 states and 17319 transitions. [2024-11-06 19:57:05,657 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have 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:57:05,657 INFO L276 IsEmpty]: Start isEmpty. Operand 15960 states and 17319 transitions. [2024-11-06 19:57:05,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 553 [2024-11-06 19:57:05,663 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:05,663 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:05,663 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 19:57:05,664 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:05,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:05,664 INFO L85 PathProgramCache]: Analyzing trace with hash 567704361, now seen corresponding path program 1 times [2024-11-06 19:57:05,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:05,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586249039] [2024-11-06 19:57:05,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:05,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:05,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:05,961 INFO L134 CoverageAnalysis]: Checked inductivity of 594 backedges. 359 proven. 0 refuted. 0 times theorem prover too weak. 235 trivial. 0 not checked. [2024-11-06 19:57:05,962 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:05,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586249039] [2024-11-06 19:57:05,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586249039] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:05,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:05,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:05,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819753781] [2024-11-06 19:57:05,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:05,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:05,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:05,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:05,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:05,965 INFO L87 Difference]: Start difference. First operand 15960 states and 17319 transitions. Second operand has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have 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:57:06,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:06,976 INFO L93 Difference]: Finished difference Result 34307 states and 37626 transitions. [2024-11-06 19:57:06,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:06,977 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 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 552 [2024-11-06 19:57:06,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:06,993 INFO L225 Difference]: With dead ends: 34307 [2024-11-06 19:57:06,994 INFO L226 Difference]: Without dead ends: 18651 [2024-11-06 19:57:07,005 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:57:07,006 INFO L432 NwaCegarLoop]: 220 mSDtfsCounter, 270 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 270 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 233 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:07,006 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [270 Valid, 280 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [233 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 19:57:07,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18651 states. [2024-11-06 19:57:07,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18651 to 12961. [2024-11-06 19:57:07,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12961 states, 12960 states have (on average 1.0740740740740742) internal successors, (13920), 12960 states have internal predecessors, (13920), 0 states have call successors, (0), 0 states have 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:57:07,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12961 states to 12961 states and 13920 transitions. [2024-11-06 19:57:07,168 INFO L78 Accepts]: Start accepts. Automaton has 12961 states and 13920 transitions. Word has length 552 [2024-11-06 19:57:07,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:07,169 INFO L471 AbstractCegarLoop]: Abstraction has 12961 states and 13920 transitions. [2024-11-06 19:57:07,169 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 127.66666666666667) internal successors, (383), 3 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have 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:57:07,169 INFO L276 IsEmpty]: Start isEmpty. Operand 12961 states and 13920 transitions. [2024-11-06 19:57:07,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 584 [2024-11-06 19:57:07,174 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:07,175 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:07,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-06 19:57:07,175 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:07,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:07,176 INFO L85 PathProgramCache]: Analyzing trace with hash -1650113604, now seen corresponding path program 1 times [2024-11-06 19:57:07,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:07,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [313803217] [2024-11-06 19:57:07,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:07,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:07,975 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 80 proven. 243 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2024-11-06 19:57:07,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:07,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [313803217] [2024-11-06 19:57:07,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [313803217] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:57:07,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167499764] [2024-11-06 19:57:07,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:07,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:57:07,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:57:07,979 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:57:07,980 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:57:08,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:08,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 697 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:57:08,172 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:57:08,263 INFO L134 CoverageAnalysis]: Checked inductivity of 495 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-06 19:57:08,264 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:57:08,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167499764] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:08,264 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:57:08,264 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-06 19:57:08,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53984079] [2024-11-06 19:57:08,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:08,265 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:08,265 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:08,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:08,266 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:57:08,266 INFO L87 Difference]: Start difference. First operand 12961 states and 13920 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have 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:57:09,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:09,364 INFO L93 Difference]: Finished difference Result 15355 states and 16410 transitions. [2024-11-06 19:57:09,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:09,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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 583 [2024-11-06 19:57:09,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:09,377 INFO L225 Difference]: With dead ends: 15355 [2024-11-06 19:57:09,377 INFO L226 Difference]: Without dead ends: 15353 [2024-11-06 19:57:09,380 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 587 GetRequests, 584 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:57:09,381 INFO L432 NwaCegarLoop]: 213 mSDtfsCounter, 273 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 799 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 254 SdHoareTripleChecker+Invalid, 825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 799 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:09,381 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [273 Valid, 254 Invalid, 825 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 799 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 19:57:09,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15353 states. [2024-11-06 19:57:09,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15353 to 11759. [2024-11-06 19:57:09,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11759 states, 11758 states have (on average 1.0788399387650962) internal successors, (12685), 11758 states have internal predecessors, (12685), 0 states have call successors, (0), 0 states have 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:57:09,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11759 states to 11759 states and 12685 transitions. [2024-11-06 19:57:09,474 INFO L78 Accepts]: Start accepts. Automaton has 11759 states and 12685 transitions. Word has length 583 [2024-11-06 19:57:09,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:09,475 INFO L471 AbstractCegarLoop]: Abstraction has 11759 states and 12685 transitions. [2024-11-06 19:57:09,475 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have 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:57:09,475 INFO L276 IsEmpty]: Start isEmpty. Operand 11759 states and 12685 transitions. [2024-11-06 19:57:09,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 610 [2024-11-06 19:57:09,480 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:09,481 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:09,498 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-06 19:57:09,681 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,SelfDestructingSolverStorable16 [2024-11-06 19:57:09,681 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:09,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:09,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1916958150, now seen corresponding path program 1 times [2024-11-06 19:57:09,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:09,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093689519] [2024-11-06 19:57:09,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:09,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:10,040 INFO L134 CoverageAnalysis]: Checked inductivity of 694 backedges. 362 proven. 0 refuted. 0 times theorem prover too weak. 332 trivial. 0 not checked. [2024-11-06 19:57:10,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:10,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093689519] [2024-11-06 19:57:10,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093689519] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:10,040 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:10,040 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:10,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005954032] [2024-11-06 19:57:10,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:10,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:10,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:10,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:10,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:10,042 INFO L87 Difference]: Start difference. First operand 11759 states and 12685 transitions. Second operand has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have 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:57:11,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:11,143 INFO L93 Difference]: Finished difference Result 28613 states and 30913 transitions. [2024-11-06 19:57:11,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:11,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 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 609 [2024-11-06 19:57:11,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:11,164 INFO L225 Difference]: With dead ends: 28613 [2024-11-06 19:57:11,165 INFO L226 Difference]: Without dead ends: 17155 [2024-11-06 19:57:11,174 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:11,175 INFO L432 NwaCegarLoop]: 524 mSDtfsCounter, 254 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 1013 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:11,175 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [254 Valid, 557 Invalid, 1013 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-06 19:57:11,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17155 states. [2024-11-06 19:57:11,280 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17155 to 15948. [2024-11-06 19:57:11,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15948 states, 15947 states have (on average 1.0687903680943125) internal successors, (17044), 15947 states have internal predecessors, (17044), 0 states have call successors, (0), 0 states have 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:57:11,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15948 states to 15948 states and 17044 transitions. [2024-11-06 19:57:11,306 INFO L78 Accepts]: Start accepts. Automaton has 15948 states and 17044 transitions. Word has length 609 [2024-11-06 19:57:11,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:11,307 INFO L471 AbstractCegarLoop]: Abstraction has 15948 states and 17044 transitions. [2024-11-06 19:57:11,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.33333333333334) internal successors, (385), 3 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have 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:57:11,307 INFO L276 IsEmpty]: Start isEmpty. Operand 15948 states and 17044 transitions. [2024-11-06 19:57:11,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 615 [2024-11-06 19:57:11,312 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:11,312 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:11,312 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-06 19:57:11,312 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:11,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:11,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1564422367, now seen corresponding path program 1 times [2024-11-06 19:57:11,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:11,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652507800] [2024-11-06 19:57:11,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:11,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:11,561 INFO L134 CoverageAnalysis]: Checked inductivity of 733 backedges. 418 proven. 0 refuted. 0 times theorem prover too weak. 315 trivial. 0 not checked. [2024-11-06 19:57:11,561 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:11,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652507800] [2024-11-06 19:57:11,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [652507800] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:11,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:11,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:11,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1339441586] [2024-11-06 19:57:11,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:11,563 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:11,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:11,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:11,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:11,564 INFO L87 Difference]: Start difference. First operand 15948 states and 17044 transitions. Second operand has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have 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:57:12,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:12,474 INFO L93 Difference]: Finished difference Result 34584 states and 37113 transitions. [2024-11-06 19:57:12,475 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:12,475 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 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 614 [2024-11-06 19:57:12,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:12,490 INFO L225 Difference]: With dead ends: 34584 [2024-11-06 19:57:12,490 INFO L226 Difference]: Without dead ends: 18937 [2024-11-06 19:57:12,499 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:57:12,500 INFO L432 NwaCegarLoop]: 401 mSDtfsCounter, 300 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 827 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 300 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 926 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:12,500 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [300 Valid, 421 Invalid, 926 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 827 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:57:12,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18937 states. [2024-11-06 19:57:12,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18937 to 17741. [2024-11-06 19:57:12,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17741 states, 17740 states have (on average 1.0711386696730552) internal successors, (19002), 17740 states have internal predecessors, (19002), 0 states have call successors, (0), 0 states have 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:57:12,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17741 states to 17741 states and 19002 transitions. [2024-11-06 19:57:12,687 INFO L78 Accepts]: Start accepts. Automaton has 17741 states and 19002 transitions. Word has length 614 [2024-11-06 19:57:12,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:12,687 INFO L471 AbstractCegarLoop]: Abstraction has 17741 states and 19002 transitions. [2024-11-06 19:57:12,687 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have 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:57:12,687 INFO L276 IsEmpty]: Start isEmpty. Operand 17741 states and 19002 transitions. [2024-11-06 19:57:12,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 640 [2024-11-06 19:57:12,697 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:12,697 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:12,697 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-06 19:57:12,697 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:12,698 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:12,698 INFO L85 PathProgramCache]: Analyzing trace with hash 1025909602, now seen corresponding path program 1 times [2024-11-06 19:57:12,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:12,698 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438331742] [2024-11-06 19:57:12,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:12,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:12,893 INFO L134 CoverageAnalysis]: Checked inductivity of 551 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 432 trivial. 0 not checked. [2024-11-06 19:57:12,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:12,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438331742] [2024-11-06 19:57:12,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438331742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:12,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:12,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:57:12,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682494049] [2024-11-06 19:57:12,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:12,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:12,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:12,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:12,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:57:12,896 INFO L87 Difference]: Start difference. First operand 17741 states and 19002 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have 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:57:13,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:13,818 INFO L93 Difference]: Finished difference Result 39663 states and 42502 transitions. [2024-11-06 19:57:13,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:13,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 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 639 [2024-11-06 19:57:13,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:13,840 INFO L225 Difference]: With dead ends: 39663 [2024-11-06 19:57:13,840 INFO L226 Difference]: Without dead ends: 22223 [2024-11-06 19:57:13,849 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:57:13,850 INFO L432 NwaCegarLoop]: 159 mSDtfsCounter, 302 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 812 mSolverCounterSat, 156 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 968 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 156 IncrementalHoareTripleChecker+Valid, 812 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:13,850 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [302 Valid, 193 Invalid, 968 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [156 Valid, 812 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:57:13,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22223 states. [2024-11-06 19:57:14,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22223 to 19232. [2024-11-06 19:57:14,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19232 states, 19231 states have (on average 1.067027195673652) internal successors, (20520), 19231 states have internal predecessors, (20520), 0 states have call successors, (0), 0 states have 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:57:14,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19232 states to 19232 states and 20520 transitions. [2024-11-06 19:57:14,031 INFO L78 Accepts]: Start accepts. Automaton has 19232 states and 20520 transitions. Word has length 639 [2024-11-06 19:57:14,031 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:14,031 INFO L471 AbstractCegarLoop]: Abstraction has 19232 states and 20520 transitions. [2024-11-06 19:57:14,031 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have 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:57:14,031 INFO L276 IsEmpty]: Start isEmpty. Operand 19232 states and 20520 transitions. [2024-11-06 19:57:14,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 668 [2024-11-06 19:57:14,037 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:14,038 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:14,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-06 19:57:14,038 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:14,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:14,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1327716536, now seen corresponding path program 1 times [2024-11-06 19:57:14,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:14,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729988856] [2024-11-06 19:57:14,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:14,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:14,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:14,918 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 80 proven. 243 refuted. 0 times theorem prover too weak. 254 trivial. 0 not checked. [2024-11-06 19:57:14,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:14,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729988856] [2024-11-06 19:57:14,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729988856] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:57:14,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396279249] [2024-11-06 19:57:14,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:14,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:57:14,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:57:14,921 INFO L229 MonitoredProcess]: Starting monitored process 4 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:57:14,923 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-06 19:57:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:15,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 786 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:57:15,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:57:15,177 INFO L134 CoverageAnalysis]: Checked inductivity of 577 backedges. 119 proven. 0 refuted. 0 times theorem prover too weak. 458 trivial. 0 not checked. [2024-11-06 19:57:15,177 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:57:15,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396279249] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:15,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:57:15,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-06 19:57:15,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511479102] [2024-11-06 19:57:15,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:15,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:57:15,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:15,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:57:15,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:57:15,181 INFO L87 Difference]: Start difference. First operand 19232 states and 20520 transitions. Second operand has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have 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:57:16,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:16,039 INFO L93 Difference]: Finished difference Result 37557 states and 40105 transitions. [2024-11-06 19:57:16,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:57:16,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 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 667 [2024-11-06 19:57:16,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:16,054 INFO L225 Difference]: With dead ends: 37557 [2024-11-06 19:57:16,054 INFO L226 Difference]: Without dead ends: 18626 [2024-11-06 19:57:16,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 671 GetRequests, 668 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 19:57:16,065 INFO L432 NwaCegarLoop]: 490 mSDtfsCounter, 287 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 794 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 523 SdHoareTripleChecker+Invalid, 921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:16,065 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 523 Invalid, 921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 794 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 19:57:16,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18626 states. [2024-11-06 19:57:16,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18626 to 18027. [2024-11-06 19:57:16,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18027 states, 18026 states have (on average 1.0402751581049594) internal successors, (18752), 18026 states have internal predecessors, (18752), 0 states have call successors, (0), 0 states have 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:57:16,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18027 states to 18027 states and 18752 transitions. [2024-11-06 19:57:16,187 INFO L78 Accepts]: Start accepts. Automaton has 18027 states and 18752 transitions. Word has length 667 [2024-11-06 19:57:16,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:16,187 INFO L471 AbstractCegarLoop]: Abstraction has 18027 states and 18752 transitions. [2024-11-06 19:57:16,187 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have 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:57:16,187 INFO L276 IsEmpty]: Start isEmpty. Operand 18027 states and 18752 transitions. [2024-11-06 19:57:16,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 810 [2024-11-06 19:57:16,199 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:57:16,199 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:57:16,211 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-06 19:57:16,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:57:16,400 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:57:16,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:57:16,400 INFO L85 PathProgramCache]: Analyzing trace with hash -353309477, now seen corresponding path program 1 times [2024-11-06 19:57:16,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:57:16,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158878182] [2024-11-06 19:57:16,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:57:16,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:57:16,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:57:16,917 INFO L134 CoverageAnalysis]: Checked inductivity of 1265 backedges. 691 proven. 0 refuted. 0 times theorem prover too weak. 574 trivial. 0 not checked. [2024-11-06 19:57:16,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:57:16,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158878182] [2024-11-06 19:57:16,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158878182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:57:16,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:57:16,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 19:57:16,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148628079] [2024-11-06 19:57:16,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:57:16,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:57:16,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:57:16,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:57:16,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:57:16,919 INFO L87 Difference]: Start difference. First operand 18027 states and 18752 transitions. Second operand has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have 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:57:18,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:57:18,557 INFO L93 Difference]: Finished difference Result 41442 states and 43043 transitions. [2024-11-06 19:57:18,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:57:18,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 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 809 [2024-11-06 19:57:18,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:57:18,559 INFO L225 Difference]: With dead ends: 41442 [2024-11-06 19:57:18,559 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 19:57:18,573 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:57:18,575 INFO L432 NwaCegarLoop]: 393 mSDtfsCounter, 486 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 1570 mSolverCounterSat, 195 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 486 SdHoareTripleChecker+Valid, 439 SdHoareTripleChecker+Invalid, 1765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 195 IncrementalHoareTripleChecker+Valid, 1570 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-06 19:57:18,575 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [486 Valid, 439 Invalid, 1765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [195 Valid, 1570 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-06 19:57:18,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 19:57:18,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 19:57:18,576 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:57:18,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 19:57:18,577 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 809 [2024-11-06 19:57:18,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:57:18,577 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 19:57:18,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 128.25) internal successors, (513), 4 states have internal predecessors, (513), 0 states have call successors, (0), 0 states have 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:57:18,577 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 19:57:18,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 19:57:18,580 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 19:57:18,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-06 19:57:18,583 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:57:18,585 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 19:57:22,272 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 19:57:22,292 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 07:57:22 BoogieIcfgContainer [2024-11-06 19:57:22,292 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 19:57:22,293 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 19:57:22,293 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 19:57:22,293 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 19:57:22,294 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:56:32" (3/4) ... [2024-11-06 19:57:22,295 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 19:57:22,326 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-06 19:57:22,329 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 19:57:22,331 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 19:57:22,333 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 19:57:22,525 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 19:57:22,525 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 19:57:22,525 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 19:57:22,527 INFO L158 Benchmark]: Toolchain (without parser) took 53836.73ms. Allocated memory was 117.4MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 86.6MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 336.5MB. Max. memory is 16.1GB. [2024-11-06 19:57:22,527 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 117.4MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 19:57:22,528 INFO L158 Benchmark]: CACSL2BoogieTranslator took 752.78ms. Allocated memory is still 117.4MB. Free memory was 86.5MB in the beginning and 55.3MB in the end (delta: 31.2MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. [2024-11-06 19:57:22,528 INFO L158 Benchmark]: Boogie Procedure Inliner took 231.30ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 55.3MB in the beginning and 91.3MB in the end (delta: -36.1MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2024-11-06 19:57:22,529 INFO L158 Benchmark]: Boogie Preprocessor took 300.77ms. Allocated memory is still 151.0MB. Free memory was 91.3MB in the beginning and 87.4MB in the end (delta: 4.0MB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. [2024-11-06 19:57:22,529 INFO L158 Benchmark]: RCFGBuilder took 2560.46ms. Allocated memory was 151.0MB in the beginning and 310.4MB in the end (delta: 159.4MB). Free memory was 87.4MB in the beginning and 118.6MB in the end (delta: -31.2MB). Peak memory consumption was 132.6MB. Max. memory is 16.1GB. [2024-11-06 19:57:22,531 INFO L158 Benchmark]: TraceAbstraction took 49752.11ms. Allocated memory was 310.4MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 116.3MB in the beginning and 1.1GB in the end (delta: -997.4MB). Peak memory consumption was 827.4MB. Max. memory is 16.1GB. [2024-11-06 19:57:22,531 INFO L158 Benchmark]: Witness Printer took 232.63ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-06 19:57:22,532 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.23ms. Allocated memory is still 117.4MB. Free memory is still 82.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 752.78ms. Allocated memory is still 117.4MB. Free memory was 86.5MB in the beginning and 55.3MB in the end (delta: 31.2MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 231.30ms. Allocated memory was 117.4MB in the beginning and 151.0MB in the end (delta: 33.6MB). Free memory was 55.3MB in the beginning and 91.3MB in the end (delta: -36.1MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. * Boogie Preprocessor took 300.77ms. Allocated memory is still 151.0MB. Free memory was 91.3MB in the beginning and 87.4MB in the end (delta: 4.0MB). Peak memory consumption was 83.3MB. Max. memory is 16.1GB. * RCFGBuilder took 2560.46ms. Allocated memory was 151.0MB in the beginning and 310.4MB in the end (delta: 159.4MB). Free memory was 87.4MB in the beginning and 118.6MB in the end (delta: -31.2MB). Peak memory consumption was 132.6MB. Max. memory is 16.1GB. * TraceAbstraction took 49752.11ms. Allocated memory was 310.4MB in the beginning and 1.5GB in the end (delta: 1.1GB). Free memory was 116.3MB in the beginning and 1.1GB in the end (delta: -997.4MB). Peak memory consumption was 827.4MB. Max. memory is 16.1GB. * Witness Printer took 232.63ms. Allocated memory is still 1.5GB. Free memory was 1.1GB in the beginning and 1.1GB in the end (delta: 25.0MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 143]: 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, 424 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 46.0s, OverallIterations: 22, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 32.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 7005 SdHoareTripleChecker+Valid, 30.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 7005 mSDsluCounter, 8842 SdHoareTripleChecker+Invalid, 25.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 939 mSDsCounter, 4314 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 24028 IncrementalHoareTripleChecker+Invalid, 28342 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4314 mSolverCounterUnsat, 7903 mSDtfsCounter, 24028 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1703 GetRequests, 1669 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=19232occurred in iteration=20, InterpolantAutomatonStates: 71, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.7s AutomataMinimizationTime, 22 MinimizatonAttempts, 30371 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 10368 NumberOfCodeBlocks, 10368 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 10343 ConstructedInterpolants, 0 QuantifiedInterpolants, 25192 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1964 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 25 InterpolantComputations, 22 PerfectInterpolantSequences, 7605/8155 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: 1776]: Loop Invariant Derived loop invariant: (((((((((((((((((((0 <= ((long long) 97 + a0)) && (((long long) 42 + a4) <= 0)) && (a2 == 1)) || ((((long long) 42 + a4) <= 0) && (a2 == 4))) || (((((long long) 42 + a4) <= 0) && (3 == a2)) && (((long long) a0 + 61) <= 0))) || ((5 <= a2) && (((long long) a4 + 86) <= 0))) || ((2 == a2) && (((long long) a4 + 86) <= 0))) || ((2 == a2) && (((long long) a0 + 147) <= 0))) || (((((long long) 42 + a4) <= 0) && (0 <= ((long long) 44 + a0))) && (3 == a2))) || (((((long long) 42 + a4) <= 0) && (44 <= a29)) && (5 <= a2))) || (((((long long) 42 + a4) <= 0) && (2 == a2)) && (((long long) a0 + 61) <= 0))) || (((a2 == 1) && (((long long) a4 + 86) <= 0)) && (((long long) a29 + 144) <= 0))) || ((((long long) 89 + a4) <= 0) && (((long long) a0 + 147) <= 0))) || (((44 <= a29) && (a2 == 1)) && (((long long) a4 + 86) <= 0))) || ((((long long) a4 + 86) <= 0) && (3 == a2))) || (((((long long) a0 + 147) <= 0) && (a2 == 1)) && (((long long) a4 + 86) <= 0))) || (((((long long) 42 + a4) <= 0) && (0 <= ((long long) a4 + 85))) && (a2 == 1))) || (((((long long) 42 + a4) <= 0) && (5 <= a2)) && (((long long) a0 + 61) <= 0))) || (((((long long) 42 + a4) <= 0) && (2 == a2)) && (((long long) a29 + 144) <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-06 19:57:22,561 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE