./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem13_label17.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4f9af400 extending candidate: java ['java'] extending candidate: /usr/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/oracle-jdk-bin-*/bin/java ['java', '/usr/bin/java'] extending candidate: /opt/openjdk-*/bin/java ['java', '/usr/bin/java'] extending candidate: /usr/lib/jvm/java-*-openjdk-amd64/bin/java ['java', '/usr/bin/java', '/usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java', '/usr/lib/jvm/java-17-openjdk-amd64/bin/java', '/usr/lib/jvm/java-11-openjdk-amd64/bin/java', '/usr/lib/jvm/java-1.17.0-openjdk-amd64/bin/java'] ['/root/.sdkman/candidates/java/21.0.5-tem/bin/java', '-Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config', '-Xmx15G', '-Xms4m', '-jar', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar', '-data', '@noDefault', '-ultimatedata', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data', '-tc', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml', '-i', '../sv-benchmarks/c/eca-rers2012/Problem13_label17.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', 'e8f177d03f4f60423a896dbe491efae793eb2062a8d25f45f05aed5ed36051f8'] Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/eca-rers2012/Problem13_label17.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 e8f177d03f4f60423a896dbe491efae793eb2062a8d25f45f05aed5ed36051f8 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 19:47:33,291 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 19:47:33,349 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 19:47:33,355 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 19:47:33,357 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 19:47:33,378 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 19:47:33,379 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 19:47:33,380 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 19:47:33,380 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 19:47:33,383 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 19:47:33,383 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 19:47:33,383 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 19:47:33,383 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 19:47:33,383 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 19:47:33,384 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 19:47:33,384 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 19:47:33,384 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 19:47:33,384 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 19:47:33,384 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 19:47:33,384 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 19:47:33,384 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 19:47:33,384 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 19:47:33,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 19:47:33,384 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 19:47:33,384 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 19:47:33,384 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 19:47:33,384 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 19:47:33,384 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 19:47:33,384 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 19:47:33,384 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 19:47:33,384 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 19:47:33,384 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 19:47:33,384 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:47:33,385 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 19:47:33,385 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 19:47:33,385 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 19:47:33,385 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 19:47:33,385 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 19:47:33,385 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 19:47:33,385 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 19:47:33,385 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 19:47:33,385 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 19:47:33,385 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 -> e8f177d03f4f60423a896dbe491efae793eb2062a8d25f45f05aed5ed36051f8 [2024-11-06 19:47:33,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 19:47:33,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 19:47:33,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 19:47:33,615 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 19:47:33,615 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 19:47:33,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem13_label17.c [2024-11-06 19:47:34,677 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 19:47:35,006 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 19:47:35,007 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label17.c [2024-11-06 19:47:35,036 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b76a4b6d3/5d6adf4ba8484551aca7c2e1a9a67aa8/FLAG0cdeef4da [2024-11-06 19:47:35,048 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b76a4b6d3/5d6adf4ba8484551aca7c2e1a9a67aa8 [2024-11-06 19:47:35,050 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 19:47:35,052 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 19:47:35,053 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 19:47:35,054 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 19:47:35,057 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 19:47:35,057 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:47:35" (1/1) ... [2024-11-06 19:47:35,059 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ab275d3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:35, skipping insertion in model container [2024-11-06 19:47:35,059 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 07:47:35" (1/1) ... [2024-11-06 19:47:35,139 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 19:47:35,303 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label17.c[4917,4930] [2024-11-06 19:47:35,761 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:47:35,781 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 19:47:35,796 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem13_label17.c[4917,4930] [2024-11-06 19:47:36,173 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 19:47:36,191 INFO L204 MainTranslator]: Completed translation [2024-11-06 19:47:36,192 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:36 WrapperNode [2024-11-06 19:47:36,193 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 19:47:36,194 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 19:47:36,194 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 19:47:36,194 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 19:47:36,198 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:36" (1/1) ... [2024-11-06 19:47:36,241 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:36" (1/1) ... [2024-11-06 19:47:36,701 INFO L138 Inliner]: procedures = 17, calls = 11, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 5587 [2024-11-06 19:47:36,701 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 19:47:36,702 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 19:47:36,702 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 19:47:36,702 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 19:47:36,708 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:36" (1/1) ... [2024-11-06 19:47:36,708 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:36" (1/1) ... [2024-11-06 19:47:36,749 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:36" (1/1) ... [2024-11-06 19:47:36,933 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-06 19:47:36,934 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:36" (1/1) ... [2024-11-06 19:47:36,934 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:36" (1/1) ... [2024-11-06 19:47:37,025 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:36" (1/1) ... [2024-11-06 19:47:37,131 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:36" (1/1) ... [2024-11-06 19:47:37,171 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:36" (1/1) ... [2024-11-06 19:47:37,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:36" (1/1) ... [2024-11-06 19:47:37,284 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 19:47:37,289 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 19:47:37,289 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 19:47:37,289 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 19:47:37,290 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:36" (1/1) ... [2024-11-06 19:47:37,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 19:47:37,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:47:37,344 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-06 19:47:37,353 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-06 19:47:37,379 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 19:47:37,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 19:47:37,379 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 19:47:37,379 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 19:47:37,455 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 19:47:37,457 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 19:47:41,855 INFO L? ?]: Removed 738 outVars from TransFormulas that were not future-live. [2024-11-06 19:47:41,856 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 19:47:41,879 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 19:47:41,881 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 19:47:41,882 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:47:41 BoogieIcfgContainer [2024-11-06 19:47:41,882 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 19:47:41,885 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 19:47:41,886 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 19:47:41,889 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 19:47:41,889 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 07:47:35" (1/3) ... [2024-11-06 19:47:41,889 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d19a046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:47:41, skipping insertion in model container [2024-11-06 19:47:41,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 07:47:36" (2/3) ... [2024-11-06 19:47:41,890 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2d19a046 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 07:47:41, skipping insertion in model container [2024-11-06 19:47:41,890 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 07:47:41" (3/3) ... [2024-11-06 19:47:41,891 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem13_label17.c [2024-11-06 19:47:41,900 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 19:47:41,900 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 19:47:41,953 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 19:47:41,962 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;@348f26b9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 19:47:41,962 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 19:47:41,967 INFO L276 IsEmpty]: Start isEmpty. Operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:41,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-06 19:47:41,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:47:41,971 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] [2024-11-06 19:47:41,972 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:47:41,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:47:41,975 INFO L85 PathProgramCache]: Analyzing trace with hash 2113343065, now seen corresponding path program 1 times [2024-11-06 19:47:41,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:47:41,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491229864] [2024-11-06 19:47:41,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:47:41,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:47:42,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:47:42,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:47:42,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:47:42,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491229864] [2024-11-06 19:47:42,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491229864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:47:42,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:47:42,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:47:42,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1681798376] [2024-11-06 19:47:42,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:47:42,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:47:42,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:47:42,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:47:42,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:47:42,217 INFO L87 Difference]: Start difference. First operand has 1098 states, 1096 states have (on average 1.8275547445255473) internal successors, (2003), 1097 states have internal predecessors, (2003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:45,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:47:45,373 INFO L93 Difference]: Finished difference Result 3035 states and 5643 transitions. [2024-11-06 19:47:45,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:47:45,374 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2024-11-06 19:47:45,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:47:45,394 INFO L225 Difference]: With dead ends: 3035 [2024-11-06 19:47:45,394 INFO L226 Difference]: Without dead ends: 1873 [2024-11-06 19:47:45,399 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:47:45,403 INFO L432 NwaCegarLoop]: 991 mSDtfsCounter, 872 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 2505 mSolverCounterSat, 858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 872 SdHoareTripleChecker+Valid, 1145 SdHoareTripleChecker+Invalid, 3363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 858 IncrementalHoareTripleChecker+Valid, 2505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:47:45,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [872 Valid, 1145 Invalid, 3363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [858 Valid, 2505 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-06 19:47:45,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1873 states. [2024-11-06 19:47:45,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1873 to 1859. [2024-11-06 19:47:45,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1859 states, 1858 states have (on average 1.5441334768568353) internal successors, (2869), 1858 states have internal predecessors, (2869), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:45,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1859 states to 1859 states and 2869 transitions. [2024-11-06 19:47:45,489 INFO L78 Accepts]: Start accepts. Automaton has 1859 states and 2869 transitions. Word has length 33 [2024-11-06 19:47:45,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:47:45,489 INFO L471 AbstractCegarLoop]: Abstraction has 1859 states and 2869 transitions. [2024-11-06 19:47:45,489 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 11.0) internal successors, (33), 2 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:45,489 INFO L276 IsEmpty]: Start isEmpty. Operand 1859 states and 2869 transitions. [2024-11-06 19:47:45,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2024-11-06 19:47:45,493 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:47:45,493 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:47:45,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 19:47:45,494 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:47:45,494 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:47:45,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1756463341, now seen corresponding path program 1 times [2024-11-06 19:47:45,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:47:45,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871654916] [2024-11-06 19:47:45,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:47:45,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:47:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:47:45,727 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:47:45,727 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:47:45,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871654916] [2024-11-06 19:47:45,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871654916] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:47:45,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:47:45,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:47:45,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826699192] [2024-11-06 19:47:45,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:47:45,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:47:45,728 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:47:45,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:47:45,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:47:45,728 INFO L87 Difference]: Start difference. First operand 1859 states and 2869 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:48,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:47:48,657 INFO L93 Difference]: Finished difference Result 5317 states and 8229 transitions. [2024-11-06 19:47:48,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:47:48,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105 [2024-11-06 19:47:48,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:47:48,668 INFO L225 Difference]: With dead ends: 5317 [2024-11-06 19:47:48,668 INFO L226 Difference]: Without dead ends: 3460 [2024-11-06 19:47:48,669 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:47:48,670 INFO L432 NwaCegarLoop]: 1039 mSDtfsCounter, 826 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 2402 mSolverCounterSat, 877 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 826 SdHoareTripleChecker+Valid, 1192 SdHoareTripleChecker+Invalid, 3279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 877 IncrementalHoareTripleChecker+Valid, 2402 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:47:48,670 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [826 Valid, 1192 Invalid, 3279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [877 Valid, 2402 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-06 19:47:48,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3460 states. [2024-11-06 19:47:48,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3460 to 3459. [2024-11-06 19:47:48,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3459 states, 3458 states have (on average 1.3805668016194332) internal successors, (4774), 3458 states have internal predecessors, (4774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:48,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 4774 transitions. [2024-11-06 19:47:48,714 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 4774 transitions. Word has length 105 [2024-11-06 19:47:48,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:47:48,715 INFO L471 AbstractCegarLoop]: Abstraction has 3459 states and 4774 transitions. [2024-11-06 19:47:48,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:48,715 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 4774 transitions. [2024-11-06 19:47:48,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-11-06 19:47:48,717 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:47:48,717 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:47:48,717 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 19:47:48,717 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:47:48,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:47:48,718 INFO L85 PathProgramCache]: Analyzing trace with hash -506428778, now seen corresponding path program 1 times [2024-11-06 19:47:48,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:47:48,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [317354650] [2024-11-06 19:47:48,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:47:48,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:47:48,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:47:49,032 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:47:49,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:47:49,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [317354650] [2024-11-06 19:47:49,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [317354650] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:47:49,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:47:49,034 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:47:49,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467143720] [2024-11-06 19:47:49,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:47:49,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:47:49,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:47:49,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:47:49,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:47:49,036 INFO L87 Difference]: Start difference. First operand 3459 states and 4774 transitions. Second operand has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:52,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:47:52,547 INFO L93 Difference]: Finished difference Result 10870 states and 14768 transitions. [2024-11-06 19:47:52,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:47:52,548 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 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 119 [2024-11-06 19:47:52,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:47:52,565 INFO L225 Difference]: With dead ends: 10870 [2024-11-06 19:47:52,565 INFO L226 Difference]: Without dead ends: 7413 [2024-11-06 19:47:52,568 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 19:47:52,568 INFO L432 NwaCegarLoop]: 709 mSDtfsCounter, 2582 mSDsluCounter, 294 mSDsCounter, 0 mSdLazyCounter, 4117 mSolverCounterSat, 831 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2582 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 4948 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 831 IncrementalHoareTripleChecker+Valid, 4117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:47:52,569 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2582 Valid, 1003 Invalid, 4948 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [831 Valid, 4117 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2024-11-06 19:47:52,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7413 states. [2024-11-06 19:47:52,654 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7413 to 7412. [2024-11-06 19:47:52,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7412 states, 7411 states have (on average 1.2698691134799622) internal successors, (9411), 7411 states have internal predecessors, (9411), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:52,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7412 states to 7412 states and 9411 transitions. [2024-11-06 19:47:52,679 INFO L78 Accepts]: Start accepts. Automaton has 7412 states and 9411 transitions. Word has length 119 [2024-11-06 19:47:52,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:47:52,680 INFO L471 AbstractCegarLoop]: Abstraction has 7412 states and 9411 transitions. [2024-11-06 19:47:52,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.75) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:52,680 INFO L276 IsEmpty]: Start isEmpty. Operand 7412 states and 9411 transitions. [2024-11-06 19:47:52,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-06 19:47:52,682 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:47:52,682 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:47:52,683 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 19:47:52,683 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:47:52,683 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:47:52,683 INFO L85 PathProgramCache]: Analyzing trace with hash 853748547, now seen corresponding path program 1 times [2024-11-06 19:47:52,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:47:52,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372679189] [2024-11-06 19:47:52,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:47:52,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:47:52,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:47:52,852 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 61 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-06 19:47:52,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:47:52,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372679189] [2024-11-06 19:47:52,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [372679189] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:47:52,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:47:52,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:47:52,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303201507] [2024-11-06 19:47:52,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:47:52,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:47:52,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:47:52,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:47:52,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:47:52,855 INFO L87 Difference]: Start difference. First operand 7412 states and 9411 transitions. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:55,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:47:55,362 INFO L93 Difference]: Finished difference Result 20355 states and 26251 transitions. [2024-11-06 19:47:55,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:47:55,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 200 [2024-11-06 19:47:55,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:47:55,390 INFO L225 Difference]: With dead ends: 20355 [2024-11-06 19:47:55,390 INFO L226 Difference]: Without dead ends: 13732 [2024-11-06 19:47:55,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:47:55,397 INFO L432 NwaCegarLoop]: 850 mSDtfsCounter, 888 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 2575 mSolverCounterSat, 748 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 3323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 748 IncrementalHoareTripleChecker+Valid, 2575 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2024-11-06 19:47:55,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 978 Invalid, 3323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [748 Valid, 2575 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2024-11-06 19:47:55,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13732 states. [2024-11-06 19:47:55,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13732 to 12937. [2024-11-06 19:47:55,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12937 states, 12936 states have (on average 1.215213358070501) internal successors, (15720), 12936 states have internal predecessors, (15720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:55,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12937 states to 12937 states and 15720 transitions. [2024-11-06 19:47:55,561 INFO L78 Accepts]: Start accepts. Automaton has 12937 states and 15720 transitions. Word has length 200 [2024-11-06 19:47:55,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:47:55,562 INFO L471 AbstractCegarLoop]: Abstraction has 12937 states and 15720 transitions. [2024-11-06 19:47:55,562 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 2 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:55,562 INFO L276 IsEmpty]: Start isEmpty. Operand 12937 states and 15720 transitions. [2024-11-06 19:47:55,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2024-11-06 19:47:55,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:47:55,566 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:47:55,566 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 19:47:55,566 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:47:55,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:47:55,566 INFO L85 PathProgramCache]: Analyzing trace with hash -269504365, now seen corresponding path program 1 times [2024-11-06 19:47:55,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:47:55,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403373888] [2024-11-06 19:47:55,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:47:55,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:47:55,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:47:55,786 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 19:47:55,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:47:55,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1403373888] [2024-11-06 19:47:55,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1403373888] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:47:55,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:47:55,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:47:55,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024534683] [2024-11-06 19:47:55,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:47:55,788 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:47:55,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:47:55,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:47:55,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:47:55,789 INFO L87 Difference]: Start difference. First operand 12937 states and 15720 transitions. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:58,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:47:58,852 INFO L93 Difference]: Finished difference Result 31392 states and 39119 transitions. [2024-11-06 19:47:58,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:47:58,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 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 232 [2024-11-06 19:47:58,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:47:58,884 INFO L225 Difference]: With dead ends: 31392 [2024-11-06 19:47:58,885 INFO L226 Difference]: Without dead ends: 19244 [2024-11-06 19:47:58,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:47:58,893 INFO L432 NwaCegarLoop]: 809 mSDtfsCounter, 858 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 914 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 858 SdHoareTripleChecker+Valid, 926 SdHoareTripleChecker+Invalid, 3295 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 914 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-06 19:47:58,893 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [858 Valid, 926 Invalid, 3295 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [914 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-06 19:47:58,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19244 states. [2024-11-06 19:47:59,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19244 to 18447. [2024-11-06 19:47:59,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18447 states, 18446 states have (on average 1.2024287108316165) internal successors, (22180), 18446 states have internal predecessors, (22180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:59,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18447 states to 18447 states and 22180 transitions. [2024-11-06 19:47:59,074 INFO L78 Accepts]: Start accepts. Automaton has 18447 states and 22180 transitions. Word has length 232 [2024-11-06 19:47:59,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:47:59,075 INFO L471 AbstractCegarLoop]: Abstraction has 18447 states and 22180 transitions. [2024-11-06 19:47:59,076 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:47:59,076 INFO L276 IsEmpty]: Start isEmpty. Operand 18447 states and 22180 transitions. [2024-11-06 19:47:59,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2024-11-06 19:47:59,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:47:59,083 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:47:59,083 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 19:47:59,084 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:47:59,084 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:47:59,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1622019590, now seen corresponding path program 1 times [2024-11-06 19:47:59,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:47:59,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074602779] [2024-11-06 19:47:59,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:47:59,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:47:59,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:47:59,545 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 92 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-06 19:47:59,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:47:59,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074602779] [2024-11-06 19:47:59,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074602779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:47:59,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:47:59,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:47:59,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086393868] [2024-11-06 19:47:59,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:47:59,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:47:59,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:47:59,546 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:47:59,546 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:47:59,546 INFO L87 Difference]: Start difference. First operand 18447 states and 22180 transitions. Second operand has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:03,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:03,520 INFO L93 Difference]: Finished difference Result 59761 states and 73268 transitions. [2024-11-06 19:48:03,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:48:03,521 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 321 [2024-11-06 19:48:03,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:03,657 INFO L225 Difference]: With dead ends: 59761 [2024-11-06 19:48:03,657 INFO L226 Difference]: Without dead ends: 42103 [2024-11-06 19:48:03,672 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:48:03,674 INFO L432 NwaCegarLoop]: 583 mSDtfsCounter, 1791 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 4633 mSolverCounterSat, 1179 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1791 SdHoareTripleChecker+Valid, 771 SdHoareTripleChecker+Invalid, 5812 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1179 IncrementalHoareTripleChecker+Valid, 4633 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:03,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1791 Valid, 771 Invalid, 5812 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1179 Valid, 4633 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2024-11-06 19:48:03,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42103 states. [2024-11-06 19:48:04,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42103 to 42101. [2024-11-06 19:48:04,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42101 states, 42100 states have (on average 1.186959619952494) internal successors, (49971), 42100 states have internal predecessors, (49971), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:04,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42101 states to 42101 states and 49971 transitions. [2024-11-06 19:48:04,182 INFO L78 Accepts]: Start accepts. Automaton has 42101 states and 49971 transitions. Word has length 321 [2024-11-06 19:48:04,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:04,183 INFO L471 AbstractCegarLoop]: Abstraction has 42101 states and 49971 transitions. [2024-11-06 19:48:04,183 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.75) internal successors, (139), 3 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:04,183 INFO L276 IsEmpty]: Start isEmpty. Operand 42101 states and 49971 transitions. [2024-11-06 19:48:04,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2024-11-06 19:48:04,187 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:04,188 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:48:04,188 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 19:48:04,188 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:04,189 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:04,189 INFO L85 PathProgramCache]: Analyzing trace with hash -515432322, now seen corresponding path program 1 times [2024-11-06 19:48:04,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:04,189 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205102704] [2024-11-06 19:48:04,189 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:04,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:04,477 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 337 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-06 19:48:04,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:04,477 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205102704] [2024-11-06 19:48:04,477 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205102704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:04,477 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:48:04,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:48:04,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807292415] [2024-11-06 19:48:04,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:04,478 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:48:04,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:04,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:48:04,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:48:04,479 INFO L87 Difference]: Start difference. First operand 42101 states and 49971 transitions. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:09,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:09,511 INFO L93 Difference]: Finished difference Result 142668 states and 170381 transitions. [2024-11-06 19:48:09,511 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:48:09,512 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 321 [2024-11-06 19:48:09,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:09,718 INFO L225 Difference]: With dead ends: 142668 [2024-11-06 19:48:09,718 INFO L226 Difference]: Without dead ends: 101356 [2024-11-06 19:48:09,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:48:09,743 INFO L432 NwaCegarLoop]: 489 mSDtfsCounter, 1738 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 6065 mSolverCounterSat, 1187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1738 SdHoareTripleChecker+Valid, 689 SdHoareTripleChecker+Invalid, 7252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1187 IncrementalHoareTripleChecker+Valid, 6065 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:09,744 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1738 Valid, 689 Invalid, 7252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1187 Valid, 6065 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-06 19:48:09,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101356 states. [2024-11-06 19:48:10,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101356 to 100436. [2024-11-06 19:48:10,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100436 states, 100435 states have (on average 1.1701498481605017) internal successors, (117524), 100435 states have internal predecessors, (117524), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:10,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100436 states to 100436 states and 117524 transitions. [2024-11-06 19:48:10,679 INFO L78 Accepts]: Start accepts. Automaton has 100436 states and 117524 transitions. Word has length 321 [2024-11-06 19:48:10,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:10,679 INFO L471 AbstractCegarLoop]: Abstraction has 100436 states and 117524 transitions. [2024-11-06 19:48:10,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 3 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:10,679 INFO L276 IsEmpty]: Start isEmpty. Operand 100436 states and 117524 transitions. [2024-11-06 19:48:10,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2024-11-06 19:48:10,683 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:10,683 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 19:48:10,684 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 19:48:10,684 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:10,684 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:10,684 INFO L85 PathProgramCache]: Analyzing trace with hash -811172309, now seen corresponding path program 1 times [2024-11-06 19:48:10,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:10,684 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927088930] [2024-11-06 19:48:10,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:10,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:10,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:11,255 INFO L134 CoverageAnalysis]: Checked inductivity of 356 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2024-11-06 19:48:11,259 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:11,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927088930] [2024-11-06 19:48:11,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [927088930] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:11,259 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:48:11,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 19:48:11,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937113428] [2024-11-06 19:48:11,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:11,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:48:11,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:11,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:48:11,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:11,261 INFO L87 Difference]: Start difference. First operand 100436 states and 117524 transitions. Second operand has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:14,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:14,267 INFO L93 Difference]: Finished difference Result 189847 states and 223207 transitions. [2024-11-06 19:48:14,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:48:14,268 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 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 330 [2024-11-06 19:48:14,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:14,394 INFO L225 Difference]: With dead ends: 189847 [2024-11-06 19:48:14,394 INFO L226 Difference]: Without dead ends: 100444 [2024-11-06 19:48:14,453 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:14,454 INFO L432 NwaCegarLoop]: 1019 mSDtfsCounter, 728 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 2704 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 728 SdHoareTripleChecker+Valid, 1200 SdHoareTripleChecker+Invalid, 2708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 2704 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:14,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [728 Valid, 1200 Invalid, 2708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 2704 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 19:48:14,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100444 states. [2024-11-06 19:48:15,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100444 to 100436. [2024-11-06 19:48:15,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100436 states, 100435 states have (on average 1.1695026634141485) internal successors, (117459), 100435 states have internal predecessors, (117459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:15,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100436 states to 100436 states and 117459 transitions. [2024-11-06 19:48:15,500 INFO L78 Accepts]: Start accepts. Automaton has 100436 states and 117459 transitions. Word has length 330 [2024-11-06 19:48:15,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:15,500 INFO L471 AbstractCegarLoop]: Abstraction has 100436 states and 117459 transitions. [2024-11-06 19:48:15,501 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.66666666666667) internal successors, (206), 2 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:15,501 INFO L276 IsEmpty]: Start isEmpty. Operand 100436 states and 117459 transitions. [2024-11-06 19:48:15,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 360 [2024-11-06 19:48:15,504 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:15,505 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:48:15,505 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 19:48:15,505 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:15,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:15,505 INFO L85 PathProgramCache]: Analyzing trace with hash 1819442547, now seen corresponding path program 1 times [2024-11-06 19:48:15,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:15,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [255795106] [2024-11-06 19:48:15,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:15,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:16,475 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 230 proven. 113 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-06 19:48:16,476 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:16,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [255795106] [2024-11-06 19:48:16,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [255795106] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 19:48:16,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [787845277] [2024-11-06 19:48:16,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:16,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:48:16,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 19:48:16,479 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-06 19:48:16,480 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-06 19:48:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:16,606 INFO L255 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 19:48:16,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 19:48:16,744 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 230 proven. 0 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2024-11-06 19:48:16,744 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 19:48:16,744 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [787845277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:16,744 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 19:48:16,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [7] total 9 [2024-11-06 19:48:16,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [545742691] [2024-11-06 19:48:16,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:16,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:48:16,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:16,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:48:16,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:48:16,746 INFO L87 Difference]: Start difference. First operand 100436 states and 117459 transitions. Second operand has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:20,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:20,248 INFO L93 Difference]: Finished difference Result 200082 states and 234124 transitions. [2024-11-06 19:48:20,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:48:20,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 359 [2024-11-06 19:48:20,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:20,366 INFO L225 Difference]: With dead ends: 200082 [2024-11-06 19:48:20,366 INFO L226 Difference]: Without dead ends: 100435 [2024-11-06 19:48:20,419 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 358 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-06 19:48:20,419 INFO L432 NwaCegarLoop]: 1364 mSDtfsCounter, 1123 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 2467 mSolverCounterSat, 450 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1123 SdHoareTripleChecker+Valid, 1446 SdHoareTripleChecker+Invalid, 2917 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 450 IncrementalHoareTripleChecker+Valid, 2467 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:20,419 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1123 Valid, 1446 Invalid, 2917 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [450 Valid, 2467 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2024-11-06 19:48:20,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100435 states. [2024-11-06 19:48:21,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100435 to 99646. [2024-11-06 19:48:21,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99646 states, 99645 states have (on average 1.1240102363390034) internal successors, (112002), 99645 states have internal predecessors, (112002), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:21,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99646 states to 99646 states and 112002 transitions. [2024-11-06 19:48:21,553 INFO L78 Accepts]: Start accepts. Automaton has 99646 states and 112002 transitions. Word has length 359 [2024-11-06 19:48:21,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:21,554 INFO L471 AbstractCegarLoop]: Abstraction has 99646 states and 112002 transitions. [2024-11-06 19:48:21,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 72.33333333333333) internal successors, (217), 3 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:21,554 INFO L276 IsEmpty]: Start isEmpty. Operand 99646 states and 112002 transitions. [2024-11-06 19:48:21,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 390 [2024-11-06 19:48:21,561 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:21,562 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:48:21,576 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-06 19:48:21,762 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 19:48:21,764 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:21,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:21,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1112506830, now seen corresponding path program 1 times [2024-11-06 19:48:21,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:21,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656419407] [2024-11-06 19:48:21,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:21,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:21,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:22,132 INFO L134 CoverageAnalysis]: Checked inductivity of 613 backedges. 452 proven. 0 refuted. 0 times theorem prover too weak. 161 trivial. 0 not checked. [2024-11-06 19:48:22,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:22,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656419407] [2024-11-06 19:48:22,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656419407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:22,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:48:22,132 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:48:22,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024090318] [2024-11-06 19:48:22,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:22,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:48:22,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:22,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:48:22,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:22,134 INFO L87 Difference]: Start difference. First operand 99646 states and 112002 transitions. Second operand has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:25,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:25,162 INFO L93 Difference]: Finished difference Result 226845 states and 257623 transitions. [2024-11-06 19:48:25,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:48:25,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 389 [2024-11-06 19:48:25,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:25,289 INFO L225 Difference]: With dead ends: 226845 [2024-11-06 19:48:25,289 INFO L226 Difference]: Without dead ends: 127988 [2024-11-06 19:48:25,332 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:25,332 INFO L432 NwaCegarLoop]: 868 mSDtfsCounter, 888 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 2429 mSolverCounterSat, 932 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 953 SdHoareTripleChecker+Invalid, 3361 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 932 IncrementalHoareTripleChecker+Valid, 2429 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:25,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 953 Invalid, 3361 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [932 Valid, 2429 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-06 19:48:25,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127988 states. [2024-11-06 19:48:26,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127988 to 126394. [2024-11-06 19:48:26,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126394 states, 126393 states have (on average 1.1274516784948534) internal successors, (142502), 126393 states have internal predecessors, (142502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:26,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126394 states to 126394 states and 142502 transitions. [2024-11-06 19:48:26,309 INFO L78 Accepts]: Start accepts. Automaton has 126394 states and 142502 transitions. Word has length 389 [2024-11-06 19:48:26,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:26,309 INFO L471 AbstractCegarLoop]: Abstraction has 126394 states and 142502 transitions. [2024-11-06 19:48:26,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 76.66666666666667) internal successors, (230), 3 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:26,309 INFO L276 IsEmpty]: Start isEmpty. Operand 126394 states and 142502 transitions. [2024-11-06 19:48:26,315 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 428 [2024-11-06 19:48:26,315 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:26,315 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 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] [2024-11-06 19:48:26,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 19:48:26,316 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:26,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:26,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1062572237, now seen corresponding path program 1 times [2024-11-06 19:48:26,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:26,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649481203] [2024-11-06 19:48:26,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:26,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:26,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:26,515 INFO L134 CoverageAnalysis]: Checked inductivity of 622 backedges. 350 proven. 0 refuted. 0 times theorem prover too weak. 272 trivial. 0 not checked. [2024-11-06 19:48:26,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:26,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649481203] [2024-11-06 19:48:26,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649481203] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:26,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:48:26,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:48:26,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249654113] [2024-11-06 19:48:26,515 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:26,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:48:26,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:26,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:48:26,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:26,516 INFO L87 Difference]: Start difference. First operand 126394 states and 142502 transitions. Second operand has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:30,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:30,382 INFO L93 Difference]: Finished difference Result 281133 states and 319659 transitions. [2024-11-06 19:48:30,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:48:30,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 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 427 [2024-11-06 19:48:30,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:30,562 INFO L225 Difference]: With dead ends: 281133 [2024-11-06 19:48:30,562 INFO L226 Difference]: Without dead ends: 155528 [2024-11-06 19:48:30,642 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:30,642 INFO L432 NwaCegarLoop]: 1787 mSDtfsCounter, 779 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 2555 mSolverCounterSat, 715 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 1938 SdHoareTripleChecker+Invalid, 3270 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 715 IncrementalHoareTripleChecker+Valid, 2555 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:30,642 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [779 Valid, 1938 Invalid, 3270 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [715 Valid, 2555 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-06 19:48:30,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155528 states. [2024-11-06 19:48:32,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155528 to 153937. [2024-11-06 19:48:32,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153937 states, 153936 states have (on average 1.110916224924644) internal successors, (171010), 153936 states have internal predecessors, (171010), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:32,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153937 states to 153937 states and 171010 transitions. [2024-11-06 19:48:32,348 INFO L78 Accepts]: Start accepts. Automaton has 153937 states and 171010 transitions. Word has length 427 [2024-11-06 19:48:32,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:32,348 INFO L471 AbstractCegarLoop]: Abstraction has 153937 states and 171010 transitions. [2024-11-06 19:48:32,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 81.66666666666667) internal successors, (245), 3 states have internal predecessors, (245), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:32,348 INFO L276 IsEmpty]: Start isEmpty. Operand 153937 states and 171010 transitions. [2024-11-06 19:48:32,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 547 [2024-11-06 19:48:32,365 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:32,365 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 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] [2024-11-06 19:48:32,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 19:48:32,365 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:32,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:32,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1708302603, now seen corresponding path program 1 times [2024-11-06 19:48:32,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:32,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452263065] [2024-11-06 19:48:32,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:32,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:32,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1072 backedges. 831 proven. 0 refuted. 0 times theorem prover too weak. 241 trivial. 0 not checked. [2024-11-06 19:48:32,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:32,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452263065] [2024-11-06 19:48:32,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452263065] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:32,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:48:32,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:48:32,531 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1053730351] [2024-11-06 19:48:32,531 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:32,531 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:48:32,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:32,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:48:32,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:32,532 INFO L87 Difference]: Start difference. First operand 153937 states and 171010 transitions. Second operand has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:35,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:35,874 INFO L93 Difference]: Finished difference Result 307095 states and 341246 transitions. [2024-11-06 19:48:35,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:48:35,874 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 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 546 [2024-11-06 19:48:35,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:36,040 INFO L225 Difference]: With dead ends: 307095 [2024-11-06 19:48:36,040 INFO L226 Difference]: Without dead ends: 153947 [2024-11-06 19:48:36,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:36,091 INFO L432 NwaCegarLoop]: 1416 mSDtfsCounter, 936 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 2491 mSolverCounterSat, 598 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 936 SdHoareTripleChecker+Valid, 1508 SdHoareTripleChecker+Invalid, 3089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 598 IncrementalHoareTripleChecker+Valid, 2491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:36,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [936 Valid, 1508 Invalid, 3089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [598 Valid, 2491 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2024-11-06 19:48:36,185 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153947 states. [2024-11-06 19:48:37,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153947 to 153930. [2024-11-06 19:48:37,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153930 states, 153929 states have (on average 1.0836879340475154) internal successors, (166811), 153929 states have internal predecessors, (166811), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:37,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153930 states to 153930 states and 166811 transitions. [2024-11-06 19:48:37,826 INFO L78 Accepts]: Start accepts. Automaton has 153930 states and 166811 transitions. Word has length 546 [2024-11-06 19:48:37,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:37,826 INFO L471 AbstractCegarLoop]: Abstraction has 153930 states and 166811 transitions. [2024-11-06 19:48:37,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.0) internal successors, (339), 3 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:37,826 INFO L276 IsEmpty]: Start isEmpty. Operand 153930 states and 166811 transitions. [2024-11-06 19:48:37,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 583 [2024-11-06 19:48:37,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:37,845 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:48:37,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 19:48:37,845 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:37,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:37,845 INFO L85 PathProgramCache]: Analyzing trace with hash -2011980910, now seen corresponding path program 1 times [2024-11-06 19:48:37,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:37,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853538297] [2024-11-06 19:48:37,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:37,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:37,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:38,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1129 backedges. 753 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2024-11-06 19:48:38,125 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:38,125 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853538297] [2024-11-06 19:48:38,125 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853538297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:38,125 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:48:38,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:48:38,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645486205] [2024-11-06 19:48:38,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:38,126 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:48:38,126 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:38,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:48:38,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:38,127 INFO L87 Difference]: Start difference. First operand 153930 states and 166811 transitions. Second operand has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:41,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:41,096 INFO L93 Difference]: Finished difference Result 314917 states and 340710 transitions. [2024-11-06 19:48:41,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:48:41,097 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 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 582 [2024-11-06 19:48:41,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:41,269 INFO L225 Difference]: With dead ends: 314917 [2024-11-06 19:48:41,270 INFO L226 Difference]: Without dead ends: 158628 [2024-11-06 19:48:41,337 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:41,338 INFO L432 NwaCegarLoop]: 1492 mSDtfsCounter, 1018 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 2348 mSolverCounterSat, 589 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1018 SdHoareTripleChecker+Valid, 1625 SdHoareTripleChecker+Invalid, 2937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 589 IncrementalHoareTripleChecker+Valid, 2348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:41,338 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1018 Valid, 1625 Invalid, 2937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [589 Valid, 2348 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-06 19:48:41,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158628 states. [2024-11-06 19:48:42,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158628 to 147599. [2024-11-06 19:48:42,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147599 states, 147598 states have (on average 1.0591877938725458) internal successors, (156334), 147598 states have internal predecessors, (156334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:42,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147599 states to 147599 states and 156334 transitions. [2024-11-06 19:48:42,826 INFO L78 Accepts]: Start accepts. Automaton has 147599 states and 156334 transitions. Word has length 582 [2024-11-06 19:48:42,826 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:42,826 INFO L471 AbstractCegarLoop]: Abstraction has 147599 states and 156334 transitions. [2024-11-06 19:48:42,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.66666666666667) internal successors, (362), 3 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:42,826 INFO L276 IsEmpty]: Start isEmpty. Operand 147599 states and 156334 transitions. [2024-11-06 19:48:42,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 588 [2024-11-06 19:48:42,844 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:42,844 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:48:42,844 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 19:48:42,844 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:42,845 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:42,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1424107546, now seen corresponding path program 1 times [2024-11-06 19:48:42,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:42,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030061629] [2024-11-06 19:48:42,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:42,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:43,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1107 backedges. 565 proven. 0 refuted. 0 times theorem prover too weak. 542 trivial. 0 not checked. [2024-11-06 19:48:43,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:43,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030061629] [2024-11-06 19:48:43,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030061629] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:43,353 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:48:43,353 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 19:48:43,353 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252287162] [2024-11-06 19:48:43,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:43,354 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 19:48:43,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:43,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 19:48:43,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:43,354 INFO L87 Difference]: Start difference. First operand 147599 states and 156334 transitions. Second operand has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:46,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:46,265 INFO L93 Difference]: Finished difference Result 288864 states and 306795 transitions. [2024-11-06 19:48:46,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 19:48:46,266 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 587 [2024-11-06 19:48:46,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:46,462 INFO L225 Difference]: With dead ends: 288864 [2024-11-06 19:48:46,462 INFO L226 Difference]: Without dead ends: 157013 [2024-11-06 19:48:46,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 19:48:46,547 INFO L432 NwaCegarLoop]: 1399 mSDtfsCounter, 1012 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 2362 mSolverCounterSat, 423 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1012 SdHoareTripleChecker+Valid, 1477 SdHoareTripleChecker+Invalid, 2785 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 423 IncrementalHoareTripleChecker+Valid, 2362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:46,547 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1012 Valid, 1477 Invalid, 2785 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [423 Valid, 2362 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-06 19:48:46,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157013 states. [2024-11-06 19:48:47,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157013 to 157011. [2024-11-06 19:48:48,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157011 states, 157010 states have (on average 1.056614228393096) internal successors, (165899), 157010 states have internal predecessors, (165899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:48,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157011 states to 157011 states and 165899 transitions. [2024-11-06 19:48:48,172 INFO L78 Accepts]: Start accepts. Automaton has 157011 states and 165899 transitions. Word has length 587 [2024-11-06 19:48:48,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:48,172 INFO L471 AbstractCegarLoop]: Abstraction has 157011 states and 165899 transitions. [2024-11-06 19:48:48,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 105.0) internal successors, (315), 3 states have internal predecessors, (315), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:48,172 INFO L276 IsEmpty]: Start isEmpty. Operand 157011 states and 165899 transitions. [2024-11-06 19:48:48,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 638 [2024-11-06 19:48:48,186 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:48,187 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, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2024-11-06 19:48:48,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 19:48:48,187 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:48,187 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:48,187 INFO L85 PathProgramCache]: Analyzing trace with hash 1269831408, now seen corresponding path program 1 times [2024-11-06 19:48:48,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:48,187 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1713245450] [2024-11-06 19:48:48,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:48,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:48,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 19:48:48,722 INFO L134 CoverageAnalysis]: Checked inductivity of 708 backedges. 589 proven. 0 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2024-11-06 19:48:48,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 19:48:48,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1713245450] [2024-11-06 19:48:48,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1713245450] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 19:48:48,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 19:48:48,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 19:48:48,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599035412] [2024-11-06 19:48:48,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 19:48:48,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 19:48:48,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 19:48:48,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 19:48:48,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:48:48,724 INFO L87 Difference]: Start difference. First operand 157011 states and 165899 transitions. Second operand has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:54,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 19:48:54,115 INFO L93 Difference]: Finished difference Result 434635 states and 459836 transitions. [2024-11-06 19:48:54,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 19:48:54,116 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 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 637 [2024-11-06 19:48:54,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 19:48:54,411 INFO L225 Difference]: With dead ends: 434635 [2024-11-06 19:48:54,411 INFO L226 Difference]: Without dead ends: 278413 [2024-11-06 19:48:54,477 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-06 19:48:54,477 INFO L432 NwaCegarLoop]: 650 mSDtfsCounter, 1705 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 6300 mSolverCounterSat, 1100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1705 SdHoareTripleChecker+Valid, 904 SdHoareTripleChecker+Invalid, 7400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1100 IncrementalHoareTripleChecker+Valid, 6300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2024-11-06 19:48:54,477 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1705 Valid, 904 Invalid, 7400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1100 Valid, 6300 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2024-11-06 19:48:54,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278413 states. [2024-11-06 19:48:56,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278413 to 260158. [2024-11-06 19:48:57,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 260158 states, 260157 states have (on average 1.052337626894529) internal successors, (273773), 260157 states have internal predecessors, (273773), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:57,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260158 states to 260158 states and 273773 transitions. [2024-11-06 19:48:57,349 INFO L78 Accepts]: Start accepts. Automaton has 260158 states and 273773 transitions. Word has length 637 [2024-11-06 19:48:57,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 19:48:57,349 INFO L471 AbstractCegarLoop]: Abstraction has 260158 states and 273773 transitions. [2024-11-06 19:48:57,349 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 130.0) internal successors, (520), 4 states have internal predecessors, (520), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 19:48:57,349 INFO L276 IsEmpty]: Start isEmpty. Operand 260158 states and 273773 transitions. [2024-11-06 19:48:57,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 870 [2024-11-06 19:48:57,427 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 19:48:57,427 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, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 19:48:57,428 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-06 19:48:57,428 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 19:48:57,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 19:48:57,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1163667602, now seen corresponding path program 1 times [2024-11-06 19:48:57,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 19:48:57,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341892641] [2024-11-06 19:48:57,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 19:48:57,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 19:48:57,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat