./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem02_label56.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_label56.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', 'c32a1c240fa08c94c8e2d9ef78c149e9bedee3c9a83e144197714b3e6496faaf'] 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_label56.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 c32a1c240fa08c94c8e2d9ef78c149e9bedee3c9a83e144197714b3e6496faaf --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-06 18:55:29,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-06 18:55:29,741 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:29,745 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-06 18:55:29,745 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-06 18:55:29,764 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-06 18:55:29,764 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-06 18:55:29,764 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-06 18:55:29,765 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-06 18:55:29,765 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-06 18:55:29,765 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-06 18:55:29,765 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-06 18:55:29,765 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-06 18:55:29,765 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-06 18:55:29,765 INFO L153 SettingsManager]: * Use SBE=true [2024-11-06 18:55:29,765 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-06 18:55:29,765 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-06 18:55:29,765 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-06 18:55:29,766 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-06 18:55:29,766 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-06 18:55:29,766 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-06 18:55:29,766 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-06 18:55:29,766 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-06 18:55:29,766 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-06 18:55:29,766 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-06 18:55:29,766 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-06 18:55:29,766 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-06 18:55:29,766 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-06 18:55:29,766 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-06 18:55:29,766 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-06 18:55:29,766 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-06 18:55:29,766 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-06 18:55:29,766 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:55:29,766 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-06 18:55:29,766 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-06 18:55:29,767 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-06 18:55:29,767 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-06 18:55:29,767 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-06 18:55:29,767 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-06 18:55:29,767 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-06 18:55:29,767 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-06 18:55:29,767 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-06 18:55:29,767 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 -> c32a1c240fa08c94c8e2d9ef78c149e9bedee3c9a83e144197714b3e6496faaf [2024-11-06 18:55:30,014 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-06 18:55:30,024 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-06 18:55:30,028 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-06 18:55:30,029 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-06 18:55:30,031 INFO L274 PluginConnector]: CDTParser initialized [2024-11-06 18:55:30,032 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem02_label56.c [2024-11-06 18:55:31,189 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-06 18:55:31,447 INFO L384 CDTParser]: Found 1 translation units. [2024-11-06 18:55:31,449 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem02_label56.c [2024-11-06 18:55:31,462 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9de7602b/491ff48406a9401ebb4b263d326ac90b/FLAG7abc41a63 [2024-11-06 18:55:31,479 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/a9de7602b/491ff48406a9401ebb4b263d326ac90b [2024-11-06 18:55:31,481 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-06 18:55:31,483 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-06 18:55:31,485 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-06 18:55:31,488 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-06 18:55:31,491 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-06 18:55:31,492 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:55:31" (1/1) ... [2024-11-06 18:55:31,493 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4d8c71e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:31, skipping insertion in model container [2024-11-06 18:55:31,493 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:55:31" (1/1) ... [2024-11-06 18:55:31,524 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-06 18:55:31,781 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_label56.c[19398,19411] [2024-11-06 18:55:31,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:55:31,828 INFO L200 MainTranslator]: Completed pre-run [2024-11-06 18:55:31,880 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_label56.c[19398,19411] [2024-11-06 18:55:31,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-06 18:55:31,911 INFO L204 MainTranslator]: Completed translation [2024-11-06 18:55:31,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:31 WrapperNode [2024-11-06 18:55:31,912 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-06 18:55:31,914 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-06 18:55:31,914 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-06 18:55:31,915 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-06 18:55:31,920 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:31" (1/1) ... [2024-11-06 18:55:31,934 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:31" (1/1) ... [2024-11-06 18:55:31,981 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 669 [2024-11-06 18:55:31,984 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-06 18:55:31,984 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-06 18:55:31,984 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-06 18:55:31,985 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-06 18:55:31,992 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:31" (1/1) ... [2024-11-06 18:55:31,992 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:31" (1/1) ... [2024-11-06 18:55:31,998 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:31" (1/1) ... [2024-11-06 18:55:32,026 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:32,027 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:31" (1/1) ... [2024-11-06 18:55:32,027 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:31" (1/1) ... [2024-11-06 18:55:32,046 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:31" (1/1) ... [2024-11-06 18:55:32,058 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:31" (1/1) ... [2024-11-06 18:55:32,061 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:31" (1/1) ... [2024-11-06 18:55:32,071 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:31" (1/1) ... [2024-11-06 18:55:32,075 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-06 18:55:32,080 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-06 18:55:32,080 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-06 18:55:32,080 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-06 18:55:32,081 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:31" (1/1) ... [2024-11-06 18:55:32,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-06 18:55:32,104 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-06 18:55:32,117 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:32,120 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:32,144 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-06 18:55:32,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-06 18:55:32,144 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-06 18:55:32,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-06 18:55:32,204 INFO L238 CfgBuilder]: Building ICFG [2024-11-06 18:55:32,206 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-06 18:55:33,037 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-06 18:55:33,038 INFO L287 CfgBuilder]: Performing block encoding [2024-11-06 18:55:33,051 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-06 18:55:33,053 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-06 18:55:33,053 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:55:33 BoogieIcfgContainer [2024-11-06 18:55:33,053 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-06 18:55:33,055 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-06 18:55:33,056 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-06 18:55:33,059 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-06 18:55:33,059 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:55:31" (1/3) ... [2024-11-06 18:55:33,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68323e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:55:33, skipping insertion in model container [2024-11-06 18:55:33,060 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:55:31" (2/3) ... [2024-11-06 18:55:33,060 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68323e48 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:55:33, skipping insertion in model container [2024-11-06 18:55:33,061 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:55:33" (3/3) ... [2024-11-06 18:55:33,062 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem02_label56.c [2024-11-06 18:55:33,073 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-06 18:55:33,073 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-06 18:55:33,129 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-06 18:55:33,139 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;@4a7bf6bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-06 18:55:33,140 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-06 18:55:33,144 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:33,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-06 18:55:33,151 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:33,152 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, 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:33,153 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:33,155 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:33,156 INFO L85 PathProgramCache]: Analyzing trace with hash 320353043, now seen corresponding path program 1 times [2024-11-06 18:55:33,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:33,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768441483] [2024-11-06 18:55:33,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:33,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:33,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:33,589 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:33,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:33,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768441483] [2024-11-06 18:55:33,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768441483] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:33,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:33,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:55:33,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542448865] [2024-11-06 18:55:33,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:33,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:33,601 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:33,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:33,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:33,621 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 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 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:34,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:34,251 INFO L93 Difference]: Finished difference Result 601 states and 1035 transitions. [2024-11-06 18:55:34,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:34,254 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 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 123 [2024-11-06 18:55:34,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:34,262 INFO L225 Difference]: With dead ends: 601 [2024-11-06 18:55:34,262 INFO L226 Difference]: Without dead ends: 310 [2024-11-06 18:55:34,268 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:34,270 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 111 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:34,270 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 116 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-06 18:55:34,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 310 states. [2024-11-06 18:55:34,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 310 to 310. [2024-11-06 18:55:34,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 309 states have (on average 1.4368932038834952) internal successors, (444), 309 states have internal predecessors, (444), 0 states have call successors, (0), 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:34,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 444 transitions. [2024-11-06 18:55:34,328 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 444 transitions. Word has length 123 [2024-11-06 18:55:34,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:34,330 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 444 transitions. [2024-11-06 18:55:34,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 2 states have internal predecessors, (123), 0 states have call successors, (0), 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:34,331 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 444 transitions. [2024-11-06 18:55:34,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-06 18:55:34,338 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:34,338 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:55:34,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-06 18:55:34,339 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:34,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:34,340 INFO L85 PathProgramCache]: Analyzing trace with hash -1067791246, now seen corresponding path program 1 times [2024-11-06 18:55:34,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:34,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170062677] [2024-11-06 18:55:34,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:34,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:34,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:34,533 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:55:34,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:34,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170062677] [2024-11-06 18:55:34,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170062677] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:34,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:34,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:55:34,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967333755] [2024-11-06 18:55:34,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:34,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:34,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:34,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:34,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:34,538 INFO L87 Difference]: Start difference. First operand 310 states and 444 transitions. Second operand has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 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:34,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:34,922 INFO L93 Difference]: Finished difference Result 913 states and 1314 transitions. [2024-11-06 18:55:34,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:34,922 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 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 141 [2024-11-06 18:55:34,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:34,927 INFO L225 Difference]: With dead ends: 913 [2024-11-06 18:55:34,929 INFO L226 Difference]: Without dead ends: 605 [2024-11-06 18:55:34,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:34,931 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 158 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 373 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 432 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:34,931 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 97 Invalid, 432 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 373 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-06 18:55:34,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 605 states. [2024-11-06 18:55:34,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 605 to 598. [2024-11-06 18:55:34,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 597 states have (on average 1.3969849246231156) internal successors, (834), 597 states have internal predecessors, (834), 0 states have call successors, (0), 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:34,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 834 transitions. [2024-11-06 18:55:34,963 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 834 transitions. Word has length 141 [2024-11-06 18:55:34,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:34,963 INFO L471 AbstractCegarLoop]: Abstraction has 598 states and 834 transitions. [2024-11-06 18:55:34,964 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.0) internal successors, (141), 2 states have internal predecessors, (141), 0 states have call successors, (0), 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:34,964 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 834 transitions. [2024-11-06 18:55:34,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2024-11-06 18:55:34,966 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:34,966 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:55:34,966 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-06 18:55:34,966 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:34,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:34,967 INFO L85 PathProgramCache]: Analyzing trace with hash -2139691502, now seen corresponding path program 1 times [2024-11-06 18:55:34,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:34,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083808854] [2024-11-06 18:55:34,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:34,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:35,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:35,098 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:55:35,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:35,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083808854] [2024-11-06 18:55:35,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083808854] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:35,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:35,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-06 18:55:35,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905147177] [2024-11-06 18:55:35,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:35,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:35,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:35,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:35,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:35,100 INFO L87 Difference]: Start difference. First operand 598 states and 834 transitions. Second operand has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 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:35,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:35,316 INFO L93 Difference]: Finished difference Result 1181 states and 1650 transitions. [2024-11-06 18:55:35,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:35,317 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 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 142 [2024-11-06 18:55:35,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:35,319 INFO L225 Difference]: With dead ends: 1181 [2024-11-06 18:55:35,319 INFO L226 Difference]: Without dead ends: 585 [2024-11-06 18:55:35,321 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:35,321 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 195 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 199 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 199 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:35,322 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 23 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 199 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-06 18:55:35,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2024-11-06 18:55:35,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2024-11-06 18:55:35,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 585 states, 584 states have (on average 1.297945205479452) internal successors, (758), 584 states have internal predecessors, (758), 0 states have call successors, (0), 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:35,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 758 transitions. [2024-11-06 18:55:35,344 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 758 transitions. Word has length 142 [2024-11-06 18:55:35,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:35,345 INFO L471 AbstractCegarLoop]: Abstraction has 585 states and 758 transitions. [2024-11-06 18:55:35,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.333333333333336) internal successors, (142), 2 states have internal predecessors, (142), 0 states have call successors, (0), 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:35,345 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 758 transitions. [2024-11-06 18:55:35,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-06 18:55:35,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:35,347 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:55:35,347 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-06 18:55:35,347 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:35,347 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:35,347 INFO L85 PathProgramCache]: Analyzing trace with hash -460895513, now seen corresponding path program 1 times [2024-11-06 18:55:35,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:35,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817078963] [2024-11-06 18:55:35,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:35,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:35,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:35,478 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-06 18:55:35,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:35,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817078963] [2024-11-06 18:55:35,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817078963] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:35,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:35,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:35,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175451662] [2024-11-06 18:55:35,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:35,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:35,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:35,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:35,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:35,482 INFO L87 Difference]: Start difference. First operand 585 states and 758 transitions. Second operand has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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:35,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:35,844 INFO L93 Difference]: Finished difference Result 1728 states and 2241 transitions. [2024-11-06 18:55:35,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:35,845 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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 145 [2024-11-06 18:55:35,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:35,851 INFO L225 Difference]: With dead ends: 1728 [2024-11-06 18:55:35,851 INFO L226 Difference]: Without dead ends: 1145 [2024-11-06 18:55:35,853 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:35,853 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 137 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 344 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 344 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:35,853 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 76 Invalid, 413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 344 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:55:35,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2024-11-06 18:55:35,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1145. [2024-11-06 18:55:35,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1145 states, 1144 states have (on average 1.2386363636363635) internal successors, (1417), 1144 states have internal predecessors, (1417), 0 states have call successors, (0), 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:35,881 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1145 states to 1145 states and 1417 transitions. [2024-11-06 18:55:35,881 INFO L78 Accepts]: Start accepts. Automaton has 1145 states and 1417 transitions. Word has length 145 [2024-11-06 18:55:35,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:35,882 INFO L471 AbstractCegarLoop]: Abstraction has 1145 states and 1417 transitions. [2024-11-06 18:55:35,882 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 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:35,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1145 states and 1417 transitions. [2024-11-06 18:55:35,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-06 18:55:35,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:35,884 INFO L215 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-06 18:55:35,884 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-06 18:55:35,884 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:35,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:35,885 INFO L85 PathProgramCache]: Analyzing trace with hash 1253358066, now seen corresponding path program 1 times [2024-11-06 18:55:35,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:35,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202815720] [2024-11-06 18:55:35,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:35,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:35,972 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-06 18:55:35,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:35,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202815720] [2024-11-06 18:55:35,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202815720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:35,973 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:35,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:35,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939254434] [2024-11-06 18:55:35,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:35,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:35,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:35,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:35,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:35,975 INFO L87 Difference]: Start difference. First operand 1145 states and 1417 transitions. Second operand has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:36,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:36,328 INFO L93 Difference]: Finished difference Result 2288 states and 2833 transitions. [2024-11-06 18:55:36,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:36,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 150 [2024-11-06 18:55:36,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:36,333 INFO L225 Difference]: With dead ends: 2288 [2024-11-06 18:55:36,333 INFO L226 Difference]: Without dead ends: 1145 [2024-11-06 18:55:36,334 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:36,335 INFO L432 NwaCegarLoop]: 229 mSDtfsCounter, 156 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:36,335 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 251 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:55:36,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1145 states. [2024-11-06 18:55:36,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1145 to 1142. [2024-11-06 18:55:36,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1142 states, 1141 states have (on average 1.1840490797546013) internal successors, (1351), 1141 states have internal predecessors, (1351), 0 states have call successors, (0), 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:36,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1142 states to 1142 states and 1351 transitions. [2024-11-06 18:55:36,359 INFO L78 Accepts]: Start accepts. Automaton has 1142 states and 1351 transitions. Word has length 150 [2024-11-06 18:55:36,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:36,360 INFO L471 AbstractCegarLoop]: Abstraction has 1142 states and 1351 transitions. [2024-11-06 18:55:36,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.333333333333336) internal successors, (133), 3 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-06 18:55:36,360 INFO L276 IsEmpty]: Start isEmpty. Operand 1142 states and 1351 transitions. [2024-11-06 18:55:36,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-11-06 18:55:36,362 INFO L207 NwaCegarLoop]: Found error trace [2024-11-06 18:55:36,362 INFO L215 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:36,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-06 18:55:36,362 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-06 18:55:36,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-06 18:55:36,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1832816017, now seen corresponding path program 1 times [2024-11-06 18:55:36,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-06 18:55:36,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770831893] [2024-11-06 18:55:36,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-06 18:55:36,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-06 18:55:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-06 18:55:36,531 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-06 18:55:36,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-06 18:55:36,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770831893] [2024-11-06 18:55:36,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770831893] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-06 18:55:36,531 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-06 18:55:36,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-06 18:55:36,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360612115] [2024-11-06 18:55:36,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-06 18:55:36,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-06 18:55:36,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-06 18:55:36,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-06 18:55:36,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:36,533 INFO L87 Difference]: Start difference. First operand 1142 states and 1351 transitions. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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:36,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-06 18:55:36,888 INFO L93 Difference]: Finished difference Result 2698 states and 3182 transitions. [2024-11-06 18:55:36,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-06 18:55:36,888 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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 150 [2024-11-06 18:55:36,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-06 18:55:36,889 INFO L225 Difference]: With dead ends: 2698 [2024-11-06 18:55:36,889 INFO L226 Difference]: Without dead ends: 0 [2024-11-06 18:55:36,891 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-06 18:55:36,892 INFO L432 NwaCegarLoop]: 222 mSDtfsCounter, 21 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 326 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-06 18:55:36,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 240 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 326 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-06 18:55:36,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-06 18:55:36,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-06 18:55:36,893 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:36,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-06 18:55:36,893 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 150 [2024-11-06 18:55:36,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-06 18:55:36,893 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-06 18:55:36,893 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 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:36,893 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-06 18:55:36,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-06 18:55:36,895 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-06 18:55:36,896 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-06 18:55:36,898 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-06 18:55:36,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-06 18:55:36,962 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-06 18:55:36,975 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 06:55:36 BoogieIcfgContainer [2024-11-06 18:55:36,975 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-06 18:55:36,975 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-06 18:55:36,975 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-06 18:55:36,975 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-06 18:55:36,976 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:33" (3/4) ... [2024-11-06 18:55:36,978 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-06 18:55:36,992 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2024-11-06 18:55:36,993 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-06 18:55:36,994 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-11-06 18:55:36,994 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-06 18:55:37,093 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-06 18:55:37,094 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-06 18:55:37,094 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-06 18:55:37,095 INFO L158 Benchmark]: Toolchain (without parser) took 5611.35ms. Allocated memory was 109.1MB in the beginning and 167.8MB in the end (delta: 58.7MB). Free memory was 83.9MB in the beginning and 134.7MB in the end (delta: -50.8MB). Peak memory consumption was 105.1MB. Max. memory is 16.1GB. [2024-11-06 18:55:37,095 INFO L158 Benchmark]: CDTParser took 0.78ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:55:37,095 INFO L158 Benchmark]: CACSL2BoogieTranslator took 427.52ms. Allocated memory is still 109.1MB. Free memory was 83.9MB in the beginning and 58.1MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-06 18:55:37,097 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.80ms. Allocated memory is still 109.1MB. Free memory was 58.1MB in the beginning and 53.0MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-06 18:55:37,098 INFO L158 Benchmark]: Boogie Preprocessor took 94.71ms. Allocated memory is still 109.1MB. Free memory was 53.0MB in the beginning and 48.3MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-06 18:55:37,098 INFO L158 Benchmark]: RCFGBuilder took 974.01ms. Allocated memory is still 109.1MB. Free memory was 48.3MB in the beginning and 60.9MB in the end (delta: -12.6MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. [2024-11-06 18:55:37,098 INFO L158 Benchmark]: TraceAbstraction took 3919.58ms. Allocated memory was 109.1MB in the beginning and 167.8MB in the end (delta: 58.7MB). Free memory was 60.9MB in the beginning and 52.3MB in the end (delta: 8.7MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. [2024-11-06 18:55:37,099 INFO L158 Benchmark]: Witness Printer took 118.47ms. Allocated memory is still 167.8MB. Free memory was 52.3MB in the beginning and 134.7MB in the end (delta: -82.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-06 18:55:37,101 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.78ms. Allocated memory is still 83.9MB. Free memory is still 48.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 427.52ms. Allocated memory is still 109.1MB. Free memory was 83.9MB in the beginning and 58.1MB in the end (delta: 25.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.80ms. Allocated memory is still 109.1MB. Free memory was 58.1MB in the beginning and 53.0MB in the end (delta: 5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 94.71ms. Allocated memory is still 109.1MB. Free memory was 53.0MB in the beginning and 48.3MB in the end (delta: 4.7MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 974.01ms. Allocated memory is still 109.1MB. Free memory was 48.3MB in the beginning and 60.9MB in the end (delta: -12.6MB). Peak memory consumption was 32.1MB. Max. memory is 16.1GB. * TraceAbstraction took 3919.58ms. Allocated memory was 109.1MB in the beginning and 167.8MB in the end (delta: 58.7MB). Free memory was 60.9MB in the beginning and 52.3MB in the end (delta: 8.7MB). Peak memory consumption was 62.2MB. Max. memory is 16.1GB. * Witness Printer took 118.47ms. Allocated memory is still 167.8MB. Free memory was 52.3MB in the beginning and 134.7MB in the end (delta: -82.4MB). 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: 551]: 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: 3.8s, OverallIterations: 6, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 778 SdHoareTripleChecker+Valid, 2.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 778 mSDsluCounter, 803 SdHoareTripleChecker+Invalid, 1.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 97 mSDsCounter, 397 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1986 IncrementalHoareTripleChecker+Invalid, 2383 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 397 mSolverCounterUnsat, 706 mSDtfsCounter, 1986 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1145occurred in iteration=4, InterpolantAutomatonStates: 18, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 851 NumberOfCodeBlocks, 851 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 845 ConstructedInterpolants, 0 QuantifiedInterpolants, 1449 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 130/130 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)) || ((a25 == 1) && (a17 <= 8))) || (((a17 <= 8) && (a19 == 1)) && (a25 <= 0))) || (((a28 <= 9) && (a17 <= 8)) && (a25 <= 0))) RESULT: Ultimate proved your program to be correct! [2024-11-06 18:55:37,127 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE