./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label29.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/Problem02_label29.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', 'b63b3bf7ef08814c7616207e01fc54fc4cf0e6569356ae10e2de73225afc9bce'] 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/Problem02_label29.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 b63b3bf7ef08814c7616207e01fc54fc4cf0e6569356ae10e2de73225afc9bce --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 18:55:03,378 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 18:55:03,450 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-06 18:55:03,455 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 18:55:03,458 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 18:55:03,474 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 18:55:03,474 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 18:55:03,475 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 18:55:03,475 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 18:55:03,475 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 18:55:03,475 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 18:55:03,475 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 18:55:03,475 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 18:55:03,475 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 18:55:03,476 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 18:55:03,476 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 18:55:03,476 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 18:55:03,476 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 18:55:03,476 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 18:55:03,476 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 18:55:03,476 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 18:55:03,476 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 18:55:03,476 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 18:55:03,476 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 18:55:03,476 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 18:55:03,477 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 18:55:03,477 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 18:55:03,477 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 18:55:03,477 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 18:55:03,477 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 18:55:03,477 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 18:55:03,477 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 18:55:03,477 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:55:03,477 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 18:55:03,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 18:55:03,477 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 18:55:03,478 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 18:55:03,478 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 18:55:03,478 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 18:55:03,478 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 18:55:03,478 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 18:55:03,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 18:55:03,478 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 -> b63b3bf7ef08814c7616207e01fc54fc4cf0e6569356ae10e2de73225afc9bce [2024-11-06 18:55:03,723 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 18:55:03,731 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 18:55:03,733 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 18:55:03,734 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 18:55:03,734 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 18:55:03,735 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label29.c [2024-11-06 18:55:04,890 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 18:55:05,161 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 18:55:05,163 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label29.c [2024-11-06 18:55:05,182 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16ebffe49/3f97fa3079264c32b4f9cbe1268c7f02/FLAG73223239c [2024-11-06 18:55:05,455 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/16ebffe49/3f97fa3079264c32b4f9cbe1268c7f02 [2024-11-06 18:55:05,457 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 18:55:05,458 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 18:55:05,459 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 18:55:05,459 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 18:55:05,462 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 18:55:05,463 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:55:05" (1/1) ... [2024-11-06 18:55:05,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79ee77f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:05, skipping insertion in model container [2024-11-06 18:55:05,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:55:05" (1/1) ... [2024-11-06 18:55:05,482 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 18:55:05,712 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/Problem02_label29.c[17015,17028] [2024-11-06 18:55:05,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:55:05,759 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 18:55:05,799 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/Problem02_label29.c[17015,17028] [2024-11-06 18:55:05,808 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:55:05,818 INFO L204 MainTranslator]: Completed translation [2024-11-06 18:55:05,819 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:05 WrapperNode [2024-11-06 18:55:05,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 18:55:05,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 18:55:05,820 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 18:55:05,820 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 18:55:05,824 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:05" (1/1) ... [2024-11-06 18:55:05,844 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:05" (1/1) ... [2024-11-06 18:55:05,878 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-11-06 18:55:05,878 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 18:55:05,879 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 18:55:05,879 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 18:55:05,879 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 18:55:05,885 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:05" (1/1) ... [2024-11-06 18:55:05,885 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:05" (1/1) ... [2024-11-06 18:55:05,888 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:05" (1/1) ... [2024-11-06 18:55:05,900 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 18:55:05,900 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:05" (1/1) ... [2024-11-06 18:55:05,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:05" (1/1) ... [2024-11-06 18:55:05,911 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:05" (1/1) ... [2024-11-06 18:55:05,917 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:05" (1/1) ... [2024-11-06 18:55:05,919 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:05" (1/1) ... [2024-11-06 18:55:05,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:05" (1/1) ... [2024-11-06 18:55:05,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 18:55:05,925 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 18:55:05,925 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 18:55:05,925 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 18:55:05,926 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:05" (1/1) ... [2024-11-06 18:55:05,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:55:05,939 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:55:05,950 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 18:55:05,952 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 18:55:05,969 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 18:55:05,970 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 18:55:05,970 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 18:55:05,970 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 18:55:06,017 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 18:55:06,019 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 18:55:06,776 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-06 18:55:06,777 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 18:55:06,792 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 18:55:06,792 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 18:55:06,796 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:55:06 BoogieIcfgContainer [2024-11-06 18:55:06,796 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 18:55:06,798 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 18:55:06,798 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 18:55:06,806 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 18:55:06,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:55:05" (1/3) ... [2024-11-06 18:55:06,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@393f3749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:55:06, skipping insertion in model container [2024-11-06 18:55:06,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:05" (2/3) ... [2024-11-06 18:55:06,806 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@393f3749 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:55:06, skipping insertion in model container [2024-11-06 18:55:06,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:55:06" (3/3) ... [2024-11-06 18:55:06,807 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label29.c [2024-11-06 18:55:06,825 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 18:55:06,829 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 18:55:06,890 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 18:55:06,903 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;@4bf1155a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 18:55:06,907 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 18:55:06,913 INFO L276 IsEmpty]: Start isEmpty. Operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 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 18:55:06,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2024-11-06 18:55:06,922 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:06,922 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:55:06,922 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:06,926 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:06,926 INFO L85 PathProgramCache]: Analyzing trace with hash -1023341155, now seen corresponding path program 1 times [2024-11-06 18:55:06,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:06,932 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351692791] [2024-11-06 18:55:06,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:06,932 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:07,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:07,336 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 18:55:07,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:07,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351692791] [2024-11-06 18:55:07,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351692791] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:07,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:07,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:55:07,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572104606] [2024-11-06 18:55:07,341 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:07,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:07,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:07,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:07,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:07,361 INFO L87 Difference]: Start difference. First operand has 227 states, 225 states have (on average 1.6666666666666667) internal successors, (375), 226 states have internal predecessors, (375), 0 states have call successors, (0), 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 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 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 18:55:07,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:07,880 INFO L93 Difference]: Finished difference Result 639 states and 1082 transitions. [2024-11-06 18:55:07,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:07,886 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 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 102 [2024-11-06 18:55:07,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:07,899 INFO L225 Difference]: With dead ends: 639 [2024-11-06 18:55:07,899 INFO L226 Difference]: Without dead ends: 318 [2024-11-06 18:55:07,904 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 18:55:07,906 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 107 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 90 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 553 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 90 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:07,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 136 Invalid, 553 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [90 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 18:55:07,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states. [2024-11-06 18:55:07,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 313. [2024-11-06 18:55:07,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 312 states have (on average 1.4711538461538463) internal successors, (459), 312 states have internal predecessors, (459), 0 states have call successors, (0), 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 18:55:07,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 459 transitions. [2024-11-06 18:55:07,953 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 459 transitions. Word has length 102 [2024-11-06 18:55:07,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:07,954 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 459 transitions. [2024-11-06 18:55:07,954 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.0) internal successors, (102), 2 states have internal predecessors, (102), 0 states have call successors, (0), 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 18:55:07,954 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 459 transitions. [2024-11-06 18:55:07,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2024-11-06 18:55:07,955 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:07,956 INFO L215 NwaCegarLoop]: trace histogram [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] [2024-11-06 18:55:07,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 18:55:07,956 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:07,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:07,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1822434504, now seen corresponding path program 1 times [2024-11-06 18:55:07,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:07,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996711022] [2024-11-06 18:55:07,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:07,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:08,287 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:55:08,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:08,289 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996711022] [2024-11-06 18:55:08,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996711022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:08,290 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:08,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:08,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646084112] [2024-11-06 18:55:08,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:08,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:55:08,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:08,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:55:08,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:55:08,293 INFO L87 Difference]: Start difference. First operand 313 states and 459 transitions. Second operand has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 18:55:08,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:08,835 INFO L93 Difference]: Finished difference Result 989 states and 1492 transitions. [2024-11-06 18:55:08,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:55:08,835 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 106 [2024-11-06 18:55:08,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:08,839 INFO L225 Difference]: With dead ends: 989 [2024-11-06 18:55:08,839 INFO L226 Difference]: Without dead ends: 595 [2024-11-06 18:55:08,839 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 18:55:08,841 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 170 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 127 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 170 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 741 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 127 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:08,841 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [170 Valid, 106 Invalid, 741 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [127 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 18:55:08,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2024-11-06 18:55:08,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2024-11-06 18:55:08,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 595 states, 594 states have (on average 1.3383838383838385) internal successors, (795), 594 states have internal predecessors, (795), 0 states have call successors, (0), 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 18:55:08,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 795 transitions. [2024-11-06 18:55:08,857 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 795 transitions. Word has length 106 [2024-11-06 18:55:08,857 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:08,857 INFO L471 AbstractCegarLoop]: Abstraction has 595 states and 795 transitions. [2024-11-06 18:55:08,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 26.5) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 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 18:55:08,857 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 795 transitions. [2024-11-06 18:55:08,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-06 18:55:08,859 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:08,859 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:55:08,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 18:55:08,860 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:08,860 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:08,860 INFO L85 PathProgramCache]: Analyzing trace with hash -366751499, now seen corresponding path program 1 times [2024-11-06 18:55:08,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:08,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [689168628] [2024-11-06 18:55:08,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:08,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:08,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:09,013 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-06 18:55:09,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:09,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [689168628] [2024-11-06 18:55:09,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [689168628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:09,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:09,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:55:09,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026938082] [2024-11-06 18:55:09,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:09,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:09,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:09,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:09,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:09,016 INFO L87 Difference]: Start difference. First operand 595 states and 795 transitions. Second operand has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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 18:55:09,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:09,566 INFO L93 Difference]: Finished difference Result 1753 states and 2346 transitions. [2024-11-06 18:55:09,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:09,567 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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 132 [2024-11-06 18:55:09,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:09,570 INFO L225 Difference]: With dead ends: 1753 [2024-11-06 18:55:09,573 INFO L226 Difference]: Without dead ends: 1160 [2024-11-06 18:55:09,574 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 18:55:09,574 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 126 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:09,574 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 127 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-06 18:55:09,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2024-11-06 18:55:09,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 1157. [2024-11-06 18:55:09,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1157 states, 1156 states have (on average 1.2093425605536332) internal successors, (1398), 1156 states have internal predecessors, (1398), 0 states have call successors, (0), 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 18:55:09,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1157 states to 1157 states and 1398 transitions. [2024-11-06 18:55:09,609 INFO L78 Accepts]: Start accepts. Automaton has 1157 states and 1398 transitions. Word has length 132 [2024-11-06 18:55:09,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:09,609 INFO L471 AbstractCegarLoop]: Abstraction has 1157 states and 1398 transitions. [2024-11-06 18:55:09,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.333333333333336) internal successors, (127), 2 states have internal predecessors, (127), 0 states have call successors, (0), 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 18:55:09,610 INFO L276 IsEmpty]: Start isEmpty. Operand 1157 states and 1398 transitions. [2024-11-06 18:55:09,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-06 18:55:09,616 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:09,616 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 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] [2024-11-06 18:55:09,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 18:55:09,616 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:09,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:09,617 INFO L85 PathProgramCache]: Analyzing trace with hash 437422373, now seen corresponding path program 1 times [2024-11-06 18:55:09,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:09,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303273516] [2024-11-06 18:55:09,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:09,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:09,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:09,792 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-06 18:55:09,792 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:09,792 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303273516] [2024-11-06 18:55:09,792 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303273516] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:09,792 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:09,793 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:09,793 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737987150] [2024-11-06 18:55:09,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:09,793 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:09,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:09,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:09,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:09,798 INFO L87 Difference]: Start difference. First operand 1157 states and 1398 transitions. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 18:55:10,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:10,157 INFO L93 Difference]: Finished difference Result 2885 states and 3533 transitions. [2024-11-06 18:55:10,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:10,157 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 135 [2024-11-06 18:55:10,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:10,162 INFO L225 Difference]: With dead ends: 2885 [2024-11-06 18:55:10,162 INFO L226 Difference]: Without dead ends: 1730 [2024-11-06 18:55:10,163 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 18:55:10,164 INFO L432 NwaCegarLoop]: 227 mSDtfsCounter, 160 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 369 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:10,165 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [160 Valid, 252 Invalid, 431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 369 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:55:10,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1730 states. [2024-11-06 18:55:10,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1730 to 1728. [2024-11-06 18:55:10,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1728 states, 1727 states have (on average 1.1737116386797914) internal successors, (2027), 1727 states have internal predecessors, (2027), 0 states have call successors, (0), 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 18:55:10,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 2027 transitions. [2024-11-06 18:55:10,196 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 2027 transitions. Word has length 135 [2024-11-06 18:55:10,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:10,197 INFO L471 AbstractCegarLoop]: Abstraction has 1728 states and 2027 transitions. [2024-11-06 18:55:10,197 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 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 18:55:10,197 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2027 transitions. [2024-11-06 18:55:10,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-06 18:55:10,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:10,200 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:55:10,200 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 18:55:10,200 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:10,201 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:10,201 INFO L85 PathProgramCache]: Analyzing trace with hash -732116752, now seen corresponding path program 1 times [2024-11-06 18:55:10,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:10,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636945549] [2024-11-06 18:55:10,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:10,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:10,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:10,409 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:55:10,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:10,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636945549] [2024-11-06 18:55:10,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636945549] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:10,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:10,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:55:10,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430168116] [2024-11-06 18:55:10,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:10,411 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 18:55:10,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:10,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 18:55:10,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:55:10,412 INFO L87 Difference]: Start difference. First operand 1728 states and 2027 transitions. Second operand has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:11,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:11,020 INFO L93 Difference]: Finished difference Result 3594 states and 4226 transitions. [2024-11-06 18:55:11,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 18:55:11,021 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 135 [2024-11-06 18:55:11,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:11,027 INFO L225 Difference]: With dead ends: 3594 [2024-11-06 18:55:11,027 INFO L226 Difference]: Without dead ends: 1868 [2024-11-06 18:55:11,029 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:55:11,030 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 346 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 954 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 346 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 1031 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 954 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:11,030 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [346 Valid, 146 Invalid, 1031 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 954 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:55:11,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1868 states. [2024-11-06 18:55:11,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1868 to 1868. [2024-11-06 18:55:11,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1868 states, 1867 states have (on average 1.1633636850562399) internal successors, (2172), 1867 states have internal predecessors, (2172), 0 states have call successors, (0), 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 18:55:11,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1868 states to 1868 states and 2172 transitions. [2024-11-06 18:55:11,055 INFO L78 Accepts]: Start accepts. Automaton has 1868 states and 2172 transitions. Word has length 135 [2024-11-06 18:55:11,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:11,055 INFO L471 AbstractCegarLoop]: Abstraction has 1868 states and 2172 transitions. [2024-11-06 18:55:11,055 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.0) internal successors, (135), 4 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:11,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1868 states and 2172 transitions. [2024-11-06 18:55:11,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2024-11-06 18:55:11,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:11,058 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:55:11,058 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 18:55:11,058 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:11,059 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:11,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1220875275, now seen corresponding path program 1 times [2024-11-06 18:55:11,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:11,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881483428] [2024-11-06 18:55:11,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:11,059 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:11,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:11,153 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:55:11,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:11,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881483428] [2024-11-06 18:55:11,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881483428] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:11,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:11,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:11,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388094567] [2024-11-06 18:55:11,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:11,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:11,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:11,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:11,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:11,156 INFO L87 Difference]: Start difference. First operand 1868 states and 2172 transitions. Second operand has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:11,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:11,508 INFO L93 Difference]: Finished difference Result 4440 states and 5260 transitions. [2024-11-06 18:55:11,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:11,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 138 [2024-11-06 18:55:11,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:11,516 INFO L225 Difference]: With dead ends: 4440 [2024-11-06 18:55:11,516 INFO L226 Difference]: Without dead ends: 2574 [2024-11-06 18:55:11,518 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 18:55:11,519 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 149 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:11,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [149 Valid, 63 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:55:11,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2574 states. [2024-11-06 18:55:11,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2574 to 2429. [2024-11-06 18:55:11,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2429 states, 2428 states have (on average 1.191515650741351) internal successors, (2893), 2428 states have internal predecessors, (2893), 0 states have call successors, (0), 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 18:55:11,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2429 states to 2429 states and 2893 transitions. [2024-11-06 18:55:11,552 INFO L78 Accepts]: Start accepts. Automaton has 2429 states and 2893 transitions. Word has length 138 [2024-11-06 18:55:11,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:11,553 INFO L471 AbstractCegarLoop]: Abstraction has 2429 states and 2893 transitions. [2024-11-06 18:55:11,553 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:11,553 INFO L276 IsEmpty]: Start isEmpty. Operand 2429 states and 2893 transitions. [2024-11-06 18:55:11,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2024-11-06 18:55:11,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:11,555 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 18:55:11,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 18:55:11,555 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:11,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:11,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1202958953, now seen corresponding path program 1 times [2024-11-06 18:55:11,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:11,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095871813] [2024-11-06 18:55:11,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:11,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:11,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:11,650 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-06 18:55:11,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:11,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095871813] [2024-11-06 18:55:11,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1095871813] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:11,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:11,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:11,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1880683198] [2024-11-06 18:55:11,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:11,651 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:11,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:11,651 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:11,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:11,651 INFO L87 Difference]: Start difference. First operand 2429 states and 2893 transitions. Second operand has 3 states, 3 states have (on average 46.333333333333336) 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 18:55:11,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:11,987 INFO L93 Difference]: Finished difference Result 5270 states and 6315 transitions. [2024-11-06 18:55:11,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:11,988 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 46.333333333333336) 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 146 [2024-11-06 18:55:11,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:11,993 INFO L225 Difference]: With dead ends: 5270 [2024-11-06 18:55:11,993 INFO L226 Difference]: Without dead ends: 2416 [2024-11-06 18:55:11,996 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 18:55:11,996 INFO L432 NwaCegarLoop]: 244 mSDtfsCounter, 130 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:11,996 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 264 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:55:11,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2416 states. [2024-11-06 18:55:12,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2416 to 1996. [2024-11-06 18:55:12,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1996 states, 1995 states have (on average 1.1318295739348372) internal successors, (2258), 1995 states have internal predecessors, (2258), 0 states have call successors, (0), 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 18:55:12,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1996 states to 1996 states and 2258 transitions. [2024-11-06 18:55:12,021 INFO L78 Accepts]: Start accepts. Automaton has 1996 states and 2258 transitions. Word has length 146 [2024-11-06 18:55:12,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:12,022 INFO L471 AbstractCegarLoop]: Abstraction has 1996 states and 2258 transitions. [2024-11-06 18:55:12,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 46.333333333333336) 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 18:55:12,022 INFO L276 IsEmpty]: Start isEmpty. Operand 1996 states and 2258 transitions. [2024-11-06 18:55:12,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2024-11-06 18:55:12,024 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:12,024 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, 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] [2024-11-06 18:55:12,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-06 18:55:12,025 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:12,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:12,025 INFO L85 PathProgramCache]: Analyzing trace with hash -1646203778, now seen corresponding path program 1 times [2024-11-06 18:55:12,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:12,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273614830] [2024-11-06 18:55:12,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:12,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:12,126 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 90 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:55:12,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:12,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273614830] [2024-11-06 18:55:12,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273614830] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:12,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:12,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:12,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [694605485] [2024-11-06 18:55:12,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:12,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:12,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:12,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:12,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:12,128 INFO L87 Difference]: Start difference. First operand 1996 states and 2258 transitions. Second operand has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 18:55:12,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:12,478 INFO L93 Difference]: Finished difference Result 4692 states and 5372 transitions. [2024-11-06 18:55:12,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:12,479 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 164 [2024-11-06 18:55:12,479 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:12,485 INFO L225 Difference]: With dead ends: 4692 [2024-11-06 18:55:12,485 INFO L226 Difference]: Without dead ends: 2555 [2024-11-06 18:55:12,487 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 18:55:12,488 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 135 mSDsluCounter, 13 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 81 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 81 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:12,488 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 215 Invalid, 430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [81 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:55:12,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2555 states. [2024-11-06 18:55:12,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2555 to 2554. [2024-11-06 18:55:12,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2554 states, 2553 states have (on average 1.127301214257736) internal successors, (2878), 2553 states have internal predecessors, (2878), 0 states have call successors, (0), 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 18:55:12,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 2878 transitions. [2024-11-06 18:55:12,521 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 2878 transitions. Word has length 164 [2024-11-06 18:55:12,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:12,521 INFO L471 AbstractCegarLoop]: Abstraction has 2554 states and 2878 transitions. [2024-11-06 18:55:12,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.666666666666664) internal successors, (164), 3 states have internal predecessors, (164), 0 states have call successors, (0), 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 18:55:12,521 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 2878 transitions. [2024-11-06 18:55:12,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-06 18:55:12,524 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:12,524 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:55:12,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-06 18:55:12,524 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:12,524 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:12,524 INFO L85 PathProgramCache]: Analyzing trace with hash 242007546, now seen corresponding path program 1 times [2024-11-06 18:55:12,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:12,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244860080] [2024-11-06 18:55:12,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:12,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:12,722 INFO L134 CoverageAnalysis]: Checked inductivity of 139 backedges. 91 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-06 18:55:12,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:12,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244860080] [2024-11-06 18:55:12,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244860080] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:12,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:12,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:55:12,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473393416] [2024-11-06 18:55:12,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:12,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-06 18:55:12,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:12,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-06 18:55:12,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:55:12,725 INFO L87 Difference]: Start difference. First operand 2554 states and 2878 transitions. Second operand has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 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 18:55:13,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:13,455 INFO L93 Difference]: Finished difference Result 5386 states and 6060 transitions. [2024-11-06 18:55:13,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-06 18:55:13,455 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 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 184 [2024-11-06 18:55:13,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:13,461 INFO L225 Difference]: With dead ends: 5386 [2024-11-06 18:55:13,461 INFO L226 Difference]: Without dead ends: 2554 [2024-11-06 18:55:13,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-06 18:55:13,463 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 329 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 934 mSolverCounterSat, 52 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 329 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 52 IncrementalHoareTripleChecker+Valid, 934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:13,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [329 Valid, 125 Invalid, 986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [52 Valid, 934 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-06 18:55:13,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2554 states. [2024-11-06 18:55:13,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2554 to 2554. [2024-11-06 18:55:13,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2554 states, 2553 states have (on average 1.0971406188797492) internal successors, (2801), 2553 states have internal predecessors, (2801), 0 states have call successors, (0), 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 18:55:13,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 2801 transitions. [2024-11-06 18:55:13,493 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 2801 transitions. Word has length 184 [2024-11-06 18:55:13,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:13,494 INFO L471 AbstractCegarLoop]: Abstraction has 2554 states and 2801 transitions. [2024-11-06 18:55:13,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.2) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 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 18:55:13,494 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 2801 transitions. [2024-11-06 18:55:13,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-06 18:55:13,497 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:13,497 INFO L215 NwaCegarLoop]: trace histogram [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, 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] [2024-11-06 18:55:13,497 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-06 18:55:13,497 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:13,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:13,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1624903561, now seen corresponding path program 1 times [2024-11-06 18:55:13,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:13,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432272521] [2024-11-06 18:55:13,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:13,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:13,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:13,611 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 98 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-06 18:55:13,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:13,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432272521] [2024-11-06 18:55:13,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432272521] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:13,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:13,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:13,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403563131] [2024-11-06 18:55:13,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:13,612 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:13,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:13,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:13,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:13,613 INFO L87 Difference]: Start difference. First operand 2554 states and 2801 transitions. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 18:55:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:13,891 INFO L93 Difference]: Finished difference Result 5248 states and 5744 transitions. [2024-11-06 18:55:13,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:13,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 203 [2024-11-06 18:55:13,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:13,898 INFO L225 Difference]: With dead ends: 5248 [2024-11-06 18:55:13,898 INFO L226 Difference]: Without dead ends: 2556 [2024-11-06 18:55:13,900 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 18:55:13,902 INFO L432 NwaCegarLoop]: 175 mSDtfsCounter, 69 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 370 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:13,903 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 184 Invalid, 370 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:55:13,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2556 states. [2024-11-06 18:55:13,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2556 to 2554. [2024-11-06 18:55:13,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2554 states, 2553 states have (on average 1.0912651782217) internal successors, (2786), 2553 states have internal predecessors, (2786), 0 states have call successors, (0), 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 18:55:13,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2554 states to 2554 states and 2786 transitions. [2024-11-06 18:55:13,930 INFO L78 Accepts]: Start accepts. Automaton has 2554 states and 2786 transitions. Word has length 203 [2024-11-06 18:55:13,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:13,930 INFO L471 AbstractCegarLoop]: Abstraction has 2554 states and 2786 transitions. [2024-11-06 18:55:13,930 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 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 18:55:13,930 INFO L276 IsEmpty]: Start isEmpty. Operand 2554 states and 2786 transitions. [2024-11-06 18:55:13,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2024-11-06 18:55:13,933 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:13,934 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:55:13,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-06 18:55:13,934 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:13,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:13,934 INFO L85 PathProgramCache]: Analyzing trace with hash -758459016, now seen corresponding path program 1 times [2024-11-06 18:55:13,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:13,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719707019] [2024-11-06 18:55:13,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:13,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:13,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:14,038 INFO L134 CoverageAnalysis]: Checked inductivity of 131 backedges. 131 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:55:14,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:14,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719707019] [2024-11-06 18:55:14,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719707019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:14,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:14,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:14,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703517368] [2024-11-06 18:55:14,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:14,039 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:14,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:14,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:14,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:14,040 INFO L87 Difference]: Start difference. First operand 2554 states and 2786 transitions. Second operand has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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 18:55:14,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:14,309 INFO L93 Difference]: Finished difference Result 5109 states and 5576 transitions. [2024-11-06 18:55:14,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:14,310 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 205 [2024-11-06 18:55:14,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:14,315 INFO L225 Difference]: With dead ends: 5109 [2024-11-06 18:55:14,315 INFO L226 Difference]: Without dead ends: 2417 [2024-11-06 18:55:14,317 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 18:55:14,318 INFO L432 NwaCegarLoop]: 206 mSDtfsCounter, 91 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 312 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:14,318 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 225 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 312 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:55:14,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2417 states. [2024-11-06 18:55:14,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2417 to 2411. [2024-11-06 18:55:14,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2411 states, 2410 states have (on average 1.07551867219917) internal successors, (2592), 2410 states have internal predecessors, (2592), 0 states have call successors, (0), 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 18:55:14,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2411 states to 2411 states and 2592 transitions. [2024-11-06 18:55:14,343 INFO L78 Accepts]: Start accepts. Automaton has 2411 states and 2592 transitions. Word has length 205 [2024-11-06 18:55:14,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:14,344 INFO L471 AbstractCegarLoop]: Abstraction has 2411 states and 2592 transitions. [2024-11-06 18:55:14,344 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 68.33333333333333) internal successors, (205), 3 states have internal predecessors, (205), 0 states have call successors, (0), 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 18:55:14,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2411 states and 2592 transitions. [2024-11-06 18:55:14,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-06 18:55:14,347 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:14,347 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:55:14,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-06 18:55:14,347 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:14,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:14,347 INFO L85 PathProgramCache]: Analyzing trace with hash 446221282, now seen corresponding path program 1 times [2024-11-06 18:55:14,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:14,347 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565442644] [2024-11-06 18:55:14,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:14,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:14,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:14,409 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 166 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2024-11-06 18:55:14,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:14,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565442644] [2024-11-06 18:55:14,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565442644] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:14,410 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:14,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:14,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195990655] [2024-11-06 18:55:14,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:14,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:14,411 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:14,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:14,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:14,411 INFO L87 Difference]: Start difference. First operand 2411 states and 2592 transitions. Second operand has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 18:55:14,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:14,711 INFO L93 Difference]: Finished difference Result 5377 states and 5757 transitions. [2024-11-06 18:55:14,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:14,711 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 209 [2024-11-06 18:55:14,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:14,717 INFO L225 Difference]: With dead ends: 5377 [2024-11-06 18:55:14,717 INFO L226 Difference]: Without dead ends: 2686 [2024-11-06 18:55:14,720 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 18:55:14,720 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 137 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:14,721 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 33 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:55:14,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2686 states. [2024-11-06 18:55:14,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2686 to 2406. [2024-11-06 18:55:14,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2406 states, 2405 states have (on average 1.0553014553014552) internal successors, (2538), 2405 states have internal predecessors, (2538), 0 states have call successors, (0), 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 18:55:14,754 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2406 states to 2406 states and 2538 transitions. [2024-11-06 18:55:14,754 INFO L78 Accepts]: Start accepts. Automaton has 2406 states and 2538 transitions. Word has length 209 [2024-11-06 18:55:14,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:14,754 INFO L471 AbstractCegarLoop]: Abstraction has 2406 states and 2538 transitions. [2024-11-06 18:55:14,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 58.666666666666664) internal successors, (176), 3 states have internal predecessors, (176), 0 states have call successors, (0), 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 18:55:14,754 INFO L276 IsEmpty]: Start isEmpty. Operand 2406 states and 2538 transitions. [2024-11-06 18:55:14,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2024-11-06 18:55:14,758 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:14,758 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2024-11-06 18:55:14,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-06 18:55:14,758 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:14,758 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:14,759 INFO L85 PathProgramCache]: Analyzing trace with hash -572107439, now seen corresponding path program 1 times [2024-11-06 18:55:14,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:14,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844166422] [2024-11-06 18:55:14,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:14,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:14,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:14,855 INFO L134 CoverageAnalysis]: Checked inductivity of 214 backedges. 156 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-06 18:55:14,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:14,856 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844166422] [2024-11-06 18:55:14,856 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844166422] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:14,856 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:14,856 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:14,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1264061835] [2024-11-06 18:55:14,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:14,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:14,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:14,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:14,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:14,858 INFO L87 Difference]: Start difference. First operand 2406 states and 2538 transitions. Second operand has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 18:55:15,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:15,113 INFO L93 Difference]: Finished difference Result 3960 states and 4166 transitions. [2024-11-06 18:55:15,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:15,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 220 [2024-11-06 18:55:15,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:15,117 INFO L225 Difference]: With dead ends: 3960 [2024-11-06 18:55:15,117 INFO L226 Difference]: Without dead ends: 1556 [2024-11-06 18:55:15,119 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 18:55:15,120 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 142 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:15,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 44 Invalid, 325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 18:55:15,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2024-11-06 18:55:15,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1416. [2024-11-06 18:55:15,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1415 states have (on average 1.0325088339222614) internal successors, (1461), 1415 states have internal predecessors, (1461), 0 states have call successors, (0), 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 18:55:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 1461 transitions. [2024-11-06 18:55:15,134 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 1461 transitions. Word has length 220 [2024-11-06 18:55:15,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:15,134 INFO L471 AbstractCegarLoop]: Abstraction has 1416 states and 1461 transitions. [2024-11-06 18:55:15,134 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.0) internal successors, (177), 3 states have internal predecessors, (177), 0 states have call successors, (0), 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 18:55:15,134 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1461 transitions. [2024-11-06 18:55:15,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2024-11-06 18:55:15,136 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:15,137 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 18:55:15,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-06 18:55:15,137 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:15,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:15,138 INFO L85 PathProgramCache]: Analyzing trace with hash 498674600, now seen corresponding path program 1 times [2024-11-06 18:55:15,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:15,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1275756680] [2024-11-06 18:55:15,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:15,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:15,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:15,408 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 237 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2024-11-06 18:55:15,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:15,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1275756680] [2024-11-06 18:55:15,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1275756680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:15,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:15,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-06 18:55:15,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928410413] [2024-11-06 18:55:15,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:15,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-06 18:55:15,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:15,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-06 18:55:15,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:55:15,413 INFO L87 Difference]: Start difference. First operand 1416 states and 1461 transitions. Second operand has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 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 18:55:15,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:15,773 INFO L93 Difference]: Finished difference Result 2265 states and 2336 transitions. [2024-11-06 18:55:15,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-06 18:55:15,773 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 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 234 [2024-11-06 18:55:15,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:15,776 INFO L225 Difference]: With dead ends: 2265 [2024-11-06 18:55:15,776 INFO L226 Difference]: Without dead ends: 1417 [2024-11-06 18:55:15,777 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-06 18:55:15,777 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 370 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 370 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:15,777 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [370 Valid, 193 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:55:15,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1417 states. [2024-11-06 18:55:15,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1417 to 1416. [2024-11-06 18:55:15,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1416 states, 1415 states have (on average 1.031095406360424) internal successors, (1459), 1415 states have internal predecessors, (1459), 0 states have call successors, (0), 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 18:55:15,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1416 states to 1416 states and 1459 transitions. [2024-11-06 18:55:15,790 INFO L78 Accepts]: Start accepts. Automaton has 1416 states and 1459 transitions. Word has length 234 [2024-11-06 18:55:15,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:15,790 INFO L471 AbstractCegarLoop]: Abstraction has 1416 states and 1459 transitions. [2024-11-06 18:55:15,790 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 51.0) internal successors, (204), 4 states have internal predecessors, (204), 0 states have call successors, (0), 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 18:55:15,790 INFO L276 IsEmpty]: Start isEmpty. Operand 1416 states and 1459 transitions. [2024-11-06 18:55:15,793 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2024-11-06 18:55:15,793 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:15,793 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 2, 2, 2, 2, 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] [2024-11-06 18:55:15,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-06 18:55:15,793 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:15,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:15,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1837920194, now seen corresponding path program 1 times [2024-11-06 18:55:15,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:15,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454187282] [2024-11-06 18:55:15,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:15,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:15,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:15,988 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 209 proven. 15 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2024-11-06 18:55:15,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:15,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454187282] [2024-11-06 18:55:15,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454187282] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-06 18:55:15,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [367402565] [2024-11-06 18:55:15,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:15,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-06 18:55:15,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:55:15,991 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 18:55:15,992 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 18:55:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:16,096 INFO L255 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-06 18:55:16,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-06 18:55:16,375 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 270 trivial. 0 not checked. [2024-11-06 18:55:16,375 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-06 18:55:16,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [367402565] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:16,375 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-06 18:55:16,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-06 18:55:16,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113663983] [2024-11-06 18:55:16,376 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:16,376 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:16,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:16,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:16,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:55:16,376 INFO L87 Difference]: Start difference. First operand 1416 states and 1459 transitions. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 18:55:16,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:16,512 INFO L93 Difference]: Finished difference Result 1416 states and 1459 transitions. [2024-11-06 18:55:16,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:16,512 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 256 [2024-11-06 18:55:16,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:16,513 INFO L225 Difference]: With dead ends: 1416 [2024-11-06 18:55:16,513 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 18:55:16,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-06 18:55:16,515 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 71 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:16,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 16 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-06 18:55:16,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 18:55:16,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 18:55:16,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:16,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 18:55:16,516 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 256 [2024-11-06 18:55:16,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:16,516 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 18:55:16,516 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 2 states have internal predecessors, (109), 0 states have call successors, (0), 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 18:55:16,516 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 18:55:16,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 18:55:16,518 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 18:55:16,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-06 18:55:16,722 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-06 18:55:16,725 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:55:16,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 18:55:16,985 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 18:55:16,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 06:55:16 BoogieIcfgContainer [2024-11-06 18:55:16,999 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 18:55:16,999 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 18:55:16,999 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 18:55:16,999 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 18:55:17,000 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:55:06" (3/4) ... [2024-11-06 18:55:17,004 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 18:55:17,017 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-06 18:55:17,018 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 18:55:17,018 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 18:55:17,019 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 18:55:17,109 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 18:55:17,111 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 18:55:17,111 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 18:55:17,112 INFO L158 Benchmark]: Toolchain (without parser) took 11653.83ms. Allocated memory was 117.4MB in the beginning and 327.2MB in the end (delta: 209.7MB). Free memory was 90.2MB in the beginning and 248.0MB in the end (delta: -157.8MB). Peak memory consumption was 53.7MB. Max. memory is 16.1GB. [2024-11-06 18:55:17,112 INFO L158 Benchmark]: CDTParser took 0.64ms. Allocated memory is still 117.4MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:55:17,112 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.19ms. Allocated memory is still 117.4MB. Free memory was 90.1MB in the beginning and 64.5MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-06 18:55:17,112 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.77ms. Allocated memory is still 117.4MB. Free memory was 64.5MB in the beginning and 59.3MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:55:17,113 INFO L158 Benchmark]: Boogie Preprocessor took 45.67ms. Allocated memory is still 117.4MB. Free memory was 59.3MB in the beginning and 54.7MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:55:17,113 INFO L158 Benchmark]: RCFGBuilder took 871.38ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 54.6MB in the beginning and 109.7MB in the end (delta: -55.1MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2024-11-06 18:55:17,113 INFO L158 Benchmark]: TraceAbstraction took 10200.64ms. Allocated memory was 159.4MB in the beginning and 327.2MB in the end (delta: 167.8MB). Free memory was 109.0MB in the beginning and 260.0MB in the end (delta: -151.0MB). Peak memory consumption was 175.6MB. Max. memory is 16.1GB. [2024-11-06 18:55:17,113 INFO L158 Benchmark]: Witness Printer took 111.98ms. Allocated memory is still 327.2MB. Free memory was 260.0MB in the beginning and 248.0MB in the end (delta: 12.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-06 18:55:17,115 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.64ms. Allocated memory is still 117.4MB. Free memory is still 82.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.19ms. Allocated memory is still 117.4MB. Free memory was 90.1MB in the beginning and 64.5MB in the end (delta: 25.5MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.77ms. Allocated memory is still 117.4MB. Free memory was 64.5MB in the beginning and 59.3MB in the end (delta: 5.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.67ms. Allocated memory is still 117.4MB. Free memory was 59.3MB in the beginning and 54.7MB in the end (delta: 4.6MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 871.38ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 54.6MB in the beginning and 109.7MB in the end (delta: -55.1MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * TraceAbstraction took 10200.64ms. Allocated memory was 159.4MB in the beginning and 327.2MB in the end (delta: 167.8MB). Free memory was 109.0MB in the beginning and 260.0MB in the end (delta: -151.0MB). Peak memory consumption was 175.6MB. Max. memory is 16.1GB. * Witness Printer took 111.98ms. Allocated memory is still 327.2MB. Free memory was 260.0MB in the beginning and 248.0MB in the end (delta: 12.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 488]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 227 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 9.9s, OverallIterations: 15, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 6.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2532 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2532 mSDsluCounter, 2129 SdHoareTripleChecker+Invalid, 4.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 328 mSDsCounter, 903 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 6627 IncrementalHoareTripleChecker+Invalid, 7530 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 903 mSolverCounterUnsat, 1801 mSDtfsCounter, 6627 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 305 GetRequests, 280 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2554occurred in iteration=8, InterpolantAutomatonStates: 51, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 15 MinimizatonAttempts, 1005 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 2825 NumberOfCodeBlocks, 2825 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2809 ConstructedInterpolants, 0 QuantifiedInterpolants, 6760 SizeOfPredicates, 0 NumberOfNonLiveVariables, 416 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 16 InterpolantComputations, 15 PerfectInterpolantSequences, 1992/2007 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 616]: Loop Invariant Derived loop invariant: ((((((((((((((a17 <= 7) && (a25 <= 0)) || (((((a17 == 8) && (a28 == 10)) && (a21 == 1)) && (a19 == 1)) && (a11 != 1))) || (((a19 == 0) && (a28 <= 7)) && (a25 <= 0))) || ((((((a17 == 8) && (a21 == 1)) && (a19 == 1)) && (a11 != 1)) && (a28 <= 7)) && (a25 <= 0))) || ((((((a17 == 8) && (a25 == 1)) && (a28 == 11)) && (a21 == 1)) && (a19 == 1)) && (a11 != 1))) || ((((((a17 == 8) && (9 <= a28)) && (a25 == 1)) && (a21 == 1)) && (a28 <= 10)) && (a19 == 1))) || (((((a19 == 0) && (a25 == 1)) && (8 <= a17)) && (a11 != 1)) && (a28 <= 7))) || ((((a19 == 0) && (a25 == 1)) && (a28 == 10)) && (a11 != 1))) || (((a19 == 0) && (a11 != 1)) && (a25 <= 0))) || ((a17 <= 7) && (8 <= a28))) || ((((a25 == 1) && (a28 <= 10)) && (a19 == 1)) && (a11 != 1))) || ((((((a17 == 8) && (9 <= a28)) && (a21 == 1)) && (a28 <= 10)) && (a19 == 1)) && (a25 <= 0))) || (((a25 == 1) && (a19 == 1)) && (a28 <= 7))) RESULT: Ultimate proved your program to be correct! [2024-11-06 18:55:17,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE