./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/eca-rers2012/Problem01_label04.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/Problem01_label04.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', 'f3d87cda29c87bf57e92aba668210746c81813e12063a67a43996181b640be8a']
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/Problem01_label04.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 f3d87cda29c87bf57e92aba668210746c81813e12063a67a43996181b640be8a
--- Real Ultimate output ---
This is Ultimate 0.3.0-?-4f9af40
[2024-11-06 18:53:28,419 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-06 18:53:28,486 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:53:28,492 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-06 18:53:28,492 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-06 18:53:28,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-06 18:53:28,512 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-06 18:53:28,512 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-06 18:53:28,513 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-06 18:53:28,513 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-06 18:53:28,513 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-06 18:53:28,513 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-06 18:53:28,513 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-06 18:53:28,513 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-06 18:53:28,513 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-06 18:53:28,513 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-06 18:53:28,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-06 18:53:28,514 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-06 18:53:28,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-06 18:53:28,514 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-06 18:53:28,514 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-06 18:53:28,514 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-06 18:53:28,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-06 18:53:28,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-06 18:53:28,514 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-06 18:53:28,514 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-06 18:53:28,514 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-06 18:53:28,514 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-06 18:53:28,515 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-06 18:53:28,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-06 18:53:28,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-06 18:53:28,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-06 18:53:28,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-06 18:53:28,515 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-06 18:53:28,515 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-06 18:53:28,515 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-06 18:53:28,515 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-06 18:53:28,515 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-06 18:53:28,516 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-06 18:53:28,516 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-06 18:53:28,516 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-06 18:53:28,516 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-06 18:53:28,516 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 -> f3d87cda29c87bf57e92aba668210746c81813e12063a67a43996181b640be8a
[2024-11-06 18:53:28,758 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-06 18:53:28,763 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-06 18:53:28,767 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-06 18:53:28,768 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-06 18:53:28,768 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-06 18:53:28,769 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/eca-rers2012/Problem01_label04.c
[2024-11-06 18:53:29,889 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-06 18:53:30,114 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-06 18:53:30,115 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/eca-rers2012/Problem01_label04.c
[2024-11-06 18:53:30,126 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e385a178/60138049902e43ffba6e5b799c32ea45/FLAG536cfb44e
[2024-11-06 18:53:30,467 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/2e385a178/60138049902e43ffba6e5b799c32ea45
[2024-11-06 18:53:30,469 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-06 18:53:30,470 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-06 18:53:30,471 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-06 18:53:30,471 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-06 18:53:30,474 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-06 18:53:30,474 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:53:30" (1/1) ...
[2024-11-06 18:53:30,475 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d246d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:30, skipping insertion in model container
[2024-11-06 18:53:30,475 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 06:53:30" (1/1) ...
[2024-11-06 18:53:30,493 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-06 18:53:30,660 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/Problem01_label04.c[17486,17499]
[2024-11-06 18:53:30,692 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-06 18:53:30,700 INFO L200 MainTranslator]: Completed pre-run
[2024-11-06 18:53:30,750 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/Problem01_label04.c[17486,17499]
[2024-11-06 18:53:30,762 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-06 18:53:30,774 INFO L204 MainTranslator]: Completed translation
[2024-11-06 18:53:30,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:30 WrapperNode
[2024-11-06 18:53:30,776 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-06 18:53:30,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-06 18:53:30,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-06 18:53:30,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-06 18:53:30,781 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:53:30" (1/1) ...
[2024-11-06 18:53:30,793 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:53:30" (1/1) ...
[2024-11-06 18:53:30,837 INFO L138 Inliner]: procedures = 14, calls = 8, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 658
[2024-11-06 18:53:30,838 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-06 18:53:30,839 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-06 18:53:30,839 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-06 18:53:30,839 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-06 18:53:30,846 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:30" (1/1) ...
[2024-11-06 18:53:30,846 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:30" (1/1) ...
[2024-11-06 18:53:30,854 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:30" (1/1) ...
[2024-11-06 18:53:30,873 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:53:30,878 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:30" (1/1) ...
[2024-11-06 18:53:30,878 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:30" (1/1) ...
[2024-11-06 18:53:30,890 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:30" (1/1) ...
[2024-11-06 18:53:30,896 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:30" (1/1) ...
[2024-11-06 18:53:30,902 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:30" (1/1) ...
[2024-11-06 18:53:30,905 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:30" (1/1) ...
[2024-11-06 18:53:30,938 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-06 18:53:30,939 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-06 18:53:30,939 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-06 18:53:30,939 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-06 18:53:30,940 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:30" (1/1) ...
[2024-11-06 18:53:30,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-06 18:53:30,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-06 18:53:30,967 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:53:30,976 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:53:30,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-06 18:53:30,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-06 18:53:30,997 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-06 18:53:30,998 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-06 18:53:31,064 INFO L238 CfgBuilder]: Building ICFG
[2024-11-06 18:53:31,067 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-06 18:53:31,865 INFO L? ?]: Removed 75 outVars from TransFormulas that were not future-live.
[2024-11-06 18:53:31,865 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-06 18:53:31,873 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-06 18:53:31,873 INFO L316 CfgBuilder]: Removed 1 assume(true) statements.
[2024-11-06 18:53:31,874 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:53:31 BoogieIcfgContainer
[2024-11-06 18:53:31,874 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-06 18:53:31,875 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-06 18:53:31,875 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-06 18:53:31,879 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-06 18:53:31,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 06:53:30" (1/3) ...
[2024-11-06 18:53:31,879 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@649f7852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:53:31, skipping insertion in model container
[2024-11-06 18:53:31,879 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 06:53:30" (2/3) ...
[2024-11-06 18:53:31,880 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@649f7852 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 06:53:31, skipping insertion in model container
[2024-11-06 18:53:31,880 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:53:31" (3/3) ...
[2024-11-06 18:53:31,881 INFO L112 eAbstractionObserver]: Analyzing ICFG Problem01_label04.c
[2024-11-06 18:53:31,890 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-06 18:53:31,890 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-06 18:53:31,939 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-06 18:53:31,949 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;@e1d7202, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-06 18:53:31,950 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-06 18:53:31,955 INFO L276 IsEmpty]: Start isEmpty. Operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 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:53:31,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97
[2024-11-06 18:53:31,962 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-06 18:53:31,962 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]
[2024-11-06 18:53:31,962 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 18:53:31,967 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 18:53:31,967 INFO L85 PathProgramCache]: Analyzing trace with hash 857742575, now seen corresponding path program 1 times
[2024-11-06 18:53:31,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-06 18:53:31,972 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737108287]
[2024-11-06 18:53:31,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 18:53:31,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-06 18:53:32,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 18:53:32,365 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:53:32,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-06 18:53:32,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737108287]
[2024-11-06 18:53:32,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737108287] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 18:53:32,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 18:53:32,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-06 18:53:32,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672673266]
[2024-11-06 18:53:32,371 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 18:53:32,374 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-06 18:53:32,376 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-06 18:53:32,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-06 18:53:32,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 18:53:32,394 INFO L87 Difference]: Start difference. First operand has 198 states, 196 states have (on average 1.6683673469387754) internal successors, (327), 197 states have internal predecessors, (327), 0 states have call successors, (0), 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 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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:53:32,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 18:53:32,987 INFO L93 Difference]: Finished difference Result 528 states and 915 transitions.
[2024-11-06 18:53:32,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-06 18:53:32,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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 96
[2024-11-06 18:53:32,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 18:53:32,997 INFO L225 Difference]: With dead ends: 528
[2024-11-06 18:53:32,997 INFO L226 Difference]: Without dead ends: 266
[2024-11-06 18:53:33,000 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:53:33,003 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 89 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-06 18:53:33,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 66 Invalid, 518 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-06 18:53:33,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states.
[2024-11-06 18:53:33,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 266.
[2024-11-06 18:53:33,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 266 states, 265 states have (on average 1.4339622641509433) internal successors, (380), 265 states have internal predecessors, (380), 0 states have call successors, (0), 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:53:33,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 380 transitions.
[2024-11-06 18:53:33,047 INFO L78 Accepts]: Start accepts. Automaton has 266 states and 380 transitions. Word has length 96
[2024-11-06 18:53:33,047 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-06 18:53:33,048 INFO L471 AbstractCegarLoop]: Abstraction has 266 states and 380 transitions.
[2024-11-06 18:53:33,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.0) internal successors, (96), 2 states have internal predecessors, (96), 0 states have call successors, (0), 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:53:33,048 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 380 transitions.
[2024-11-06 18:53:33,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102
[2024-11-06 18:53:33,051 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-06 18:53:33,051 INFO L215 NwaCegarLoop]: trace histogram [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]
[2024-11-06 18:53:33,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-06 18:53:33,051 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 18:53:33,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 18:53:33,052 INFO L85 PathProgramCache]: Analyzing trace with hash 2104593095, now seen corresponding path program 1 times
[2024-11-06 18:53:33,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-06 18:53:33,052 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303995412]
[2024-11-06 18:53:33,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 18:53:33,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-06 18:53:33,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 18:53:33,169 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-06 18:53:33,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-06 18:53:33,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303995412]
[2024-11-06 18:53:33,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303995412] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 18:53:33,170 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 18:53:33,170 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-06 18:53:33,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184733949]
[2024-11-06 18:53:33,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 18:53:33,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-06 18:53:33,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-06 18:53:33,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-06 18:53:33,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 18:53:33,171 INFO L87 Difference]: Start difference. First operand 266 states and 380 transitions. Second operand has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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:53:33,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 18:53:33,532 INFO L93 Difference]: Finished difference Result 792 states and 1135 transitions.
[2024-11-06 18:53:33,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-06 18:53:33,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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 101
[2024-11-06 18:53:33,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 18:53:33,534 INFO L225 Difference]: With dead ends: 792
[2024-11-06 18:53:33,534 INFO L226 Difference]: Without dead ends: 528
[2024-11-06 18:53:33,535 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:53:33,536 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 172 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-06 18:53:33,536 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 29 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-06 18:53:33,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 528 states.
[2024-11-06 18:53:33,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 528 to 528.
[2024-11-06 18:53:33,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 527 states have (on average 1.3681214421252372) internal successors, (721), 527 states have internal predecessors, (721), 0 states have call successors, (0), 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:53:33,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 721 transitions.
[2024-11-06 18:53:33,572 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 721 transitions. Word has length 101
[2024-11-06 18:53:33,572 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-06 18:53:33,573 INFO L471 AbstractCegarLoop]: Abstraction has 528 states and 721 transitions.
[2024-11-06 18:53:33,573 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 33.666666666666664) internal successors, (101), 2 states have internal predecessors, (101), 0 states have call successors, (0), 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:53:33,573 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 721 transitions.
[2024-11-06 18:53:33,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106
[2024-11-06 18:53:33,575 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-06 18:53:33,575 INFO L215 NwaCegarLoop]: trace histogram [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]
[2024-11-06 18:53:33,575 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-06 18:53:33,576 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 18:53:33,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 18:53:33,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1234609091, now seen corresponding path program 1 times
[2024-11-06 18:53:33,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-06 18:53:33,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075643088]
[2024-11-06 18:53:33,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 18:53:33,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-06 18:53:33,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 18:53:33,713 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-06 18:53:33,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-06 18:53:33,714 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075643088]
[2024-11-06 18:53:33,714 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075643088] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 18:53:33,714 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 18:53:33,714 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-06 18:53:33,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108164850]
[2024-11-06 18:53:33,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 18:53:33,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-06 18:53:33,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-06 18:53:33,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-06 18:53:33,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 18:53:33,715 INFO L87 Difference]: Start difference. First operand 528 states and 721 transitions. Second operand has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-06 18:53:34,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 18:53:34,083 INFO L93 Difference]: Finished difference Result 1447 states and 1979 transitions.
[2024-11-06 18:53:34,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-06 18:53:34,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 105
[2024-11-06 18:53:34,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 18:53:34,086 INFO L225 Difference]: With dead ends: 1447
[2024-11-06 18:53:34,086 INFO L226 Difference]: Without dead ends: 921
[2024-11-06 18:53:34,087 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:53:34,088 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 140 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 328 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-06 18:53:34,088 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 19 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 328 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-06 18:53:34,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 921 states.
[2024-11-06 18:53:34,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 921 to 921.
[2024-11-06 18:53:34,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 921 states, 920 states have (on average 1.3413043478260869) internal successors, (1234), 920 states have internal predecessors, (1234), 0 states have call successors, (0), 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:53:34,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 921 states to 921 states and 1234 transitions.
[2024-11-06 18:53:34,110 INFO L78 Accepts]: Start accepts. Automaton has 921 states and 1234 transitions. Word has length 105
[2024-11-06 18:53:34,110 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-06 18:53:34,111 INFO L471 AbstractCegarLoop]: Abstraction has 921 states and 1234 transitions.
[2024-11-06 18:53:34,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.0) internal successors, (105), 2 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-06 18:53:34,111 INFO L276 IsEmpty]: Start isEmpty. Operand 921 states and 1234 transitions.
[2024-11-06 18:53:34,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112
[2024-11-06 18:53:34,116 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-06 18:53:34,116 INFO L215 NwaCegarLoop]: trace histogram [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]
[2024-11-06 18:53:34,116 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2
[2024-11-06 18:53:34,116 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 18:53:34,116 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 18:53:34,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1833249902, now seen corresponding path program 1 times
[2024-11-06 18:53:34,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-06 18:53:34,117 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477098657]
[2024-11-06 18:53:34,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 18:53:34,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-06 18:53:34,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 18:53:34,291 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-06 18:53:34,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-06 18:53:34,292 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477098657]
[2024-11-06 18:53:34,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477098657] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 18:53:34,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 18:53:34,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-06 18:53:34,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389902937]
[2024-11-06 18:53:34,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 18:53:34,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-06 18:53:34,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-06 18:53:34,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-06 18:53:34,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 18:53:34,293 INFO L87 Difference]: Start difference. First operand 921 states and 1234 transitions. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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:53:34,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 18:53:34,606 INFO L93 Difference]: Finished difference Result 2233 states and 2955 transitions.
[2024-11-06 18:53:34,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-06 18:53:34,606 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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 111
[2024-11-06 18:53:34,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 18:53:34,610 INFO L225 Difference]: With dead ends: 2233
[2024-11-06 18:53:34,611 INFO L226 Difference]: Without dead ends: 1314
[2024-11-06 18:53:34,612 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:53:34,612 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 122 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 51 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-06 18:53:34,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 56 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [51 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-06 18:53:34,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states.
[2024-11-06 18:53:34,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1183.
[2024-11-06 18:53:34,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.2961082910321489) internal successors, (1532), 1182 states have internal predecessors, (1532), 0 states have call successors, (0), 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:53:34,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1532 transitions.
[2024-11-06 18:53:34,638 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1532 transitions. Word has length 111
[2024-11-06 18:53:34,638 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-06 18:53:34,638 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1532 transitions.
[2024-11-06 18:53:34,638 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 2 states have internal predecessors, (111), 0 states have call successors, (0), 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:53:34,639 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1532 transitions.
[2024-11-06 18:53:34,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113
[2024-11-06 18:53:34,641 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-06 18:53:34,641 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:34,641 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3
[2024-11-06 18:53:34,642 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 18:53:34,642 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 18:53:34,642 INFO L85 PathProgramCache]: Analyzing trace with hash 1776099934, now seen corresponding path program 1 times
[2024-11-06 18:53:34,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-06 18:53:34,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655532251]
[2024-11-06 18:53:34,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 18:53:34,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-06 18:53:34,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 18:53:34,784 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked.
[2024-11-06 18:53:34,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-06 18:53:34,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655532251]
[2024-11-06 18:53:34,786 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655532251] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 18:53:34,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 18:53:34,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-06 18:53:34,786 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1717470725]
[2024-11-06 18:53:34,786 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 18:53:34,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-06 18:53:34,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-06 18:53:34,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-06 18:53:34,787 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 18:53:34,787 INFO L87 Difference]: Start difference. First operand 1183 states and 1532 transitions. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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:53:35,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 18:53:35,115 INFO L93 Difference]: Finished difference Result 2364 states and 3062 transitions.
[2024-11-06 18:53:35,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-06 18:53:35,116 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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 112
[2024-11-06 18:53:35,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 18:53:35,119 INFO L225 Difference]: With dead ends: 2364
[2024-11-06 18:53:35,119 INFO L226 Difference]: Without dead ends: 1183
[2024-11-06 18:53:35,121 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:53:35,122 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 131 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 310 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 310 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-06 18:53:35,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [131 Valid, 61 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 310 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-06 18:53:35,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1183 states.
[2024-11-06 18:53:35,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1183 to 1183.
[2024-11-06 18:53:35,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1183 states, 1182 states have (on average 1.2808798646362098) internal successors, (1514), 1182 states have internal predecessors, (1514), 0 states have call successors, (0), 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:53:35,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1183 states to 1183 states and 1514 transitions.
[2024-11-06 18:53:35,145 INFO L78 Accepts]: Start accepts. Automaton has 1183 states and 1514 transitions. Word has length 112
[2024-11-06 18:53:35,145 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-06 18:53:35,145 INFO L471 AbstractCegarLoop]: Abstraction has 1183 states and 1514 transitions.
[2024-11-06 18:53:35,145 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 2 states have internal predecessors, (108), 0 states have call successors, (0), 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:53:35,145 INFO L276 IsEmpty]: Start isEmpty. Operand 1183 states and 1514 transitions.
[2024-11-06 18:53:35,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116
[2024-11-06 18:53:35,147 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-06 18:53:35,147 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 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]
[2024-11-06 18:53:35,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4
[2024-11-06 18:53:35,147 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 18:53:35,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 18:53:35,147 INFO L85 PathProgramCache]: Analyzing trace with hash -793034954, now seen corresponding path program 1 times
[2024-11-06 18:53:35,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-06 18:53:35,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101092202]
[2024-11-06 18:53:35,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 18:53:35,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-06 18:53:35,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 18:53:35,305 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-06 18:53:35,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-06 18:53:35,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101092202]
[2024-11-06 18:53:35,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101092202] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 18:53:35,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 18:53:35,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-06 18:53:35,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298254306]
[2024-11-06 18:53:35,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 18:53:35,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-06 18:53:35,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-06 18:53:35,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-06 18:53:35,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-06 18:53:35,307 INFO L87 Difference]: Start difference. First operand 1183 states and 1514 transitions. Second operand has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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:53:35,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 18:53:35,778 INFO L93 Difference]: Finished difference Result 2757 states and 3467 transitions.
[2024-11-06 18:53:35,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-06 18:53:35,779 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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 115
[2024-11-06 18:53:35,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 18:53:35,784 INFO L225 Difference]: With dead ends: 2757
[2024-11-06 18:53:35,784 INFO L226 Difference]: Without dead ends: 1576
[2024-11-06 18:53:35,785 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:53:35,785 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 380 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 380 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-06 18:53:35,786 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [380 Valid, 59 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-06 18:53:35,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1576 states.
[2024-11-06 18:53:35,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1576 to 1445.
[2024-11-06 18:53:35,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.2465373961218837) internal successors, (1800), 1444 states have internal predecessors, (1800), 0 states have call successors, (0), 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:53:35,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1800 transitions.
[2024-11-06 18:53:35,806 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1800 transitions. Word has length 115
[2024-11-06 18:53:35,806 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-06 18:53:35,806 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 1800 transitions.
[2024-11-06 18:53:35,806 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 28.75) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 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:53:35,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1800 transitions.
[2024-11-06 18:53:35,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134
[2024-11-06 18:53:35,808 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-06 18:53:35,808 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:53:35,808 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5
[2024-11-06 18:53:35,808 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 18:53:35,808 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 18:53:35,808 INFO L85 PathProgramCache]: Analyzing trace with hash -117909897, now seen corresponding path program 1 times
[2024-11-06 18:53:35,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-06 18:53:35,808 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460813374]
[2024-11-06 18:53:35,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 18:53:35,809 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-06 18:53:35,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 18:53:35,934 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked.
[2024-11-06 18:53:35,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-06 18:53:35,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460813374]
[2024-11-06 18:53:35,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [460813374] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 18:53:35,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 18:53:35,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2024-11-06 18:53:35,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011805247]
[2024-11-06 18:53:35,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 18:53:35,935 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-06 18:53:35,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-06 18:53:35,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-06 18:53:35,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6
[2024-11-06 18:53:35,936 INFO L87 Difference]: Start difference. First operand 1445 states and 1800 transitions. Second operand has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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:53:36,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 18:53:36,239 INFO L93 Difference]: Finished difference Result 1709 states and 2111 transitions.
[2024-11-06 18:53:36,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-06 18:53:36,239 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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 133
[2024-11-06 18:53:36,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 18:53:36,244 INFO L225 Difference]: With dead ends: 1709
[2024-11-06 18:53:36,244 INFO L226 Difference]: Without dead ends: 1707
[2024-11-06 18:53:36,245 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:53:36,245 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 58 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-06 18:53:36,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 31 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-06 18:53:36,247 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states.
[2024-11-06 18:53:36,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1445.
[2024-11-06 18:53:36,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1445 states, 1444 states have (on average 1.2458448753462603) internal successors, (1799), 1444 states have internal predecessors, (1799), 0 states have call successors, (0), 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:53:36,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1445 states to 1445 states and 1799 transitions.
[2024-11-06 18:53:36,268 INFO L78 Accepts]: Start accepts. Automaton has 1445 states and 1799 transitions. Word has length 133
[2024-11-06 18:53:36,268 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-06 18:53:36,268 INFO L471 AbstractCegarLoop]: Abstraction has 1445 states and 1799 transitions.
[2024-11-06 18:53:36,268 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 32.666666666666664) internal successors, (98), 2 states have internal predecessors, (98), 0 states have call successors, (0), 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:53:36,268 INFO L276 IsEmpty]: Start isEmpty. Operand 1445 states and 1799 transitions.
[2024-11-06 18:53:36,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189
[2024-11-06 18:53:36,271 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-06 18:53:36,271 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 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]
[2024-11-06 18:53:36,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6
[2024-11-06 18:53:36,271 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 18:53:36,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 18:53:36,271 INFO L85 PathProgramCache]: Analyzing trace with hash 876715263, now seen corresponding path program 1 times
[2024-11-06 18:53:36,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-06 18:53:36,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [308299075]
[2024-11-06 18:53:36,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 18:53:36,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-06 18:53:36,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 18:53:36,468 INFO L134 CoverageAnalysis]: Checked inductivity of 184 backedges. 121 proven. 0 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked.
[2024-11-06 18:53:36,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-06 18:53:36,468 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [308299075]
[2024-11-06 18:53:36,468 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [308299075] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 18:53:36,468 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-06 18:53:36,468 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3
[2024-11-06 18:53:36,468 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521955533]
[2024-11-06 18:53:36,468 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 18:53:36,469 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states
[2024-11-06 18:53:36,469 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-06 18:53:36,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants.
[2024-11-06 18:53:36,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12
[2024-11-06 18:53:36,469 INFO L87 Difference]: Start difference. First operand 1445 states and 1799 transitions. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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:53:37,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 18:53:37,050 INFO L93 Difference]: Finished difference Result 3281 states and 4085 transitions.
[2024-11-06 18:53:37,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states.
[2024-11-06 18:53:37,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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 188
[2024-11-06 18:53:37,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 18:53:37,056 INFO L225 Difference]: With dead ends: 3281
[2024-11-06 18:53:37,056 INFO L226 Difference]: Without dead ends: 1838
[2024-11-06 18:53:37,059 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:53:37,060 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 225 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-06 18:53:37,060 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [225 Valid, 58 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 700 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-06 18:53:37,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1838 states.
[2024-11-06 18:53:37,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1838 to 1707.
[2024-11-06 18:53:37,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1706 states have (on average 1.194021101992966) internal successors, (2037), 1706 states have internal predecessors, (2037), 0 states have call successors, (0), 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:53:37,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2037 transitions.
[2024-11-06 18:53:37,091 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2037 transitions. Word has length 188
[2024-11-06 18:53:37,091 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-06 18:53:37,091 INFO L471 AbstractCegarLoop]: Abstraction has 1707 states and 2037 transitions.
[2024-11-06 18:53:37,091 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 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:53:37,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2037 transitions.
[2024-11-06 18:53:37,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202
[2024-11-06 18:53:37,094 INFO L207 NwaCegarLoop]: Found error trace
[2024-11-06 18:53:37,094 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 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]
[2024-11-06 18:53:37,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7
[2024-11-06 18:53:37,095 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-06 18:53:37,095 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-06 18:53:37,095 INFO L85 PathProgramCache]: Analyzing trace with hash -1605740864, now seen corresponding path program 1 times
[2024-11-06 18:53:37,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-06 18:53:37,095 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523038603]
[2024-11-06 18:53:37,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 18:53:37,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-06 18:53:37,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 18:53:37,343 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 138 proven. 11 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked.
[2024-11-06 18:53:37,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-06 18:53:37,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523038603]
[2024-11-06 18:53:37,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523038603] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-06 18:53:37,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1784707587]
[2024-11-06 18:53:37,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-06 18:53:37,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-06 18:53:37,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3
[2024-11-06 18:53:37,346 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:53:37,348 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:53:37,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-06 18:53:37,446 INFO L255 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 2 conjuncts are in the unsatisfiable core
[2024-11-06 18:53:37,454 INFO L278 TraceCheckSpWp]: Computing forward predicates...
[2024-11-06 18:53:37,604 INFO L134 CoverageAnalysis]: Checked inductivity of 212 backedges. 132 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked.
[2024-11-06 18:53:37,604 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect
[2024-11-06 18:53:37,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1784707587] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-06 18:53:37,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences.
[2024-11-06 18:53:37,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5
[2024-11-06 18:53:37,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1516696306]
[2024-11-06 18:53:37,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-06 18:53:37,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states
[2024-11-06 18:53:37,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-06 18:53:37,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants.
[2024-11-06 18:53:37,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2024-11-06 18:53:37,606 INFO L87 Difference]: Start difference. First operand 1707 states and 2037 transitions. Second operand has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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:53:37,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-06 18:53:37,917 INFO L93 Difference]: Finished difference Result 3410 states and 4071 transitions.
[2024-11-06 18:53:37,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states.
[2024-11-06 18:53:37,917 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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 201
[2024-11-06 18:53:37,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-06 18:53:37,918 INFO L225 Difference]: With dead ends: 3410
[2024-11-06 18:53:37,918 INFO L226 Difference]: Without dead ends: 0
[2024-11-06 18:53:37,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 204 GetRequests, 201 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:53:37,922 INFO L432 NwaCegarLoop]: 185 mSDtfsCounter, 42 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time
[2024-11-06 18:53:37,922 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 190 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time]
[2024-11-06 18:53:37,922 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-06 18:53:37,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-06 18:53:37,923 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:53:37,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-06 18:53:37,923 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 201
[2024-11-06 18:53:37,923 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-06 18:53:37,923 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-06 18:53:37,924 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 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:53:37,924 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-06 18:53:37,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-06 18:53:37,926 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-06 18:53:37,939 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0
[2024-11-06 18:53:38,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-06 18:53:38,133 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-06 18:53:38,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-06 18:53:38,269 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-06 18:53:38,285 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 06:53:38 BoogieIcfgContainer
[2024-11-06 18:53:38,285 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-06 18:53:38,285 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-06 18:53:38,285 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-06 18:53:38,286 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-06 18:53:38,286 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 06:53:31" (3/4) ...
[2024-11-06 18:53:38,288 INFO L142 WitnessPrinter]: Generating witness for correct program
[2024-11-06 18:53:38,305 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2024-11-06 18:53:38,306 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges
[2024-11-06 18:53:38,307 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-11-06 18:53:38,307 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-06 18:53:38,403 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-06 18:53:38,405 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-06 18:53:38,405 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-06 18:53:38,405 INFO L158 Benchmark]: Toolchain (without parser) took 7935.57ms. Allocated memory was 100.7MB in the beginning and 184.5MB in the end (delta: 83.9MB). Free memory was 75.0MB in the beginning and 137.8MB in the end (delta: -62.8MB). Peak memory consumption was 20.0MB. Max. memory is 16.1GB.
[2024-11-06 18:53:38,406 INFO L158 Benchmark]: CDTParser took 0.48ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB.
[2024-11-06 18:53:38,406 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.17ms. Allocated memory is still 100.7MB. Free memory was 74.9MB in the beginning and 48.1MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
[2024-11-06 18:53:38,407 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.83ms. Allocated memory is still 100.7MB. Free memory was 48.1MB in the beginning and 42.6MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-06 18:53:38,407 INFO L158 Benchmark]: Boogie Preprocessor took 100.02ms. Allocated memory is still 100.7MB. Free memory was 42.6MB in the beginning and 72.4MB in the end (delta: -29.8MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB.
[2024-11-06 18:53:38,407 INFO L158 Benchmark]: RCFGBuilder took 934.79ms. Allocated memory is still 100.7MB. Free memory was 72.4MB in the beginning and 64.7MB in the end (delta: 7.7MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB.
[2024-11-06 18:53:38,408 INFO L158 Benchmark]: TraceAbstraction took 6409.83ms. Allocated memory was 100.7MB in the beginning and 184.5MB in the end (delta: 83.9MB). Free memory was 64.2MB in the beginning and 150.2MB in the end (delta: -86.0MB). Peak memory consumption was 108.0MB. Max. memory is 16.1GB.
[2024-11-06 18:53:38,408 INFO L158 Benchmark]: Witness Printer took 119.41ms. Allocated memory is still 184.5MB. Free memory was 150.2MB in the beginning and 137.8MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
[2024-11-06 18:53:38,409 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.48ms. Allocated memory is still 83.9MB. Free memory is still 48.1MB. There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 305.17ms. Allocated memory is still 100.7MB. Free memory was 74.9MB in the beginning and 48.1MB in the end (delta: 26.8MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 61.83ms. Allocated memory is still 100.7MB. Free memory was 48.1MB in the beginning and 42.6MB in the end (delta: 5.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 100.02ms. Allocated memory is still 100.7MB. Free memory was 42.6MB in the beginning and 72.4MB in the end (delta: -29.8MB). Peak memory consumption was 15.4MB. Max. memory is 16.1GB.
* RCFGBuilder took 934.79ms. Allocated memory is still 100.7MB. Free memory was 72.4MB in the beginning and 64.7MB in the end (delta: 7.7MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB.
* TraceAbstraction took 6409.83ms. Allocated memory was 100.7MB in the beginning and 184.5MB in the end (delta: 83.9MB). Free memory was 64.2MB in the beginning and 150.2MB in the end (delta: -86.0MB). Peak memory consumption was 108.0MB. Max. memory is 16.1GB.
* Witness Printer took 119.41ms. Allocated memory is still 184.5MB. Free memory was 150.2MB in the beginning and 137.8MB in the end (delta: 12.4MB). Peak memory consumption was 8.4MB. 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: 474]: 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, 198 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 9, TraceHistogramMax: 6, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1359 SdHoareTripleChecker+Valid, 3.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1359 mSDsluCounter, 569 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 56 mSDsCounter, 624 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3546 IncrementalHoareTripleChecker+Invalid, 4170 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 624 mSolverCounterUnsat, 513 mSDtfsCounter, 3546 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 222 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1707occurred in iteration=8, InterpolantAutomatonStates: 29, 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, 9 MinimizatonAttempts, 655 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.5s InterpolantComputationTime, 1363 NumberOfCodeBlocks, 1363 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1353 ConstructedInterpolants, 0 QuantifiedInterpolants, 2854 SizeOfPredicates, 0 NumberOfNonLiveVariables, 408 ConjunctsInSsa, 2 ConjunctsInUnsatCore, 10 InterpolantComputations, 9 PerfectInterpolantSequences, 699/710 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: 593]: Loop Invariant
Derived loop invariant: ((((((a21 == 1) && (a16 <= 5)) || (((a21 == 1) && (a17 == 1)) && (a20 == 1))) || ((a21 <= 0) && (a20 == 1))) || ((a21 == 1) && (15 <= a8))) || (((a21 <= 0) && (a17 == 1)) && (a16 <= 5)))
RESULT: Ultimate proved your program to be correct!
[2024-11-06 18:53:38,430 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