./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem19_label07.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/eca-rers2012/Problem19_label07.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf', '--cacsl2boogietranslator.entry.function', 'main', '--witnessprinter.witness.directory', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux', '--witnessprinter.witness.filename', 'witness', '--witnessprinter.write.witness.besides.input.file', 'false', '--witnessprinter.graph.data.specification', 'CHECK( init(main()), LTL(G ! call(reach_error())) )\n\n', '--witnessprinter.graph.data.producer', 'Automizer', '--witnessprinter.graph.data.architecture', '32bit', '--witnessprinter.graph.data.programhash', '2043c9d5e1443059c92e4f987d5fa7d95d911c8e5885f3f6e6b42c76d53791e0'] 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/Problem19_label07.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2043c9d5e1443059c92e4f987d5fa7d95d911c8e5885f3f6e6b42c76d53791e0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 20:15:58,963 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 20:15:59,021 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:15:59,025 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 20:15:59,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 20:15:59,047 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 20:15:59,047 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 20:15:59,047 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 20:15:59,048 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 20:15:59,048 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 20:15:59,048 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 20:15:59,048 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 20:15:59,048 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 20:15:59,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 20:15:59,050 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 20:15:59,050 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 20:15:59,050 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 20:15:59,050 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 20:15:59,051 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 20:15:59,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 20:15:59,051 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 20:15:59,051 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 20:15:59,051 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 20:15:59,051 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 20:15:59,051 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 20:15:59,051 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 20:15:59,051 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 20:15:59,051 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 20:15:59,051 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 20:15:59,051 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 20:15:59,051 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 20:15:59,051 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 20:15:59,051 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:15:59,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 20:15:59,051 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 20:15:59,051 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 20:15:59,052 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 20:15:59,052 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 20:15:59,052 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 20:15:59,052 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 20:15:59,052 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 20:15:59,052 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 20:15:59,052 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 -> 2043c9d5e1443059c92e4f987d5fa7d95d911c8e5885f3f6e6b42c76d53791e0 [2024-11-06 20:15:59,272 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 20:15:59,277 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 20:15:59,279 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 20:15:59,279 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 20:15:59,279 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 20:15:59,280 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem19_label07.c [2024-11-06 20:16:00,367 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 20:16:00,896 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 20:16:00,897 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem19_label07.c [2024-11-06 20:16:00,930 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/556917a65/6929fdce5295492dbfc61096a17bd181/FLAG54e92b169 [2024-11-06 20:16:01,443 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/556917a65/6929fdce5295492dbfc61096a17bd181 [2024-11-06 20:16:01,444 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 20:16:01,445 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 20:16:01,446 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 20:16:01,447 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 20:16:01,451 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 20:16:01,451 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:16:01" (1/1) ... [2024-11-06 20:16:01,452 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fb843b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:16:01, skipping insertion in model container [2024-11-06 20:16:01,452 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 08:16:01" (1/1) ... [2024-11-06 20:16:01,630 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 20:16:01,858 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/Problem19_label07.c[7920,7933] [2024-11-06 20:16:02,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:16:02,666 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 20:16:02,679 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/Problem19_label07.c[7920,7933] [2024-11-06 20:16:03,112 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 20:16:03,135 INFO L204 MainTranslator]: Completed translation [2024-11-06 20:16:03,136 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:16:03 WrapperNode [2024-11-06 20:16:03,136 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 20:16:03,137 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 20:16:03,137 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 20:16:03,138 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 20:16:03,141 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:16:03" (1/1) ... [2024-11-06 20:16:03,235 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:16:03" (1/1) ... [2024-11-06 20:16:03,814 INFO L138 Inliner]: procedures = 19, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 9431 [2024-11-06 20:16:03,814 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 20:16:03,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 20:16:03,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 20:16:03,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 20:16:03,821 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:16:03" (1/1) ... [2024-11-06 20:16:03,821 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:16:03" (1/1) ... [2024-11-06 20:16:03,895 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:16:03" (1/1) ... [2024-11-06 20:16:04,162 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:16:04,166 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:16:03" (1/1) ... [2024-11-06 20:16:04,166 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:16:03" (1/1) ... [2024-11-06 20:16:04,553 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:16:03" (1/1) ... [2024-11-06 20:16:04,630 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:16:03" (1/1) ... [2024-11-06 20:16:04,698 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:16:03" (1/1) ... [2024-11-06 20:16:04,746 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:16:03" (1/1) ... [2024-11-06 20:16:04,855 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 20:16:04,856 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 20:16:04,856 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 20:16:04,857 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 20:16:04,857 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:16:03" (1/1) ... [2024-11-06 20:16:04,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 20:16:04,868 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:16:04,877 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:16:04,882 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:16:04,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 20:16:04,894 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 20:16:04,894 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 20:16:04,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 20:16:04,945 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 20:16:04,946 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 20:16:11,823 INFO L? ?]: Removed 1320 outVars from TransFormulas that were not future-live. [2024-11-06 20:16:11,823 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 20:16:11,865 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 20:16:11,865 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 20:16:11,866 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:16:11 BoogieIcfgContainer [2024-11-06 20:16:11,866 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 20:16:11,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 20:16:11,868 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 20:16:11,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 20:16:11,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 08:16:01" (1/3) ... [2024-11-06 20:16:11,871 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b53723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:16:11, skipping insertion in model container [2024-11-06 20:16:11,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 08:16:03" (2/3) ... [2024-11-06 20:16:11,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79b53723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 08:16:11, skipping insertion in model container [2024-11-06 20:16:11,872 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 08:16:11" (3/3) ... [2024-11-06 20:16:11,873 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem19_label07.c [2024-11-06 20:16:11,882 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 20:16:11,882 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 20:16:11,940 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 20:16:11,947 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;@1aecc52f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 20:16:11,948 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 20:16:11,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 1748 states, 1746 states have (on average 1.8699885452462772) internal successors, (3265), 1747 states have internal predecessors, (3265), 0 states have call successors, (0), 0 states have 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:16:11,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2024-11-06 20:16:11,958 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:16:11,959 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:16:11,959 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:16:11,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:16:11,962 INFO L85 PathProgramCache]: Analyzing trace with hash 1818267785, now seen corresponding path program 1 times [2024-11-06 20:16:11,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:16:11,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219483144] [2024-11-06 20:16:11,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:16:11,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:16:12,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:16:12,356 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:16:12,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:16:12,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219483144] [2024-11-06 20:16:12,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219483144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:16:12,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:16:12,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:16:12,360 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1724919664] [2024-11-06 20:16:12,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:16:12,363 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:16:12,363 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:16:12,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:16:12,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:16:12,379 INFO L87 Difference]: Start difference. First operand has 1748 states, 1746 states have (on average 1.8699885452462772) internal successors, (3265), 1747 states have internal predecessors, (3265), 0 states have call successors, (0), 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 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have 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:16:23,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:16:23,133 INFO L93 Difference]: Finished difference Result 6284 states and 12039 transitions. [2024-11-06 20:16:23,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:16:23,135 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 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 61 [2024-11-06 20:16:23,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:16:23,163 INFO L225 Difference]: With dead ends: 6284 [2024-11-06 20:16:23,163 INFO L226 Difference]: Without dead ends: 4467 [2024-11-06 20:16:23,168 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:16:23,170 INFO L432 NwaCegarLoop]: 1812 mSDtfsCounter, 4219 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 10828 mSolverCounterSat, 2355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4219 SdHoareTripleChecker+Valid, 2090 SdHoareTripleChecker+Invalid, 13183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2355 IncrementalHoareTripleChecker+Valid, 10828 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.5s IncrementalHoareTripleChecker+Time [2024-11-06 20:16:23,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4219 Valid, 2090 Invalid, 13183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2355 Valid, 10828 Invalid, 0 Unknown, 0 Unchecked, 10.5s Time] [2024-11-06 20:16:23,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4467 states. [2024-11-06 20:16:23,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4467 to 4465. [2024-11-06 20:16:23,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4465 states, 4464 states have (on average 1.564516129032258) internal successors, (6984), 4464 states have internal predecessors, (6984), 0 states have call successors, (0), 0 states have 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:16:23,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4465 states to 4465 states and 6984 transitions. [2024-11-06 20:16:23,317 INFO L78 Accepts]: Start accepts. Automaton has 4465 states and 6984 transitions. Word has length 61 [2024-11-06 20:16:23,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:16:23,318 INFO L471 AbstractCegarLoop]: Abstraction has 4465 states and 6984 transitions. [2024-11-06 20:16:23,318 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 3 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have 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:16:23,318 INFO L276 IsEmpty]: Start isEmpty. Operand 4465 states and 6984 transitions. [2024-11-06 20:16:23,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2024-11-06 20:16:23,323 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:16:23,323 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:16:23,323 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 20:16:23,324 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:16:23,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:16:23,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1440280171, now seen corresponding path program 1 times [2024-11-06 20:16:23,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:16:23,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1009665070] [2024-11-06 20:16:23,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:16:23,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:16:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:16:24,277 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:16:24,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:16:24,283 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1009665070] [2024-11-06 20:16:24,283 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1009665070] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:16:24,283 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:16:24,283 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:16:24,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1570093683] [2024-11-06 20:16:24,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:16:24,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:16:24,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:16:24,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:16:24,287 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:16:24,287 INFO L87 Difference]: Start difference. First operand 4465 states and 6984 transitions. Second operand has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:16:33,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:16:33,133 INFO L93 Difference]: Finished difference Result 11706 states and 20175 transitions. [2024-11-06 20:16:33,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:16:33,134 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 268 [2024-11-06 20:16:33,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:16:33,156 INFO L225 Difference]: With dead ends: 11706 [2024-11-06 20:16:33,157 INFO L226 Difference]: Without dead ends: 8608 [2024-11-06 20:16:33,160 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:16:33,161 INFO L432 NwaCegarLoop]: 1803 mSDtfsCounter, 3756 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 9455 mSolverCounterSat, 1337 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3756 SdHoareTripleChecker+Valid, 2157 SdHoareTripleChecker+Invalid, 10792 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1337 IncrementalHoareTripleChecker+Valid, 9455 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2024-11-06 20:16:33,161 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3756 Valid, 2157 Invalid, 10792 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1337 Valid, 9455 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2024-11-06 20:16:33,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8608 states. [2024-11-06 20:16:33,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8608 to 8594. [2024-11-06 20:16:33,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8594 states, 8593 states have (on average 1.3480740137321074) internal successors, (11584), 8593 states have internal predecessors, (11584), 0 states have call successors, (0), 0 states have 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:16:33,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8594 states to 8594 states and 11584 transitions. [2024-11-06 20:16:33,271 INFO L78 Accepts]: Start accepts. Automaton has 8594 states and 11584 transitions. Word has length 268 [2024-11-06 20:16:33,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:16:33,272 INFO L471 AbstractCegarLoop]: Abstraction has 8594 states and 11584 transitions. [2024-11-06 20:16:33,272 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 67.0) internal successors, (268), 3 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 20:16:33,272 INFO L276 IsEmpty]: Start isEmpty. Operand 8594 states and 11584 transitions. [2024-11-06 20:16:33,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 297 [2024-11-06 20:16:33,275 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:16:33,275 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 20:16:33,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 20:16:33,275 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:16:33,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:16:33,276 INFO L85 PathProgramCache]: Analyzing trace with hash -862057391, now seen corresponding path program 1 times [2024-11-06 20:16:33,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:16:33,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711531828] [2024-11-06 20:16:33,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:16:33,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:16:33,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:16:33,927 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 58 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:16:33,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:16:33,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711531828] [2024-11-06 20:16:33,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711531828] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:16:33,927 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:16:33,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:16:33,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381502320] [2024-11-06 20:16:33,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:16:33,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:16:33,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:16:33,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:16:33,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:16:33,928 INFO L87 Difference]: Start difference. First operand 8594 states and 11584 transitions. Second operand has 4 states, 4 states have (on average 74.0) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have 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:16:39,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:16:39,099 INFO L93 Difference]: Finished difference Result 14487 states and 20449 transitions. [2024-11-06 20:16:39,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:16:39,099 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 74.0) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 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 296 [2024-11-06 20:16:39,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:16:39,116 INFO L225 Difference]: With dead ends: 14487 [2024-11-06 20:16:39,116 INFO L226 Difference]: Without dead ends: 8594 [2024-11-06 20:16:39,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:16:39,121 INFO L432 NwaCegarLoop]: 1775 mSDtfsCounter, 1151 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 5715 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1151 SdHoareTripleChecker+Valid, 1954 SdHoareTripleChecker+Invalid, 5723 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 5715 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2024-11-06 20:16:39,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1151 Valid, 1954 Invalid, 5723 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 5715 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2024-11-06 20:16:39,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8594 states. [2024-11-06 20:16:39,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8594 to 8594. [2024-11-06 20:16:39,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8594 states, 8593 states have (on average 1.3465611544280227) internal successors, (11571), 8593 states have internal predecessors, (11571), 0 states have call successors, (0), 0 states have 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:16:39,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8594 states to 8594 states and 11571 transitions. [2024-11-06 20:16:39,216 INFO L78 Accepts]: Start accepts. Automaton has 8594 states and 11571 transitions. Word has length 296 [2024-11-06 20:16:39,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:16:39,217 INFO L471 AbstractCegarLoop]: Abstraction has 8594 states and 11571 transitions. [2024-11-06 20:16:39,217 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 74.0) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have 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:16:39,220 INFO L276 IsEmpty]: Start isEmpty. Operand 8594 states and 11571 transitions. [2024-11-06 20:16:39,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 618 [2024-11-06 20:16:39,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:16:39,226 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:39,227 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 20:16:39,227 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:16:39,228 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:16:39,229 INFO L85 PathProgramCache]: Analyzing trace with hash -1175205269, now seen corresponding path program 1 times [2024-11-06 20:16:39,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:16:39,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769884091] [2024-11-06 20:16:39,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:16:39,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:16:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:16:39,679 INFO L134 CoverageAnalysis]: Checked inductivity of 185 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2024-11-06 20:16:39,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:16:39,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769884091] [2024-11-06 20:16:39,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769884091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:16:39,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:16:39,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:16:39,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197016388] [2024-11-06 20:16:39,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:16:39,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:16:39,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:16:39,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:16:39,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:16:39,683 INFO L87 Difference]: Start difference. First operand 8594 states and 11571 transitions. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 2 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have 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:16:45,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:16:45,234 INFO L93 Difference]: Finished difference Result 20123 states and 28981 transitions. [2024-11-06 20:16:45,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:16:45,234 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 2 states have internal predecessors, (550), 0 states have call successors, (0), 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 617 [2024-11-06 20:16:45,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:16:45,273 INFO L225 Difference]: With dead ends: 20123 [2024-11-06 20:16:45,273 INFO L226 Difference]: Without dead ends: 14261 [2024-11-06 20:16:45,279 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:16:45,280 INFO L432 NwaCegarLoop]: 1338 mSDtfsCounter, 1356 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 4196 mSolverCounterSat, 1430 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1356 SdHoareTripleChecker+Valid, 1610 SdHoareTripleChecker+Invalid, 5626 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1430 IncrementalHoareTripleChecker+Valid, 4196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-06 20:16:45,280 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1356 Valid, 1610 Invalid, 5626 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1430 Valid, 4196 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-06 20:16:45,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14261 states. [2024-11-06 20:16:45,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14261 to 14244. [2024-11-06 20:16:45,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14244 states, 14243 states have (on average 1.2722038896299936) internal successors, (18120), 14243 states have internal predecessors, (18120), 0 states have call successors, (0), 0 states have 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:16:45,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14244 states to 14244 states and 18120 transitions. [2024-11-06 20:16:45,446 INFO L78 Accepts]: Start accepts. Automaton has 14244 states and 18120 transitions. Word has length 617 [2024-11-06 20:16:45,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:16:45,448 INFO L471 AbstractCegarLoop]: Abstraction has 14244 states and 18120 transitions. [2024-11-06 20:16:45,449 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 2 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have 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:16:45,449 INFO L276 IsEmpty]: Start isEmpty. Operand 14244 states and 18120 transitions. [2024-11-06 20:16:45,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 623 [2024-11-06 20:16:45,460 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:16:45,461 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:45,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 20:16:45,462 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:16:45,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:16:45,462 INFO L85 PathProgramCache]: Analyzing trace with hash 848910986, now seen corresponding path program 1 times [2024-11-06 20:16:45,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:16:45,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180422985] [2024-11-06 20:16:45,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:16:45,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:16:45,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:16:45,945 INFO L134 CoverageAnalysis]: Checked inductivity of 190 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 73 trivial. 0 not checked. [2024-11-06 20:16:45,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:16:45,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180422985] [2024-11-06 20:16:45,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [180422985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:16:45,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:16:45,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:16:45,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90496174] [2024-11-06 20:16:45,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:16:45,947 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:16:45,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:16:45,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:16:45,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:16:45,948 INFO L87 Difference]: Start difference. First operand 14244 states and 18120 transitions. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 2 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have 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:16:50,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:16:50,896 INFO L93 Difference]: Finished difference Result 28511 states and 37629 transitions. [2024-11-06 20:16:50,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:16:50,896 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 2 states have internal predecessors, (550), 0 states have call successors, (0), 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 622 [2024-11-06 20:16:50,897 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:16:50,923 INFO L225 Difference]: With dead ends: 28511 [2024-11-06 20:16:50,923 INFO L226 Difference]: Without dead ends: 16999 [2024-11-06 20:16:50,930 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:16:50,932 INFO L432 NwaCegarLoop]: 706 mSDtfsCounter, 1387 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 3927 mSolverCounterSat, 2123 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1387 SdHoareTripleChecker+Valid, 757 SdHoareTripleChecker+Invalid, 6050 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2123 IncrementalHoareTripleChecker+Valid, 3927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-06 20:16:50,932 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1387 Valid, 757 Invalid, 6050 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2123 Valid, 3927 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-06 20:16:50,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16999 states. [2024-11-06 20:16:51,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16999 to 16985. [2024-11-06 20:16:51,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16985 states, 16984 states have (on average 1.2707253886010363) internal successors, (21582), 16984 states have internal predecessors, (21582), 0 states have call successors, (0), 0 states have 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:16:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16985 states to 16985 states and 21582 transitions. [2024-11-06 20:16:51,067 INFO L78 Accepts]: Start accepts. Automaton has 16985 states and 21582 transitions. Word has length 622 [2024-11-06 20:16:51,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:16:51,067 INFO L471 AbstractCegarLoop]: Abstraction has 16985 states and 21582 transitions. [2024-11-06 20:16:51,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 2 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have 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:16:51,068 INFO L276 IsEmpty]: Start isEmpty. Operand 16985 states and 21582 transitions. [2024-11-06 20:16:51,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 626 [2024-11-06 20:16:51,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:16:51,071 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:51,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 20:16:51,072 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:16:51,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:16:51,072 INFO L85 PathProgramCache]: Analyzing trace with hash -1288083713, now seen corresponding path program 1 times [2024-11-06 20:16:51,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:16:51,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216552430] [2024-11-06 20:16:51,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:16:51,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:16:51,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:16:51,508 INFO L134 CoverageAnalysis]: Checked inductivity of 193 backedges. 117 proven. 0 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2024-11-06 20:16:51,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:16:51,512 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216552430] [2024-11-06 20:16:51,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1216552430] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:16:51,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:16:51,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 20:16:51,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67932172] [2024-11-06 20:16:51,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:16:51,513 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:16:51,513 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:16:51,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:16:51,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:16:51,514 INFO L87 Difference]: Start difference. First operand 16985 states and 21582 transitions. Second operand has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 2 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have 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:16:57,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:16:57,114 INFO L93 Difference]: Finished difference Result 43710 states and 57265 transitions. [2024-11-06 20:16:57,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:16:57,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 2 states have internal predecessors, (550), 0 states have call successors, (0), 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 625 [2024-11-06 20:16:57,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:16:57,157 INFO L225 Difference]: With dead ends: 43710 [2024-11-06 20:16:57,158 INFO L226 Difference]: Without dead ends: 29457 [2024-11-06 20:16:57,168 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:16:57,168 INFO L432 NwaCegarLoop]: 715 mSDtfsCounter, 2112 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 5114 mSolverCounterSat, 434 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2112 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 5548 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 434 IncrementalHoareTripleChecker+Valid, 5114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-06 20:16:57,168 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2112 Valid, 985 Invalid, 5548 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [434 Valid, 5114 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2024-11-06 20:16:57,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29457 states. [2024-11-06 20:16:57,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29457 to 29454. [2024-11-06 20:16:57,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29454 states, 29453 states have (on average 1.255593657691916) internal successors, (36981), 29453 states have internal predecessors, (36981), 0 states have call successors, (0), 0 states have 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:16:57,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29454 states to 29454 states and 36981 transitions. [2024-11-06 20:16:57,500 INFO L78 Accepts]: Start accepts. Automaton has 29454 states and 36981 transitions. Word has length 625 [2024-11-06 20:16:57,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:16:57,501 INFO L471 AbstractCegarLoop]: Abstraction has 29454 states and 36981 transitions. [2024-11-06 20:16:57,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 183.33333333333334) internal successors, (550), 2 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have 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:16:57,502 INFO L276 IsEmpty]: Start isEmpty. Operand 29454 states and 36981 transitions. [2024-11-06 20:16:57,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 653 [2024-11-06 20:16:57,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:16:57,505 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:16:57,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 20:16:57,505 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:16:57,506 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:16:57,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1902908419, now seen corresponding path program 1 times [2024-11-06 20:16:57,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:16:57,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [587043281] [2024-11-06 20:16:57,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:16:57,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:16:57,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:16:58,344 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 220 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 20:16:58,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:16:58,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [587043281] [2024-11-06 20:16:58,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [587043281] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:16:58,349 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:16:58,349 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 20:16:58,349 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664401138] [2024-11-06 20:16:58,349 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:16:58,350 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 20:16:58,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:16:58,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 20:16:58,355 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-06 20:16:58,355 INFO L87 Difference]: Start difference. First operand 29454 states and 36981 transitions. Second operand has 5 states, 5 states have (on average 130.4) internal successors, (652), 4 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have 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:17:05,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:17:05,583 INFO L93 Difference]: Finished difference Result 63037 states and 78523 transitions. [2024-11-06 20:17:05,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 20:17:05,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 130.4) internal successors, (652), 4 states have internal predecessors, (652), 0 states have call successors, (0), 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 652 [2024-11-06 20:17:05,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:17:05,637 INFO L225 Difference]: With dead ends: 63037 [2024-11-06 20:17:05,637 INFO L226 Difference]: Without dead ends: 36289 [2024-11-06 20:17:05,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-06 20:17:05,678 INFO L432 NwaCegarLoop]: 1654 mSDtfsCounter, 2272 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 10028 mSolverCounterSat, 188 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2272 SdHoareTripleChecker+Valid, 1870 SdHoareTripleChecker+Invalid, 10216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 188 IncrementalHoareTripleChecker+Valid, 10028 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.9s IncrementalHoareTripleChecker+Time [2024-11-06 20:17:05,679 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2272 Valid, 1870 Invalid, 10216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [188 Valid, 10028 Invalid, 0 Unknown, 0 Unchecked, 6.9s Time] [2024-11-06 20:17:05,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36289 states. [2024-11-06 20:17:05,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36289 to 34921. [2024-11-06 20:17:05,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34921 states, 34920 states have (on average 1.2223654066437573) internal successors, (42685), 34920 states have internal predecessors, (42685), 0 states have call successors, (0), 0 states have 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:17:06,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34921 states to 34921 states and 42685 transitions. [2024-11-06 20:17:06,011 INFO L78 Accepts]: Start accepts. Automaton has 34921 states and 42685 transitions. Word has length 652 [2024-11-06 20:17:06,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:17:06,012 INFO L471 AbstractCegarLoop]: Abstraction has 34921 states and 42685 transitions. [2024-11-06 20:17:06,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 130.4) internal successors, (652), 4 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have 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:17:06,012 INFO L276 IsEmpty]: Start isEmpty. Operand 34921 states and 42685 transitions. [2024-11-06 20:17:06,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 855 [2024-11-06 20:17:06,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:17:06,017 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, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:06,017 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 20:17:06,017 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:17:06,018 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:17:06,018 INFO L85 PathProgramCache]: Analyzing trace with hash -1001552943, now seen corresponding path program 1 times [2024-11-06 20:17:06,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:17:06,018 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690819823] [2024-11-06 20:17:06,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:17:06,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:17:06,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:17:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 118 proven. 360 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2024-11-06 20:17:07,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:17:07,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690819823] [2024-11-06 20:17:07,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690819823] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 20:17:07,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044875460] [2024-11-06 20:17:07,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:17:07,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:17:07,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 20:17:07,418 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:17:07,422 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:17:07,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:17:07,627 INFO L255 TraceCheckSpWp]: Trace formula consists of 986 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 20:17:07,638 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 20:17:07,733 INFO L134 CoverageAnalysis]: Checked inductivity of 572 backedges. 176 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2024-11-06 20:17:07,733 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 20:17:07,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044875460] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:17:07,734 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 20:17:07,734 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2024-11-06 20:17:07,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951252926] [2024-11-06 20:17:07,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:17:07,735 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:17:07,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:17:07,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:17:07,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-06 20:17:07,736 INFO L87 Difference]: Start difference. First operand 34921 states and 42685 transitions. Second operand has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have 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:17:13,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:17:13,339 INFO L93 Difference]: Finished difference Result 87633 states and 109678 transitions. [2024-11-06 20:17:13,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 20:17:13,340 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 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 854 [2024-11-06 20:17:13,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:17:13,399 INFO L225 Difference]: With dead ends: 87633 [2024-11-06 20:17:13,399 INFO L226 Difference]: Without dead ends: 55444 [2024-11-06 20:17:13,420 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 858 GetRequests, 855 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:17:13,420 INFO L432 NwaCegarLoop]: 1675 mSDtfsCounter, 1410 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 4095 mSolverCounterSat, 1671 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1410 SdHoareTripleChecker+Valid, 1872 SdHoareTripleChecker+Invalid, 5766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1671 IncrementalHoareTripleChecker+Valid, 4095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2024-11-06 20:17:13,420 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1410 Valid, 1872 Invalid, 5766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1671 Valid, 4095 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2024-11-06 20:17:13,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55444 states. [2024-11-06 20:17:14,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55444 to 54041. [2024-11-06 20:17:14,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54041 states, 54040 states have (on average 1.181661732050333) internal successors, (63857), 54040 states have internal predecessors, (63857), 0 states have call successors, (0), 0 states have 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:17:14,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54041 states to 54041 states and 63857 transitions. [2024-11-06 20:17:14,119 INFO L78 Accepts]: Start accepts. Automaton has 54041 states and 63857 transitions. Word has length 854 [2024-11-06 20:17:14,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:17:14,124 INFO L471 AbstractCegarLoop]: Abstraction has 54041 states and 63857 transitions. [2024-11-06 20:17:14,124 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 184.33333333333334) internal successors, (553), 3 states have internal predecessors, (553), 0 states have call successors, (0), 0 states have 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:17:14,124 INFO L276 IsEmpty]: Start isEmpty. Operand 54041 states and 63857 transitions. [2024-11-06 20:17:14,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 915 [2024-11-06 20:17:14,138 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:17:14,138 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, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:14,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-06 20:17:14,339 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 20:17:14,339 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:17:14,340 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:17:14,340 INFO L85 PathProgramCache]: Analyzing trace with hash -913205463, now seen corresponding path program 1 times [2024-11-06 20:17:14,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:17:14,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1300469144] [2024-11-06 20:17:14,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:17:14,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:17:14,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:17:14,938 INFO L134 CoverageAnalysis]: Checked inductivity of 819 backedges. 551 proven. 0 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2024-11-06 20:17:14,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:17:14,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1300469144] [2024-11-06 20:17:14,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1300469144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:17:14,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:17:14,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 20:17:14,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316929309] [2024-11-06 20:17:14,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:17:14,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 20:17:14,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:17:14,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 20:17:14,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:17:14,941 INFO L87 Difference]: Start difference. First operand 54041 states and 63857 transitions. Second operand has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have 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:17:24,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 20:17:24,898 INFO L93 Difference]: Finished difference Result 172462 states and 208118 transitions. [2024-11-06 20:17:24,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 20:17:24,899 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 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 914 [2024-11-06 20:17:24,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 20:17:25,024 INFO L225 Difference]: With dead ends: 172462 [2024-11-06 20:17:25,025 INFO L226 Difference]: Without dead ends: 121153 [2024-11-06 20:17:25,051 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 20:17:25,052 INFO L432 NwaCegarLoop]: 952 mSDtfsCounter, 3216 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 8806 mSolverCounterSat, 2790 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3216 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 11596 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2790 IncrementalHoareTripleChecker+Valid, 8806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.3s IncrementalHoareTripleChecker+Time [2024-11-06 20:17:25,052 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3216 Valid, 1286 Invalid, 11596 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2790 Valid, 8806 Invalid, 0 Unknown, 0 Unchecked, 9.3s Time] [2024-11-06 20:17:25,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121153 states. [2024-11-06 20:17:26,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121153 to 104650. [2024-11-06 20:17:26,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104650 states, 104649 states have (on average 1.1877705472579767) internal successors, (124299), 104649 states have internal predecessors, (124299), 0 states have call successors, (0), 0 states have 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:17:26,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104650 states to 104650 states and 124299 transitions. [2024-11-06 20:17:26,299 INFO L78 Accepts]: Start accepts. Automaton has 104650 states and 124299 transitions. Word has length 914 [2024-11-06 20:17:26,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 20:17:26,301 INFO L471 AbstractCegarLoop]: Abstraction has 104650 states and 124299 transitions. [2024-11-06 20:17:26,301 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 162.0) internal successors, (648), 4 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have 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:17:26,301 INFO L276 IsEmpty]: Start isEmpty. Operand 104650 states and 124299 transitions. [2024-11-06 20:17:26,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 921 [2024-11-06 20:17:26,322 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 20:17:26,328 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:17:26,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 20:17:26,328 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 20:17:26,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 20:17:26,328 INFO L85 PathProgramCache]: Analyzing trace with hash 2048607819, now seen corresponding path program 1 times [2024-11-06 20:17:26,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 20:17:26,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775186996] [2024-11-06 20:17:26,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 20:17:26,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 20:17:26,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 20:17:27,978 INFO L134 CoverageAnalysis]: Checked inductivity of 704 backedges. 495 proven. 0 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2024-11-06 20:17:27,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 20:17:27,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775186996] [2024-11-06 20:17:27,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775186996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 20:17:27,978 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 20:17:27,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 20:17:27,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911652150] [2024-11-06 20:17:27,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 20:17:27,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 20:17:27,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 20:17:27,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 20:17:27,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 20:17:27,980 INFO L87 Difference]: Start difference. First operand 104650 states and 124299 transitions. Second operand has 3 states, 3 states have (on average 237.33333333333334) internal successors, (712), 3 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)