./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem16_label39.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/eca-rers2012/Problem16_label39.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', 'c9e5fbdda66ebb475fc0f8bb519ddbac927ae9c052949a5df5d6f2e890e35299'] 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/Problem16_label39.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c9e5fbdda66ebb475fc0f8bb519ddbac927ae9c052949a5df5d6f2e890e35299 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 20:02:15,545 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 20:02:15,635 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 20:02:15,641 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 20:02:15,642 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 20:02:15,662 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 20:02:15,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 20:02:15,666 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 20:02:15,666 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 20:02:15,666 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 20:02:15,667 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 20:02:15,667 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 20:02:15,667 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 20:02:15,667 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 20:02:15,667 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 20:02:15,667 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 20:02:15,667 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 20:02:15,667 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 20:02:15,667 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 20:02:15,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 20:02:15,668 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 20:02:15,668 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 20:02:15,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 20:02:15,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 20:02:15,668 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 20:02:15,668 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 20:02:15,668 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 20:02:15,668 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 20:02:15,668 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 20:02:15,668 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 20:02:15,668 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 20:02:15,668 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 20:02:15,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:02:15,669 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 20:02:15,669 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 20:02:15,669 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 20:02:15,669 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 20:02:15,669 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 20:02:15,672 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 20:02:15,672 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 20:02:15,672 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 20:02:15,672 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 20:02:15,672 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 -> c9e5fbdda66ebb475fc0f8bb519ddbac927ae9c052949a5df5d6f2e890e35299 [2024-11-06 20:02:15,952 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 20:02:15,961 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 20:02:15,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 20:02:15,967 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 20:02:15,967 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 20:02:15,968 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem16_label39.c [2024-11-06 20:02:17,276 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 20:02:17,595 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 20:02:17,596 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem16_label39.c [2024-11-06 20:02:17,617 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5255ba776/bfab8cf738a644d399b661209ade2005/FLAG865d9b923 [2024-11-06 20:02:17,636 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/5255ba776/bfab8cf738a644d399b661209ade2005 [2024-11-06 20:02:17,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 20:02:17,640 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 20:02:17,642 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 20:02:17,642 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 20:02:17,646 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 20:02:17,647 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:02:17" (1/1) ... [2024-11-06 20:02:17,649 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42140b0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:02:17, skipping insertion in model container [2024-11-06 20:02:17,649 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:02:17" (1/1) ... [2024-11-06 20:02:17,703 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 20:02:17,873 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/Problem16_label39.c[5211,5224] [2024-11-06 20:02:18,147 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:02:18,156 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 20:02:18,178 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/Problem16_label39.c[5211,5224] [2024-11-06 20:02:18,297 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:02:18,313 INFO L204 MainTranslator]: Completed translation [2024-11-06 20:02:18,314 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:02:18 WrapperNode [2024-11-06 20:02:18,315 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 20:02:18,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 20:02:18,316 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 20:02:18,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 20:02:18,321 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:02:18" (1/1) ... [2024-11-06 20:02:18,345 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:02:18" (1/1) ... [2024-11-06 20:02:18,479 INFO L138 Inliner]: procedures = 15, calls = 9, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 1770 [2024-11-06 20:02:18,480 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 20:02:18,480 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 20:02:18,480 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 20:02:18,480 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 20:02:18,488 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:02:18" (1/1) ... [2024-11-06 20:02:18,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:02:18" (1/1) ... [2024-11-06 20:02:18,510 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:02:18" (1/1) ... [2024-11-06 20:02:18,569 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-06 20:02:18,570 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:02:18" (1/1) ... [2024-11-06 20:02:18,570 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:02:18" (1/1) ... [2024-11-06 20:02:18,631 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:02:18" (1/1) ... [2024-11-06 20:02:18,646 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:02:18" (1/1) ... [2024-11-06 20:02:18,675 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:02:18" (1/1) ... [2024-11-06 20:02:18,685 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:02:18" (1/1) ... [2024-11-06 20:02:18,708 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 20:02:18,710 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 20:02:18,710 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 20:02:18,710 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 20:02:18,711 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:02:18" (1/1) ... [2024-11-06 20:02:18,719 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:02:18,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:02:18,745 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 20:02:18,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 20:02:18,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 20:02:18,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 20:02:18,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 20:02:18,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 20:02:18,841 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 20:02:18,843 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 20:02:20,918 INFO L? ?]: Removed 276 outVars from TransFormulas that were not future-live. [2024-11-06 20:02:20,918 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 20:02:20,941 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 20:02:20,945 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 20:02:20,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:02:20 BoogieIcfgContainer [2024-11-06 20:02:20,947 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 20:02:20,949 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 20:02:20,949 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 20:02:20,953 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 20:02:20,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:02:17" (1/3) ... [2024-11-06 20:02:20,954 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba87801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:02:20, skipping insertion in model container [2024-11-06 20:02:20,954 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:02:18" (2/3) ... [2024-11-06 20:02:20,955 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6ba87801 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:02:20, skipping insertion in model container [2024-11-06 20:02:20,955 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:02:20" (3/3) ... [2024-11-06 20:02:20,956 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem16_label39.c [2024-11-06 20:02:20,970 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 20:02:20,970 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 20:02:21,040 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 20:02:21,052 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;@79926b42, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 20:02:21,053 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 20:02:21,060 INFO L276 IsEmpty]: Start isEmpty. Operand has 396 states, 394 states have (on average 1.8350253807106598) internal successors, (723), 395 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:21,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-06 20:02:21,068 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:02:21,069 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:02:21,070 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:02:21,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:02:21,075 INFO L85 PathProgramCache]: Analyzing trace with hash 301649817, now seen corresponding path program 1 times [2024-11-06 20:02:21,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:02:21,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275377512] [2024-11-06 20:02:21,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:02:21,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:02:21,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:02:21,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:02:21,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:02:21,452 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275377512] [2024-11-06 20:02:21,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275377512] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:02:21,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:02:21,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:02:21,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540150916] [2024-11-06 20:02:21,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:02:21,459 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:02:21,461 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:02:21,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:02:21,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:21,484 INFO L87 Difference]: Start difference. First operand has 396 states, 394 states have (on average 1.8350253807106598) internal successors, (723), 395 states have internal predecessors, (723), 0 states have call successors, (0), 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 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:23,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:02:23,244 INFO L93 Difference]: Finished difference Result 1122 states and 2103 transitions. [2024-11-06 20:02:23,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:02:23,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 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 49 [2024-11-06 20:02:23,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:02:23,261 INFO L225 Difference]: With dead ends: 1122 [2024-11-06 20:02:23,264 INFO L226 Difference]: Without dead ends: 662 [2024-11-06 20:02:23,269 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:23,272 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 311 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 1054 mSolverCounterSat, 251 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 311 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 1305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 251 IncrementalHoareTripleChecker+Valid, 1054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2024-11-06 20:02:23,274 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [311 Valid, 223 Invalid, 1305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [251 Valid, 1054 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2024-11-06 20:02:23,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2024-11-06 20:02:23,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 662. [2024-11-06 20:02:23,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 662 states, 661 states have (on average 1.5824508320726172) internal successors, (1046), 661 states have internal predecessors, (1046), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:23,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 662 states to 662 states and 1046 transitions. [2024-11-06 20:02:23,354 INFO L78 Accepts]: Start accepts. Automaton has 662 states and 1046 transitions. Word has length 49 [2024-11-06 20:02:23,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:02:23,355 INFO L471 AbstractCegarLoop]: Abstraction has 662 states and 1046 transitions. [2024-11-06 20:02:23,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 2 states have internal predecessors, (49), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:23,355 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 1046 transitions. [2024-11-06 20:02:23,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2024-11-06 20:02:23,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:02:23,359 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, 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] [2024-11-06 20:02:23,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 20:02:23,360 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:02:23,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:02:23,361 INFO L85 PathProgramCache]: Analyzing trace with hash -2012615357, now seen corresponding path program 1 times [2024-11-06 20:02:23,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:02:23,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [629958771] [2024-11-06 20:02:23,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:02:23,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:02:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:02:23,643 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:02:23,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:02:23,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [629958771] [2024-11-06 20:02:23,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [629958771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:02:23,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:02:23,645 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:02:23,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046767758] [2024-11-06 20:02:23,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:02:23,646 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:02:23,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:02:23,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:02:23,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:23,647 INFO L87 Difference]: Start difference. First operand 662 states and 1046 transitions. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:24,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:02:24,857 INFO L93 Difference]: Finished difference Result 1651 states and 2539 transitions. [2024-11-06 20:02:24,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:02:24,858 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 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 120 [2024-11-06 20:02:24,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:02:24,862 INFO L225 Difference]: With dead ends: 1651 [2024-11-06 20:02:24,862 INFO L226 Difference]: Without dead ends: 991 [2024-11-06 20:02:24,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:24,865 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 338 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 882 mSolverCounterSat, 268 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 338 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 1150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 268 IncrementalHoareTripleChecker+Valid, 882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 20:02:24,865 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [338 Valid, 77 Invalid, 1150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [268 Valid, 882 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 20:02:24,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2024-11-06 20:02:24,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2024-11-06 20:02:24,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 990 states have (on average 1.3767676767676769) internal successors, (1363), 990 states have internal predecessors, (1363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:24,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1363 transitions. [2024-11-06 20:02:24,915 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1363 transitions. Word has length 120 [2024-11-06 20:02:24,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:02:24,916 INFO L471 AbstractCegarLoop]: Abstraction has 991 states and 1363 transitions. [2024-11-06 20:02:24,916 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 2 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:24,917 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1363 transitions. [2024-11-06 20:02:24,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-11-06 20:02:24,920 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:02:24,920 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, 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 20:02:24,920 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 20:02:24,920 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:02:24,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:02:24,924 INFO L85 PathProgramCache]: Analyzing trace with hash 1442642056, now seen corresponding path program 1 times [2024-11-06 20:02:24,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:02:24,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690792098] [2024-11-06 20:02:24,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:02:24,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:02:24,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:02:25,150 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:02:25,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:02:25,150 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690792098] [2024-11-06 20:02:25,150 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690792098] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:02:25,150 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:02:25,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:02:25,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832092567] [2024-11-06 20:02:25,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:02:25,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:02:25,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:02:25,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:02:25,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:25,152 INFO L87 Difference]: Start difference. First operand 991 states and 1363 transitions. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:26,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:02:26,365 INFO L93 Difference]: Finished difference Result 2967 states and 4084 transitions. [2024-11-06 20:02:26,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:02:26,366 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 121 [2024-11-06 20:02:26,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:02:26,374 INFO L225 Difference]: With dead ends: 2967 [2024-11-06 20:02:26,374 INFO L226 Difference]: Without dead ends: 1978 [2024-11-06 20:02:26,375 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:26,376 INFO L432 NwaCegarLoop]: 205 mSDtfsCounter, 289 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 289 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 1196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 390 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 20:02:26,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [289 Valid, 209 Invalid, 1196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [390 Valid, 806 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 20:02:26,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2024-11-06 20:02:26,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1978. [2024-11-06 20:02:26,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1978 states, 1977 states have (on average 1.2468386444107233) internal successors, (2465), 1977 states have internal predecessors, (2465), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:26,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1978 states to 1978 states and 2465 transitions. [2024-11-06 20:02:26,420 INFO L78 Accepts]: Start accepts. Automaton has 1978 states and 2465 transitions. Word has length 121 [2024-11-06 20:02:26,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:02:26,421 INFO L471 AbstractCegarLoop]: Abstraction has 1978 states and 2465 transitions. [2024-11-06 20:02:26,422 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 2 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:26,422 INFO L276 IsEmpty]: Start isEmpty. Operand 1978 states and 2465 transitions. [2024-11-06 20:02:26,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2024-11-06 20:02:26,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:02:26,424 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, 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] [2024-11-06 20:02:26,424 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 20:02:26,424 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:02:26,425 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:02:26,425 INFO L85 PathProgramCache]: Analyzing trace with hash 511251051, now seen corresponding path program 1 times [2024-11-06 20:02:26,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:02:26,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009218064] [2024-11-06 20:02:26,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:02:26,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:02:26,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:02:26,593 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:02:26,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:02:26,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009218064] [2024-11-06 20:02:26,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009218064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:02:26,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:02:26,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:02:26,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444349061] [2024-11-06 20:02:26,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:02:26,594 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:02:26,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:02:26,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:02:26,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:26,595 INFO L87 Difference]: Start difference. First operand 1978 states and 2465 transitions. Second operand has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:27,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:02:27,851 INFO L93 Difference]: Finished difference Result 4612 states and 5852 transitions. [2024-11-06 20:02:27,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:02:27,851 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 136 [2024-11-06 20:02:27,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:02:27,861 INFO L225 Difference]: With dead ends: 4612 [2024-11-06 20:02:27,861 INFO L226 Difference]: Without dead ends: 2636 [2024-11-06 20:02:27,864 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:27,865 INFO L432 NwaCegarLoop]: 533 mSDtfsCounter, 335 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 322 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 335 SdHoareTripleChecker+Valid, 539 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-06 20:02:27,866 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [335 Valid, 539 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [322 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-06 20:02:27,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2636 states. [2024-11-06 20:02:27,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2636 to 2636. [2024-11-06 20:02:27,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2636 states, 2635 states have (on average 1.21707779886148) internal successors, (3207), 2635 states have internal predecessors, (3207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:27,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2636 states to 2636 states and 3207 transitions. [2024-11-06 20:02:27,912 INFO L78 Accepts]: Start accepts. Automaton has 2636 states and 3207 transitions. Word has length 136 [2024-11-06 20:02:27,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:02:27,913 INFO L471 AbstractCegarLoop]: Abstraction has 2636 states and 3207 transitions. [2024-11-06 20:02:27,913 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.333333333333336) internal successors, (136), 3 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:27,913 INFO L276 IsEmpty]: Start isEmpty. Operand 2636 states and 3207 transitions. [2024-11-06 20:02:27,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2024-11-06 20:02:27,919 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:02:27,919 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, 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, 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] [2024-11-06 20:02:27,919 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 20:02:27,919 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:02:27,920 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:02:27,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1734192905, now seen corresponding path program 1 times [2024-11-06 20:02:27,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:02:27,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083702818] [2024-11-06 20:02:27,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:02:27,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:02:27,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:02:28,236 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 258 proven. 0 refuted. 0 times theorem prover too weak. 125 trivial. 0 not checked. [2024-11-06 20:02:28,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:02:28,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083702818] [2024-11-06 20:02:28,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083702818] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:02:28,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:02:28,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:02:28,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73765489] [2024-11-06 20:02:28,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:02:28,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:02:28,239 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:02:28,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:02:28,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:28,240 INFO L87 Difference]: Start difference. First operand 2636 states and 3207 transitions. Second operand has 3 states, 3 states have (on average 66.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:29,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:02:29,407 INFO L93 Difference]: Finished difference Result 6586 states and 8078 transitions. [2024-11-06 20:02:29,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:02:29,408 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 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 321 [2024-11-06 20:02:29,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:02:29,419 INFO L225 Difference]: With dead ends: 6586 [2024-11-06 20:02:29,420 INFO L226 Difference]: Without dead ends: 3294 [2024-11-06 20:02:29,423 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:29,424 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 358 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 811 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 1118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 811 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-06 20:02:29,424 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 156 Invalid, 1118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 811 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-06 20:02:29,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3294 states. [2024-11-06 20:02:29,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3294 to 3294. [2024-11-06 20:02:29,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3294 states, 3293 states have (on average 1.0652900091102337) internal successors, (3508), 3293 states have internal predecessors, (3508), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:29,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3294 states to 3294 states and 3508 transitions. [2024-11-06 20:02:29,478 INFO L78 Accepts]: Start accepts. Automaton has 3294 states and 3508 transitions. Word has length 321 [2024-11-06 20:02:29,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:02:29,479 INFO L471 AbstractCegarLoop]: Abstraction has 3294 states and 3508 transitions. [2024-11-06 20:02:29,479 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 66.0) internal successors, (198), 2 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:29,479 INFO L276 IsEmpty]: Start isEmpty. Operand 3294 states and 3508 transitions. [2024-11-06 20:02:29,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 488 [2024-11-06 20:02:29,488 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:02:29,489 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, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:02:29,489 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 20:02:29,489 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:02:29,490 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:02:29,490 INFO L85 PathProgramCache]: Analyzing trace with hash 30608101, now seen corresponding path program 1 times [2024-11-06 20:02:29,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:02:29,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895547276] [2024-11-06 20:02:29,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:02:29,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:02:29,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:02:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 795 backedges. 331 proven. 0 refuted. 0 times theorem prover too weak. 464 trivial. 0 not checked. [2024-11-06 20:02:29,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:02:29,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895547276] [2024-11-06 20:02:29,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895547276] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:02:29,996 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:02:29,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:02:29,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1508772740] [2024-11-06 20:02:29,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:02:29,997 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:02:29,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:02:29,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:02:29,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:29,998 INFO L87 Difference]: Start difference. First operand 3294 states and 3508 transitions. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 2 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:30,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:02:30,962 INFO L93 Difference]: Finished difference Result 9547 states and 10184 transitions. [2024-11-06 20:02:30,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:02:30,963 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 2 states have internal predecessors, (226), 0 states have call successors, (0), 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 487 [2024-11-06 20:02:30,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:02:30,980 INFO L225 Difference]: With dead ends: 9547 [2024-11-06 20:02:30,981 INFO L226 Difference]: Without dead ends: 6255 [2024-11-06 20:02:30,986 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:30,988 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 240 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 808 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 240 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 808 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 20:02:30,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [240 Valid, 70 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 808 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 20:02:30,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6255 states. [2024-11-06 20:02:31,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6255 to 6255. [2024-11-06 20:02:31,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6255 states, 6254 states have (on average 1.0606012152222577) internal successors, (6633), 6254 states have internal predecessors, (6633), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:31,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6255 states to 6255 states and 6633 transitions. [2024-11-06 20:02:31,089 INFO L78 Accepts]: Start accepts. Automaton has 6255 states and 6633 transitions. Word has length 487 [2024-11-06 20:02:31,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:02:31,091 INFO L471 AbstractCegarLoop]: Abstraction has 6255 states and 6633 transitions. [2024-11-06 20:02:31,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 2 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:31,091 INFO L276 IsEmpty]: Start isEmpty. Operand 6255 states and 6633 transitions. [2024-11-06 20:02:31,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 512 [2024-11-06 20:02:31,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:02:31,103 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, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:02:31,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 20:02:31,103 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:02:31,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:02:31,104 INFO L85 PathProgramCache]: Analyzing trace with hash -2027790642, now seen corresponding path program 1 times [2024-11-06 20:02:31,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:02:31,104 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542630474] [2024-11-06 20:02:31,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:02:31,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:02:31,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:02:31,938 INFO L134 CoverageAnalysis]: Checked inductivity of 461 backedges. 261 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-06 20:02:31,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:02:31,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542630474] [2024-11-06 20:02:31,938 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542630474] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:02:31,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:02:31,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:02:31,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26916614] [2024-11-06 20:02:31,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:02:31,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:02:31,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:02:31,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:02:31,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:02:31,942 INFO L87 Difference]: Start difference. First operand 6255 states and 6633 transitions. Second operand has 4 states, 4 states have (on average 90.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:32,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:02:32,920 INFO L93 Difference]: Finished difference Result 12179 states and 12932 transitions. [2024-11-06 20:02:32,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:02:32,920 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 90.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 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 511 [2024-11-06 20:02:32,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:02:32,938 INFO L225 Difference]: With dead ends: 12179 [2024-11-06 20:02:32,938 INFO L226 Difference]: Without dead ends: 6255 [2024-11-06 20:02:32,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 20:02:32,945 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 127 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 1161 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 20:02:32,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 126 Invalid, 1161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1161 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 20:02:32,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6255 states. [2024-11-06 20:02:33,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6255 to 6255. [2024-11-06 20:02:33,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6255 states, 6254 states have (on average 1.0604413175567637) internal successors, (6632), 6254 states have internal predecessors, (6632), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:33,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6255 states to 6255 states and 6632 transitions. [2024-11-06 20:02:33,082 INFO L78 Accepts]: Start accepts. Automaton has 6255 states and 6632 transitions. Word has length 511 [2024-11-06 20:02:33,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:02:33,083 INFO L471 AbstractCegarLoop]: Abstraction has 6255 states and 6632 transitions. [2024-11-06 20:02:33,083 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 90.0) internal successors, (360), 3 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:33,083 INFO L276 IsEmpty]: Start isEmpty. Operand 6255 states and 6632 transitions. [2024-11-06 20:02:33,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 627 [2024-11-06 20:02:33,094 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:02:33,095 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, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 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] [2024-11-06 20:02:33,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 20:02:33,096 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:02:33,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:02:33,096 INFO L85 PathProgramCache]: Analyzing trace with hash -767949954, now seen corresponding path program 1 times [2024-11-06 20:02:33,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:02:33,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168711944] [2024-11-06 20:02:33,096 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:02:33,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:02:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:02:33,627 INFO L134 CoverageAnalysis]: Checked inductivity of 849 backedges. 678 proven. 0 refuted. 0 times theorem prover too weak. 171 trivial. 0 not checked. [2024-11-06 20:02:33,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:02:33,627 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168711944] [2024-11-06 20:02:33,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168711944] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:02:33,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:02:33,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:02:33,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476387054] [2024-11-06 20:02:33,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:02:33,628 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:02:33,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:02:33,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:02:33,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:33,630 INFO L87 Difference]: Start difference. First operand 6255 states and 6632 transitions. Second operand has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:34,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:02:34,608 INFO L93 Difference]: Finished difference Result 15140 states and 16162 transitions. [2024-11-06 20:02:34,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:02:34,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 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 626 [2024-11-06 20:02:34,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:02:34,635 INFO L225 Difference]: With dead ends: 15140 [2024-11-06 20:02:34,635 INFO L226 Difference]: Without dead ends: 9216 [2024-11-06 20:02:34,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:34,642 INFO L432 NwaCegarLoop]: 420 mSDtfsCounter, 219 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 92 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 848 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 92 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-06 20:02:34,643 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 426 Invalid, 848 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [92 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-06 20:02:34,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9216 states. [2024-11-06 20:02:34,733 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9216 to 8887. [2024-11-06 20:02:34,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8887 states, 8886 states have (on average 1.0481656538374973) internal successors, (9314), 8886 states have internal predecessors, (9314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:34,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8887 states to 8887 states and 9314 transitions. [2024-11-06 20:02:34,761 INFO L78 Accepts]: Start accepts. Automaton has 8887 states and 9314 transitions. Word has length 626 [2024-11-06 20:02:34,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:02:34,762 INFO L471 AbstractCegarLoop]: Abstraction has 8887 states and 9314 transitions. [2024-11-06 20:02:34,763 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 152.33333333333334) internal successors, (457), 3 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:34,763 INFO L276 IsEmpty]: Start isEmpty. Operand 8887 states and 9314 transitions. [2024-11-06 20:02:34,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 690 [2024-11-06 20:02:34,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:02:34,774 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, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:02:34,774 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 20:02:34,774 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:02:34,775 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:02:34,775 INFO L85 PathProgramCache]: Analyzing trace with hash -1305146696, now seen corresponding path program 1 times [2024-11-06 20:02:34,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:02:34,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1705231286] [2024-11-06 20:02:34,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:02:34,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:02:34,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:02:35,156 INFO L134 CoverageAnalysis]: Checked inductivity of 941 backedges. 741 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-06 20:02:35,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:02:35,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1705231286] [2024-11-06 20:02:35,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1705231286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:02:35,157 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:02:35,157 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:02:35,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065209680] [2024-11-06 20:02:35,157 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:02:35,158 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:02:35,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:02:35,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:02:35,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:35,161 INFO L87 Difference]: Start difference. First operand 8887 states and 9314 transitions. Second operand has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:36,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:02:36,032 INFO L93 Difference]: Finished difference Result 20404 states and 21512 transitions. [2024-11-06 20:02:36,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:02:36,035 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 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 689 [2024-11-06 20:02:36,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:02:36,063 INFO L225 Difference]: With dead ends: 20404 [2024-11-06 20:02:36,064 INFO L226 Difference]: Without dead ends: 11848 [2024-11-06 20:02:36,072 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:36,073 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 186 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 765 mSolverCounterSat, 93 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 858 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 765 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 20:02:36,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 55 Invalid, 858 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 765 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 20:02:36,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2024-11-06 20:02:36,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 11848. [2024-11-06 20:02:36,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11848 states, 11847 states have (on average 1.0506457330969865) internal successors, (12447), 11847 states have internal predecessors, (12447), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:36,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 12447 transitions. [2024-11-06 20:02:36,212 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 12447 transitions. Word has length 689 [2024-11-06 20:02:36,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:02:36,212 INFO L471 AbstractCegarLoop]: Abstraction has 11848 states and 12447 transitions. [2024-11-06 20:02:36,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 179.33333333333334) internal successors, (538), 3 states have internal predecessors, (538), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:36,213 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 12447 transitions. [2024-11-06 20:02:36,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 980 [2024-11-06 20:02:36,230 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:02:36,231 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:02:36,231 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 20:02:36,231 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:02:36,232 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:02:36,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1785036573, now seen corresponding path program 1 times [2024-11-06 20:02:36,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:02:36,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167602392] [2024-11-06 20:02:36,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:02:36,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:02:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:02:37,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1959 backedges. 989 proven. 0 refuted. 0 times theorem prover too weak. 970 trivial. 0 not checked. [2024-11-06 20:02:37,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:02:37,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167602392] [2024-11-06 20:02:37,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167602392] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:02:37,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:02:37,253 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:02:37,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160160412] [2024-11-06 20:02:37,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:02:37,254 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:02:37,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:02:37,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:02:37,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:37,255 INFO L87 Difference]: Start difference. First operand 11848 states and 12447 transitions. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 2 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:38,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:02:38,057 INFO L93 Difference]: Finished difference Result 23694 states and 24898 transitions. [2024-11-06 20:02:38,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:02:38,058 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 2 states have internal predecessors, (393), 0 states have call successors, (0), 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 979 [2024-11-06 20:02:38,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:02:38,079 INFO L225 Difference]: With dead ends: 23694 [2024-11-06 20:02:38,079 INFO L226 Difference]: Without dead ends: 12177 [2024-11-06 20:02:38,090 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:38,090 INFO L432 NwaCegarLoop]: 97 mSDtfsCounter, 85 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 754 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 754 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 20:02:38,091 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 102 Invalid, 754 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 754 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 20:02:38,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12177 states. [2024-11-06 20:02:38,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12177 to 12177. [2024-11-06 20:02:38,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12177 states, 12176 states have (on average 1.0498521681997373) internal successors, (12783), 12176 states have internal predecessors, (12783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:38,214 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12177 states to 12177 states and 12783 transitions. [2024-11-06 20:02:38,215 INFO L78 Accepts]: Start accepts. Automaton has 12177 states and 12783 transitions. Word has length 979 [2024-11-06 20:02:38,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:02:38,216 INFO L471 AbstractCegarLoop]: Abstraction has 12177 states and 12783 transitions. [2024-11-06 20:02:38,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 2 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:38,217 INFO L276 IsEmpty]: Start isEmpty. Operand 12177 states and 12783 transitions. [2024-11-06 20:02:38,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 988 [2024-11-06 20:02:38,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:02:38,234 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 20:02:38,234 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 20:02:38,234 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:02:38,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:02:38,235 INFO L85 PathProgramCache]: Analyzing trace with hash 32102351, now seen corresponding path program 1 times [2024-11-06 20:02:38,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:02:38,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1644896050] [2024-11-06 20:02:38,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:02:38,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:02:38,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:02:38,803 INFO L134 CoverageAnalysis]: Checked inductivity of 1967 backedges. 1394 proven. 0 refuted. 0 times theorem prover too weak. 573 trivial. 0 not checked. [2024-11-06 20:02:38,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:02:38,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1644896050] [2024-11-06 20:02:38,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1644896050] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:02:38,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:02:38,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:02:38,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040426533] [2024-11-06 20:02:38,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:02:38,805 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:02:38,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:02:38,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:02:38,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:38,806 INFO L87 Difference]: Start difference. First operand 12177 states and 12783 transitions. Second operand has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:39,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:02:39,621 INFO L93 Difference]: Finished difference Result 26655 states and 28127 transitions. [2024-11-06 20:02:39,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:02:39,621 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 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 987 [2024-11-06 20:02:39,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:02:39,650 INFO L225 Difference]: With dead ends: 26655 [2024-11-06 20:02:39,650 INFO L226 Difference]: Without dead ends: 15138 [2024-11-06 20:02:39,663 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:39,664 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 192 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 772 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 20:02:39,664 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 434 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 772 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 20:02:39,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15138 states. [2024-11-06 20:02:39,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15138 to 14480. [2024-11-06 20:02:39,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14480 states, 14479 states have (on average 1.046135782857932) internal successors, (15147), 14479 states have internal predecessors, (15147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:39,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14480 states to 14480 states and 15147 transitions. [2024-11-06 20:02:39,874 INFO L78 Accepts]: Start accepts. Automaton has 14480 states and 15147 transitions. Word has length 987 [2024-11-06 20:02:39,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:02:39,876 INFO L471 AbstractCegarLoop]: Abstraction has 14480 states and 15147 transitions. [2024-11-06 20:02:39,876 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 176.66666666666666) internal successors, (530), 3 states have internal predecessors, (530), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:39,876 INFO L276 IsEmpty]: Start isEmpty. Operand 14480 states and 15147 transitions. [2024-11-06 20:02:39,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 998 [2024-11-06 20:02:39,892 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:02:39,893 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, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:02:39,893 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 20:02:39,893 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:02:39,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:02:39,895 INFO L85 PathProgramCache]: Analyzing trace with hash 2079842465, now seen corresponding path program 1 times [2024-11-06 20:02:39,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:02:39,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86220433] [2024-11-06 20:02:39,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:02:39,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:02:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:02:40,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1488 backedges. 187 proven. 0 refuted. 0 times theorem prover too weak. 1301 trivial. 0 not checked. [2024-11-06 20:02:40,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:02:40,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86220433] [2024-11-06 20:02:40,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86220433] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:02:40,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:02:40,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:02:40,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18896481] [2024-11-06 20:02:40,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:02:40,476 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:02:40,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:02:40,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:02:40,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:40,477 INFO L87 Difference]: Start difference. First operand 14480 states and 15147 transitions. Second operand has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:41,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:02:41,156 INFO L93 Difference]: Finished difference Result 28629 states and 29961 transitions. [2024-11-06 20:02:41,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:02:41,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 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 997 [2024-11-06 20:02:41,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:02:41,172 INFO L225 Difference]: With dead ends: 28629 [2024-11-06 20:02:41,172 INFO L226 Difference]: Without dead ends: 14480 [2024-11-06 20:02:41,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:41,185 INFO L432 NwaCegarLoop]: 408 mSDtfsCounter, 287 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 760 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 414 SdHoareTripleChecker+Invalid, 808 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 760 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:02:41,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [287 Valid, 414 Invalid, 808 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 760 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 20:02:41,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14480 states. [2024-11-06 20:02:41,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14480 to 13164. [2024-11-06 20:02:41,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13164 states, 13163 states have (on average 1.0420876699840462) internal successors, (13717), 13163 states have internal predecessors, (13717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:41,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13164 states to 13164 states and 13717 transitions. [2024-11-06 20:02:41,357 INFO L78 Accepts]: Start accepts. Automaton has 13164 states and 13717 transitions. Word has length 997 [2024-11-06 20:02:41,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:02:41,358 INFO L471 AbstractCegarLoop]: Abstraction has 13164 states and 13717 transitions. [2024-11-06 20:02:41,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:41,358 INFO L276 IsEmpty]: Start isEmpty. Operand 13164 states and 13717 transitions. [2024-11-06 20:02:41,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1013 [2024-11-06 20:02:41,372 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:02:41,372 INFO L215 NwaCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 20:02:41,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 20:02:41,373 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:02:41,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:02:41,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1151944673, now seen corresponding path program 1 times [2024-11-06 20:02:41,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:02:41,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787832530] [2024-11-06 20:02:41,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:02:41,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:02:41,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:02:41,929 INFO L134 CoverageAnalysis]: Checked inductivity of 2092 backedges. 281 proven. 0 refuted. 0 times theorem prover too weak. 1811 trivial. 0 not checked. [2024-11-06 20:02:41,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:02:41,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787832530] [2024-11-06 20:02:41,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1787832530] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:02:41,930 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:02:41,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:02:41,930 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805474071] [2024-11-06 20:02:41,930 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:02:41,931 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:02:41,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:02:41,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:02:41,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:41,933 INFO L87 Difference]: Start difference. First operand 13164 states and 13717 transitions. Second operand has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:42,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:02:42,603 INFO L93 Difference]: Finished difference Result 28958 states and 30198 transitions. [2024-11-06 20:02:42,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:02:42,603 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 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 1012 [2024-11-06 20:02:42,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:02:42,615 INFO L225 Difference]: With dead ends: 28958 [2024-11-06 20:02:42,615 INFO L226 Difference]: Without dead ends: 14151 [2024-11-06 20:02:42,623 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:42,623 INFO L432 NwaCegarLoop]: 406 mSDtfsCounter, 294 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 756 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 294 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 820 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 756 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:02:42,624 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [294 Valid, 412 Invalid, 820 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 756 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 20:02:42,631 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14151 states. [2024-11-06 20:02:42,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14151 to 13493. [2024-11-06 20:02:42,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13493 states, 13492 states have (on average 1.032537800177883) internal successors, (13931), 13492 states have internal predecessors, (13931), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:42,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13493 states to 13493 states and 13931 transitions. [2024-11-06 20:02:42,758 INFO L78 Accepts]: Start accepts. Automaton has 13493 states and 13931 transitions. Word has length 1012 [2024-11-06 20:02:42,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:02:42,759 INFO L471 AbstractCegarLoop]: Abstraction has 13493 states and 13931 transitions. [2024-11-06 20:02:42,759 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:42,759 INFO L276 IsEmpty]: Start isEmpty. Operand 13493 states and 13931 transitions. [2024-11-06 20:02:42,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1300 [2024-11-06 20:02:42,778 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:02:42,779 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:02:42,779 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 20:02:42,779 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:02:42,780 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:02:42,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1589997610, now seen corresponding path program 1 times [2024-11-06 20:02:42,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:02:42,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895519532] [2024-11-06 20:02:42,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:02:42,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:02:42,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:02:43,983 INFO L134 CoverageAnalysis]: Checked inductivity of 3101 backedges. 1757 proven. 0 refuted. 0 times theorem prover too weak. 1344 trivial. 0 not checked. [2024-11-06 20:02:43,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:02:43,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895519532] [2024-11-06 20:02:43,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895519532] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:02:43,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:02:43,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:02:43,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664039016] [2024-11-06 20:02:43,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:02:43,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:02:43,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:02:43,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:02:43,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:43,987 INFO L87 Difference]: Start difference. First operand 13493 states and 13931 transitions. Second operand has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:44,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:02:44,694 INFO L93 Difference]: Finished difference Result 26984 states and 27883 transitions. [2024-11-06 20:02:44,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:02:44,695 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 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 1299 [2024-11-06 20:02:44,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:02:44,707 INFO L225 Difference]: With dead ends: 26984 [2024-11-06 20:02:44,707 INFO L226 Difference]: Without dead ends: 13822 [2024-11-06 20:02:44,715 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:44,716 INFO L432 NwaCegarLoop]: 424 mSDtfsCounter, 224 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 747 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 747 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:02:44,716 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 430 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 747 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 20:02:44,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13822 states. [2024-11-06 20:02:44,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13822 to 13822. [2024-11-06 20:02:44,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13822 states, 13821 states have (on average 1.0304608928442225) internal successors, (14242), 13821 states have internal predecessors, (14242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:44,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13822 states to 13822 states and 14242 transitions. [2024-11-06 20:02:44,923 INFO L78 Accepts]: Start accepts. Automaton has 13822 states and 14242 transitions. Word has length 1299 [2024-11-06 20:02:44,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:02:44,925 INFO L471 AbstractCegarLoop]: Abstraction has 13822 states and 14242 transitions. [2024-11-06 20:02:44,925 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:44,925 INFO L276 IsEmpty]: Start isEmpty. Operand 13822 states and 14242 transitions. [2024-11-06 20:02:44,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1354 [2024-11-06 20:02:44,945 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:02:44,946 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-06 20:02:44,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 20:02:44,947 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:02:44,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:02:44,947 INFO L85 PathProgramCache]: Analyzing trace with hash -900598397, now seen corresponding path program 1 times [2024-11-06 20:02:44,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:02:44,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780465322] [2024-11-06 20:02:44,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:02:44,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:02:45,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:02:45,807 INFO L134 CoverageAnalysis]: Checked inductivity of 3157 backedges. 328 proven. 0 refuted. 0 times theorem prover too weak. 2829 trivial. 0 not checked. [2024-11-06 20:02:45,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:02:45,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780465322] [2024-11-06 20:02:45,808 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780465322] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:02:45,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:02:45,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-06 20:02:45,808 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317007156] [2024-11-06 20:02:45,808 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:02:45,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-06 20:02:45,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:02:45,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-06 20:02:45,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-06 20:02:45,810 INFO L87 Difference]: Start difference. First operand 13822 states and 14242 transitions. Second operand has 6 states, 6 states have (on average 57.166666666666664) internal successors, (343), 6 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:46,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:02:46,386 INFO L93 Difference]: Finished difference Result 26750 states and 27561 transitions. [2024-11-06 20:02:46,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-06 20:02:46,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 57.166666666666664) internal successors, (343), 6 states have internal predecessors, (343), 0 states have call successors, (0), 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 1353 [2024-11-06 20:02:46,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:02:46,400 INFO L225 Difference]: With dead ends: 26750 [2024-11-06 20:02:46,400 INFO L226 Difference]: Without dead ends: 13164 [2024-11-06 20:02:46,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2024-11-06 20:02:46,409 INFO L432 NwaCegarLoop]: 428 mSDtfsCounter, 33 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 942 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 946 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 942 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:02:46,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 451 Invalid, 946 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 942 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 20:02:46,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13164 states. [2024-11-06 20:02:46,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13164 to 11848. [2024-11-06 20:02:46,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11848 states, 11847 states have (on average 1.028699248754959) internal successors, (12187), 11847 states have internal predecessors, (12187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:46,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 12187 transitions. [2024-11-06 20:02:46,521 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 12187 transitions. Word has length 1353 [2024-11-06 20:02:46,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:02:46,522 INFO L471 AbstractCegarLoop]: Abstraction has 11848 states and 12187 transitions. [2024-11-06 20:02:46,522 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 57.166666666666664) internal successors, (343), 6 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:46,523 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 12187 transitions. [2024-11-06 20:02:46,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1403 [2024-11-06 20:02:46,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:02:46,586 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:02:46,586 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 20:02:46,586 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:02:46,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:02:46,587 INFO L85 PathProgramCache]: Analyzing trace with hash -875567692, now seen corresponding path program 1 times [2024-11-06 20:02:46,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:02:46,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [485232637] [2024-11-06 20:02:46,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:02:46,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:02:46,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:02:48,082 INFO L134 CoverageAnalysis]: Checked inductivity of 3397 backedges. 2411 proven. 0 refuted. 0 times theorem prover too weak. 986 trivial. 0 not checked. [2024-11-06 20:02:48,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:02:48,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [485232637] [2024-11-06 20:02:48,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [485232637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:02:48,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:02:48,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 20:02:48,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679752232] [2024-11-06 20:02:48,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:02:48,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:02:48,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:02:48,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:02:48,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:02:48,087 INFO L87 Difference]: Start difference. First operand 11848 states and 12187 transitions. Second operand has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:48,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:02:48,970 INFO L93 Difference]: Finished difference Result 23374 states and 24050 transitions. [2024-11-06 20:02:48,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 20:02:48,971 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 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 1402 [2024-11-06 20:02:48,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:02:48,980 INFO L225 Difference]: With dead ends: 23374 [2024-11-06 20:02:48,980 INFO L226 Difference]: Without dead ends: 11857 [2024-11-06 20:02:48,987 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 20:02:48,988 INFO L432 NwaCegarLoop]: 419 mSDtfsCounter, 217 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 1309 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 1332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-06 20:02:48,988 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 433 Invalid, 1332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1309 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-06 20:02:48,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11857 states. [2024-11-06 20:02:49,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11857 to 11848. [2024-11-06 20:02:49,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11848 states, 11847 states have (on average 1.0285304296446358) internal successors, (12185), 11847 states have internal predecessors, (12185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:49,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 12185 transitions. [2024-11-06 20:02:49,065 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 12185 transitions. Word has length 1402 [2024-11-06 20:02:49,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:02:49,066 INFO L471 AbstractCegarLoop]: Abstraction has 11848 states and 12185 transitions. [2024-11-06 20:02:49,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 193.0) internal successors, (772), 4 states have internal predecessors, (772), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:49,066 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 12185 transitions. [2024-11-06 20:02:49,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1606 [2024-11-06 20:02:49,081 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:02:49,082 INFO L215 NwaCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 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] [2024-11-06 20:02:49,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-06 20:02:49,082 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:02:49,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:02:49,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1742651865, now seen corresponding path program 1 times [2024-11-06 20:02:49,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:02:49,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557649372] [2024-11-06 20:02:49,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:02:49,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:02:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:02:50,596 INFO L134 CoverageAnalysis]: Checked inductivity of 4330 backedges. 1651 proven. 1262 refuted. 0 times theorem prover too weak. 1417 trivial. 0 not checked. [2024-11-06 20:02:50,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:02:50,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557649372] [2024-11-06 20:02:50,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557649372] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:02:50,597 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1142338367] [2024-11-06 20:02:50,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:02:50,598 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:02:50,598 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:02:50,600 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 20:02:50,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 20:02:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:02:51,045 INFO L255 TraceCheckSpWp]: Trace formula consists of 1838 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 20:02:51,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 20:02:52,147 INFO L134 CoverageAnalysis]: Checked inductivity of 4330 backedges. 2496 proven. 0 refuted. 0 times theorem prover too weak. 1834 trivial. 0 not checked. [2024-11-06 20:02:52,148 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 20:02:52,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1142338367] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:02:52,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 20:02:52,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2024-11-06 20:02:52,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284716838] [2024-11-06 20:02:52,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:02:52,151 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:02:52,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:02:52,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:02:52,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 20:02:52,152 INFO L87 Difference]: Start difference. First operand 11848 states and 12185 transitions. Second operand has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:52,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:02:52,781 INFO L93 Difference]: Finished difference Result 23365 states and 24037 transitions. [2024-11-06 20:02:52,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:02:52,782 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 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 1605 [2024-11-06 20:02:52,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:02:52,790 INFO L225 Difference]: With dead ends: 23365 [2024-11-06 20:02:52,790 INFO L226 Difference]: Without dead ends: 11848 [2024-11-06 20:02:52,795 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1609 GetRequests, 1605 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-06 20:02:52,796 INFO L432 NwaCegarLoop]: 371 mSDtfsCounter, 33 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 748 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 377 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:02:52,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 377 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 748 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 20:02:52,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2024-11-06 20:02:52,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 11848. [2024-11-06 20:02:52,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11848 states, 11847 states have (on average 1.0268422385414029) internal successors, (12165), 11847 states have internal predecessors, (12165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 12165 transitions. [2024-11-06 20:02:52,864 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 12165 transitions. Word has length 1605 [2024-11-06 20:02:52,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:02:52,864 INFO L471 AbstractCegarLoop]: Abstraction has 11848 states and 12165 transitions. [2024-11-06 20:02:52,865 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 194.33333333333334) internal successors, (583), 3 states have internal predecessors, (583), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:52,865 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 12165 transitions. [2024-11-06 20:02:52,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1614 [2024-11-06 20:02:52,878 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:02:52,879 INFO L215 NwaCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:02:52,893 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 20:02:53,079 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,SelfDestructingSolverStorable16 [2024-11-06 20:02:53,080 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:02:53,080 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:02:53,080 INFO L85 PathProgramCache]: Analyzing trace with hash 405529776, now seen corresponding path program 1 times [2024-11-06 20:02:53,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:02:53,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963529337] [2024-11-06 20:02:53,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:02:53,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:02:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:02:53,747 INFO L134 CoverageAnalysis]: Checked inductivity of 5058 backedges. 1103 proven. 0 refuted. 0 times theorem prover too weak. 3955 trivial. 0 not checked. [2024-11-06 20:02:53,747 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:02:53,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963529337] [2024-11-06 20:02:53,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963529337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:02:53,747 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:02:53,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:02:53,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455238905] [2024-11-06 20:02:53,747 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:02:53,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:02:53,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:02:53,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:02:53,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:53,749 INFO L87 Difference]: Start difference. First operand 11848 states and 12165 transitions. Second operand has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:54,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:02:54,410 INFO L93 Difference]: Finished difference Result 23365 states and 23997 transitions. [2024-11-06 20:02:54,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:02:54,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 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 1613 [2024-11-06 20:02:54,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:02:54,419 INFO L225 Difference]: With dead ends: 23365 [2024-11-06 20:02:54,419 INFO L226 Difference]: Without dead ends: 11848 [2024-11-06 20:02:54,425 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:54,425 INFO L432 NwaCegarLoop]: 415 mSDtfsCounter, 242 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 746 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 242 SdHoareTripleChecker+Valid, 421 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:02:54,425 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [242 Valid, 421 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 746 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 20:02:54,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11848 states. [2024-11-06 20:02:54,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11848 to 11848. [2024-11-06 20:02:54,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11848 states, 11847 states have (on average 1.0197518359078248) internal successors, (12081), 11847 states have internal predecessors, (12081), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:54,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11848 states to 11848 states and 12081 transitions. [2024-11-06 20:02:54,487 INFO L78 Accepts]: Start accepts. Automaton has 11848 states and 12081 transitions. Word has length 1613 [2024-11-06 20:02:54,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:02:54,488 INFO L471 AbstractCegarLoop]: Abstraction has 11848 states and 12081 transitions. [2024-11-06 20:02:54,488 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 131.0) internal successors, (393), 3 states have internal predecessors, (393), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:54,488 INFO L276 IsEmpty]: Start isEmpty. Operand 11848 states and 12081 transitions. [2024-11-06 20:02:54,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 1775 [2024-11-06 20:02:54,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:02:54,504 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 11, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 7, 7, 7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:02:54,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-06 20:02:54,504 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:02:54,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:02:54,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1979848613, now seen corresponding path program 1 times [2024-11-06 20:02:54,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:02:54,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987793904] [2024-11-06 20:02:54,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:02:54,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:02:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:02:55,772 INFO L134 CoverageAnalysis]: Checked inductivity of 6280 backedges. 469 proven. 0 refuted. 0 times theorem prover too weak. 5811 trivial. 0 not checked. [2024-11-06 20:02:55,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:02:55,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987793904] [2024-11-06 20:02:55,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987793904] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:02:55,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:02:55,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:02:55,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030029501] [2024-11-06 20:02:55,773 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:02:55,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:02:55,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:02:55,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:02:55,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:55,774 INFO L87 Difference]: Start difference. First operand 11848 states and 12081 transitions. Second operand has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:56,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:02:56,446 INFO L93 Difference]: Finished difference Result 28956 states and 29541 transitions. [2024-11-06 20:02:56,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:02:56,446 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 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 1774 [2024-11-06 20:02:56,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:02:56,447 INFO L225 Difference]: With dead ends: 28956 [2024-11-06 20:02:56,447 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 20:02:56,456 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:02:56,456 INFO L432 NwaCegarLoop]: 392 mSDtfsCounter, 285 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 796 mSolverCounterSat, 50 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 285 SdHoareTripleChecker+Valid, 397 SdHoareTripleChecker+Invalid, 846 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 50 IncrementalHoareTripleChecker+Valid, 796 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 20:02:56,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [285 Valid, 397 Invalid, 846 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [50 Valid, 796 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 20:02:56,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 20:02:56,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 20:02:56,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:56,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 20:02:56,457 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 1774 [2024-11-06 20:02:56,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:02:56,458 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 20:02:56,458 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 102.33333333333333) internal successors, (307), 3 states have internal predecessors, (307), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:02:56,458 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 20:02:56,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 20:02:56,460 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 20:02:56,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-06 20:02:56,463 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:02:56,464 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 20:02:57,154 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 20:02:57,173 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 08:02:57 BoogieIcfgContainer [2024-11-06 20:02:57,173 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 20:02:57,174 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 20:02:57,174 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 20:02:57,174 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 20:02:57,175 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:02:20" (3/4) ... [2024-11-06 20:02:57,177 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 20:02:57,207 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 12 nodes and edges [2024-11-06 20:02:57,210 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 20:02:57,212 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 20:02:57,213 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 20:02:57,384 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 20:02:57,385 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 20:02:57,385 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 20:02:57,386 INFO L158 Benchmark]: Toolchain (without parser) took 39745.69ms. Allocated memory was 142.6MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 112.1MB in the beginning and 1.1GB in the end (delta: -1.0GB). Peak memory consumption was 312.3MB. Max. memory is 16.1GB. [2024-11-06 20:02:57,386 INFO L158 Benchmark]: CDTParser took 0.66ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 20:02:57,386 INFO L158 Benchmark]: CACSL2BoogieTranslator took 673.24ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 54.3MB in the end (delta: 57.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. [2024-11-06 20:02:57,386 INFO L158 Benchmark]: Boogie Procedure Inliner took 164.21ms. Allocated memory is still 142.6MB. Free memory was 54.3MB in the beginning and 94.7MB in the end (delta: -40.4MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. [2024-11-06 20:02:57,387 INFO L158 Benchmark]: Boogie Preprocessor took 228.18ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 61.1MB in the end (delta: 33.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-06 20:02:57,388 INFO L158 Benchmark]: RCFGBuilder took 2236.88ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 61.1MB in the beginning and 66.5MB in the end (delta: -5.4MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. [2024-11-06 20:02:57,388 INFO L158 Benchmark]: TraceAbstraction took 36224.07ms. Allocated memory was 184.5MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 66.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 884.6MB. Max. memory is 16.1GB. [2024-11-06 20:02:57,390 INFO L158 Benchmark]: Witness Printer took 211.29ms. Allocated memory is still 1.5GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 24.9MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-06 20:02:57,391 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.66ms. Allocated memory is still 117.4MB. Free memory is still 81.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 673.24ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 54.3MB in the end (delta: 57.6MB). Peak memory consumption was 50.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 164.21ms. Allocated memory is still 142.6MB. Free memory was 54.3MB in the beginning and 94.7MB in the end (delta: -40.4MB). Peak memory consumption was 28.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 228.18ms. Allocated memory is still 142.6MB. Free memory was 94.7MB in the beginning and 61.1MB in the end (delta: 33.6MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * RCFGBuilder took 2236.88ms. Allocated memory was 142.6MB in the beginning and 184.5MB in the end (delta: 41.9MB). Free memory was 61.1MB in the beginning and 66.5MB in the end (delta: -5.4MB). Peak memory consumption was 56.1MB. Max. memory is 16.1GB. * TraceAbstraction took 36224.07ms. Allocated memory was 184.5MB in the beginning and 1.5GB in the end (delta: 1.3GB). Free memory was 66.5MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 884.6MB. Max. memory is 16.1GB. * Witness Printer took 211.29ms. Allocated memory is still 1.5GB. Free memory was 1.2GB in the beginning and 1.1GB in the end (delta: 24.9MB). 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: 164]: 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, 396 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 35.5s, OverallIterations: 19, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.3s, AutomataDifference: 18.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4295 SdHoareTripleChecker+Valid, 16.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4295 mSDsluCounter, 5752 SdHoareTripleChecker+Invalid, 13.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 146 mSDsCounter, 2189 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16169 IncrementalHoareTripleChecker+Invalid, 18358 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2189 mSolverCounterUnsat, 5606 mSDtfsCounter, 16169 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1664 GetRequests, 1635 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=14480occurred in iteration=11, InterpolantAutomatonStates: 63, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.9s AutomataMinimizationTime, 19 MinimizatonAttempts, 4286 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 1.1s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 17686 NumberOfCodeBlocks, 17686 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 17666 ConstructedInterpolants, 0 QuantifiedInterpolants, 36971 SizeOfPredicates, 0 NumberOfNonLiveVariables, 1838 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 20 InterpolantComputations, 19 PerfectInterpolantSequences, 39464/40726 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: 1783]: Loop Invariant Derived loop invariant: (((((((((((((((((((a16 == 9) && (7 == a12)) || ((a12 == 9) && (a16 == 9))) || ((a16 <= 8) && (a12 == 9))) || ((a12 == 6) && (a16 <= 11))) || ((a16 == 9) && (a15 <= 3))) || (((a16 <= 8) && (a12 == 8)) && (((long long) a18 + 156) <= 0))) || ((a15 <= 3) && (7 == a12))) || ((a15 <= 3) && (a12 == 6))) || ((a16 == 9) && (a12 == 8))) || (((a12 <= 5) && (a16 <= 11)) && (4 <= a15))) || ((a12 == 9) && (a15 <= 3))) || ((a16 <= 8) && (a15 <= 3))) || (((a16 <= 8) && (7 <= a18)) && (a12 == 8))) || ((a12 == 8) && (a15 == 3))) || (((a12 <= 5) && (7 <= a18)) && (a16 <= 11))) || ((a16 <= 8) && (7 == a12))) || (((a15 <= 3) && (a12 == 8)) && (11 <= a16))) || (((a12 <= 5) && (a15 <= 3)) && (11 <= a16))) RESULT: Ultimate proved your program to be correct! [2024-11-06 20:02:57,421 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE