./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b06.c --full-output --architecture 64bit -------------------------------------------------------------------------------- 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/hardware-verification-bv/btor2c-lazyMod.h_b06.c', '-s', '/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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', '64bit', '--witnessprinter.graph.data.programhash', 'ec179c2b0ae29cffe9fd88f2044fb26f554ea0dd1abcec6f41fd07a61f74c869'] 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/hardware-verification-bv/btor2c-lazyMod.h_b06.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-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 64bit --witnessprinter.graph.data.programhash ec179c2b0ae29cffe9fd88f2044fb26f554ea0dd1abcec6f41fd07a61f74c869 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 02:58:07,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 02:58:07,141 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-07 02:58:07,148 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 02:58:07,148 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 02:58:07,174 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 02:58:07,175 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 02:58:07,175 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 02:58:07,176 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 02:58:07,176 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 02:58:07,176 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 02:58:07,176 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 02:58:07,177 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 02:58:07,177 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 02:58:07,177 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 02:58:07,177 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 02:58:07,177 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 02:58:07,177 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 02:58:07,177 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 02:58:07,178 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 02:58:07,178 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 02:58:07,178 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 02:58:07,178 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 02:58:07,178 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 02:58:07,178 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 02:58:07,178 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 02:58:07,179 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 02:58:07,179 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 02:58:07,179 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 02:58:07,179 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:58:07,179 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 02:58:07,179 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 02:58:07,179 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 02:58:07,179 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 02:58:07,180 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 02:58:07,180 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 02:58:07,180 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 02:58:07,180 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 02:58:07,180 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 02:58:07,180 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ec179c2b0ae29cffe9fd88f2044fb26f554ea0dd1abcec6f41fd07a61f74c869 [2024-11-07 02:58:07,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 02:58:07,468 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 02:58:07,471 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 02:58:07,472 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 02:58:07,472 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 02:58:07,474 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b06.c [2024-11-07 02:58:08,800 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 02:58:09,036 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 02:58:09,037 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b06.c [2024-11-07 02:58:09,043 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56c67831b/acc4f15f0fda4840a257b068ef4dbb5b/FLAGb941c9d0a [2024-11-07 02:58:09,063 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/56c67831b/acc4f15f0fda4840a257b068ef4dbb5b [2024-11-07 02:58:09,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 02:58:09,068 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 02:58:09,070 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 02:58:09,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 02:58:09,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 02:58:09,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:58:09" (1/1) ... [2024-11-07 02:58:09,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44ef2a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:09, skipping insertion in model container [2024-11-07 02:58:09,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:58:09" (1/1) ... [2024-11-07 02:58:09,092 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 02:58:09,206 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/hardware-verification-bv/btor2c-lazyMod.h_b06.c[1245,1258] [2024-11-07 02:58:09,251 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:58:09,260 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 02:58:09,269 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/hardware-verification-bv/btor2c-lazyMod.h_b06.c[1245,1258] [2024-11-07 02:58:09,292 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:58:09,310 INFO L204 MainTranslator]: Completed translation [2024-11-07 02:58:09,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:09 WrapperNode [2024-11-07 02:58:09,312 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 02:58:09,313 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 02:58:09,313 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 02:58:09,313 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 02:58:09,318 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:09" (1/1) ... [2024-11-07 02:58:09,334 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:09" (1/1) ... [2024-11-07 02:58:09,399 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 259 [2024-11-07 02:58:09,399 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 02:58:09,400 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 02:58:09,400 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 02:58:09,400 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 02:58:09,408 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:09" (1/1) ... [2024-11-07 02:58:09,408 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:09" (1/1) ... [2024-11-07 02:58:09,419 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:09" (1/1) ... [2024-11-07 02:58:09,444 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-07 02:58:09,445 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:09" (1/1) ... [2024-11-07 02:58:09,445 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:09" (1/1) ... [2024-11-07 02:58:09,457 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:09" (1/1) ... [2024-11-07 02:58:09,464 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:09" (1/1) ... [2024-11-07 02:58:09,471 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:09" (1/1) ... [2024-11-07 02:58:09,473 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:09" (1/1) ... [2024-11-07 02:58:09,478 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 02:58:09,479 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 02:58:09,479 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 02:58:09,479 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 02:58:09,480 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:09" (1/1) ... [2024-11-07 02:58:09,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:58:09,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 02:58:09,516 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-07 02:58:09,521 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-07 02:58:09,544 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 02:58:09,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 02:58:09,545 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 02:58:09,545 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 02:58:09,545 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 02:58:09,636 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 02:58:09,637 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 02:58:10,157 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-11-07 02:58:10,157 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 02:58:10,169 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 02:58:10,169 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 02:58:10,169 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:58:10 BoogieIcfgContainer [2024-11-07 02:58:10,169 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 02:58:10,171 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 02:58:10,171 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 02:58:10,175 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 02:58:10,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:58:09" (1/3) ... [2024-11-07 02:58:10,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6db89a41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:58:10, skipping insertion in model container [2024-11-07 02:58:10,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:09" (2/3) ... [2024-11-07 02:58:10,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6db89a41 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:58:10, skipping insertion in model container [2024-11-07 02:58:10,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:58:10" (3/3) ... [2024-11-07 02:58:10,177 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b06.c [2024-11-07 02:58:10,188 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 02:58:10,189 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 02:58:10,226 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 02:58:10,237 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;@46946c5b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 02:58:10,237 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 02:58:10,242 INFO L276 IsEmpty]: Start isEmpty. Operand has 62 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 61 states have internal predecessors, (89), 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-07 02:58:10,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-07 02:58:10,248 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:58:10,248 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] [2024-11-07 02:58:10,248 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:58:10,252 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:58:10,253 INFO L85 PathProgramCache]: Analyzing trace with hash 234501229, now seen corresponding path program 1 times [2024-11-07 02:58:10,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:58:10,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61356147] [2024-11-07 02:58:10,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:58:10,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:58:10,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:58:10,823 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-07 02:58:10,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:58:10,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61356147] [2024-11-07 02:58:10,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61356147] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:58:10,827 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:58:10,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:58:10,828 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [179946856] [2024-11-07 02:58:10,829 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:58:10,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:58:10,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:58:10,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:58:10,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:58:10,852 INFO L87 Difference]: Start difference. First operand has 62 states, 60 states have (on average 1.4833333333333334) internal successors, (89), 61 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-07 02:58:10,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:58:10,899 INFO L93 Difference]: Finished difference Result 105 states and 153 transitions. [2024-11-07 02:58:10,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:58:10,902 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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 25 [2024-11-07 02:58:10,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:58:10,909 INFO L225 Difference]: With dead ends: 105 [2024-11-07 02:58:10,912 INFO L226 Difference]: Without dead ends: 61 [2024-11-07 02:58:10,915 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:58:10,917 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:58:10,917 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 243 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:58:10,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-07 02:58:10,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2024-11-07 02:58:10,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.45) internal successors, (87), 60 states have internal predecessors, (87), 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-07 02:58:10,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 87 transitions. [2024-11-07 02:58:10,956 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 87 transitions. Word has length 25 [2024-11-07 02:58:10,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:58:10,956 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 87 transitions. [2024-11-07 02:58:10,957 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 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-07 02:58:10,957 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2024-11-07 02:58:10,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-07 02:58:10,959 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:58:10,959 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:58:10,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 02:58:10,959 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:58:10,960 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:58:10,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1318701210, now seen corresponding path program 1 times [2024-11-07 02:58:10,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:58:10,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158689336] [2024-11-07 02:58:10,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:58:10,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:58:11,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:58:11,160 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-07 02:58:11,160 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:58:11,160 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [158689336] [2024-11-07 02:58:11,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [158689336] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:58:11,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:58:11,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:58:11,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1090189851] [2024-11-07 02:58:11,161 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:58:11,162 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:58:11,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:58:11,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:58:11,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:58:11,163 INFO L87 Difference]: Start difference. First operand 61 states and 87 transitions. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-07 02:58:11,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:58:11,200 INFO L93 Difference]: Finished difference Result 106 states and 151 transitions. [2024-11-07 02:58:11,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:58:11,202 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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 26 [2024-11-07 02:58:11,202 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:58:11,203 INFO L225 Difference]: With dead ends: 106 [2024-11-07 02:58:11,203 INFO L226 Difference]: Without dead ends: 63 [2024-11-07 02:58:11,203 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:58:11,204 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 0 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:58:11,204 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 239 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:58:11,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-07 02:58:11,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2024-11-07 02:58:11,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.435483870967742) internal successors, (89), 62 states have internal predecessors, (89), 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-07 02:58:11,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 89 transitions. [2024-11-07 02:58:11,212 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 89 transitions. Word has length 26 [2024-11-07 02:58:11,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:58:11,213 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 89 transitions. [2024-11-07 02:58:11,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 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-07 02:58:11,213 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 89 transitions. [2024-11-07 02:58:11,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 02:58:11,214 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:58:11,214 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] [2024-11-07 02:58:11,214 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 02:58:11,214 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:58:11,215 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:58:11,215 INFO L85 PathProgramCache]: Analyzing trace with hash 971969638, now seen corresponding path program 1 times [2024-11-07 02:58:11,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:58:11,216 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28396994] [2024-11-07 02:58:11,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:58:11,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:58:11,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:58:11,511 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-07 02:58:11,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:58:11,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28396994] [2024-11-07 02:58:11,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28396994] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:58:11,513 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:58:11,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 02:58:11,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000402307] [2024-11-07 02:58:11,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:58:11,514 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 02:58:11,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:58:11,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 02:58:11,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:58:11,516 INFO L87 Difference]: Start difference. First operand 63 states and 89 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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-07 02:58:11,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:58:11,600 INFO L93 Difference]: Finished difference Result 112 states and 158 transitions. [2024-11-07 02:58:11,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 02:58:11,601 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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 27 [2024-11-07 02:58:11,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:58:11,602 INFO L225 Difference]: With dead ends: 112 [2024-11-07 02:58:11,602 INFO L226 Difference]: Without dead ends: 67 [2024-11-07 02:58:11,602 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2024-11-07 02:58:11,603 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 73 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:58:11,603 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 300 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:58:11,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-07 02:58:11,607 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2024-11-07 02:58:11,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.4153846153846155) internal successors, (92), 65 states have internal predecessors, (92), 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-07 02:58:11,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 92 transitions. [2024-11-07 02:58:11,608 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 92 transitions. Word has length 27 [2024-11-07 02:58:11,608 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:58:11,608 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 92 transitions. [2024-11-07 02:58:11,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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-07 02:58:11,608 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 92 transitions. [2024-11-07 02:58:11,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 02:58:11,609 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:58:11,609 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] [2024-11-07 02:58:11,609 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 02:58:11,609 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:58:11,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:58:11,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1630832937, now seen corresponding path program 1 times [2024-11-07 02:58:11,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:58:11,610 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1568894878] [2024-11-07 02:58:11,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:58:11,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:58:11,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:58:12,297 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-07 02:58:12,297 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:58:12,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1568894878] [2024-11-07 02:58:12,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1568894878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:58:12,297 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:58:12,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-07 02:58:12,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164645344] [2024-11-07 02:58:12,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:58:12,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-07 02:58:12,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:58:12,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-07 02:58:12,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-07 02:58:12,299 INFO L87 Difference]: Start difference. First operand 66 states and 92 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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-07 02:58:12,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:58:12,435 INFO L93 Difference]: Finished difference Result 131 states and 183 transitions. [2024-11-07 02:58:12,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 02:58:12,436 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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 28 [2024-11-07 02:58:12,436 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:58:12,438 INFO L225 Difference]: With dead ends: 131 [2024-11-07 02:58:12,439 INFO L226 Difference]: Without dead ends: 83 [2024-11-07 02:58:12,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2024-11-07 02:58:12,441 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 114 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:58:12,442 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 364 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:58:12,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-07 02:58:12,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2024-11-07 02:58:12,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.4155844155844155) internal successors, (109), 77 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:58:12,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 109 transitions. [2024-11-07 02:58:12,456 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 109 transitions. Word has length 28 [2024-11-07 02:58:12,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:58:12,456 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 109 transitions. [2024-11-07 02:58:12,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 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-07 02:58:12,457 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 109 transitions. [2024-11-07 02:58:12,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 02:58:12,459 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:58:12,459 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] [2024-11-07 02:58:12,459 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 02:58:12,460 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:58:12,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:58:12,460 INFO L85 PathProgramCache]: Analyzing trace with hash 975174637, now seen corresponding path program 1 times [2024-11-07 02:58:12,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:58:12,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1181982242] [2024-11-07 02:58:12,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:58:12,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:58:12,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:58:12,748 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-07 02:58:12,749 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:58:12,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1181982242] [2024-11-07 02:58:12,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1181982242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:58:12,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:58:12,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 02:58:12,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915645927] [2024-11-07 02:58:12,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:58:12,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:58:12,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:58:12,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:58:12,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:58:12,750 INFO L87 Difference]: Start difference. First operand 78 states and 109 transitions. Second operand has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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-07 02:58:12,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:58:12,844 INFO L93 Difference]: Finished difference Result 124 states and 173 transitions. [2024-11-07 02:58:12,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 02:58:12,845 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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 28 [2024-11-07 02:58:12,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:58:12,846 INFO L225 Difference]: With dead ends: 124 [2024-11-07 02:58:12,846 INFO L226 Difference]: Without dead ends: 76 [2024-11-07 02:58:12,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:58:12,848 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 64 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:58:12,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 406 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:58:12,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-11-07 02:58:12,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2024-11-07 02:58:12,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.4166666666666667) internal successors, (102), 72 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 02:58:12,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 102 transitions. [2024-11-07 02:58:12,857 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 102 transitions. Word has length 28 [2024-11-07 02:58:12,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:58:12,860 INFO L471 AbstractCegarLoop]: Abstraction has 73 states and 102 transitions. [2024-11-07 02:58:12,860 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.5) internal successors, (28), 8 states have internal predecessors, (28), 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-07 02:58:12,860 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 102 transitions. [2024-11-07 02:58:12,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 02:58:12,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:58:12,861 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] [2024-11-07 02:58:12,861 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 02:58:12,861 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:58:12,861 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:58:12,861 INFO L85 PathProgramCache]: Analyzing trace with hash 1730187906, now seen corresponding path program 1 times [2024-11-07 02:58:12,862 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:58:12,862 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145813252] [2024-11-07 02:58:12,862 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:58:12,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:58:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 02:58:12,899 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 02:58:12,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 02:58:12,945 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 02:58:12,945 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 02:58:12,946 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 02:58:12,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 02:58:12,951 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-07 02:58:12,983 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 02:58:12,986 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 02:58:12 BoogieIcfgContainer [2024-11-07 02:58:12,987 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 02:58:12,987 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 02:58:12,987 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 02:58:12,988 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 02:58:12,988 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:58:10" (3/4) ... [2024-11-07 02:58:12,990 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 02:58:12,991 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 02:58:12,991 INFO L158 Benchmark]: Toolchain (without parser) took 3924.58ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 76.8MB in the beginning and 70.9MB in the end (delta: 5.9MB). Peak memory consumption was 33.2MB. Max. memory is 16.1GB. [2024-11-07 02:58:12,991 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 83.9MB. Free memory was 47.6MB in the beginning and 47.5MB in the end (delta: 81.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 02:58:12,992 INFO L158 Benchmark]: CACSL2BoogieTranslator took 242.24ms. Allocated memory is still 100.7MB. Free memory was 76.7MB in the beginning and 62.9MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 02:58:12,992 INFO L158 Benchmark]: Boogie Procedure Inliner took 86.47ms. Allocated memory is still 100.7MB. Free memory was 62.9MB in the beginning and 57.5MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 02:58:12,993 INFO L158 Benchmark]: Boogie Preprocessor took 78.42ms. Allocated memory is still 100.7MB. Free memory was 57.5MB in the beginning and 54.0MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 02:58:12,993 INFO L158 Benchmark]: RCFGBuilder took 690.88ms. Allocated memory is still 100.7MB. Free memory was 53.9MB in the beginning and 57.7MB in the end (delta: -3.8MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2024-11-07 02:58:12,993 INFO L158 Benchmark]: TraceAbstraction took 2815.58ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 57.2MB in the beginning and 71.0MB in the end (delta: -13.7MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2024-11-07 02:58:12,993 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 125.8MB. Free memory was 71.0MB in the beginning and 70.9MB in the end (delta: 19.6kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 02:58:12,994 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.29ms. Allocated memory is still 83.9MB. Free memory was 47.6MB in the beginning and 47.5MB in the end (delta: 81.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 242.24ms. Allocated memory is still 100.7MB. Free memory was 76.7MB in the beginning and 62.9MB in the end (delta: 13.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 86.47ms. Allocated memory is still 100.7MB. Free memory was 62.9MB in the beginning and 57.5MB in the end (delta: 5.4MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 78.42ms. Allocated memory is still 100.7MB. Free memory was 57.5MB in the beginning and 54.0MB in the end (delta: 3.5MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 690.88ms. Allocated memory is still 100.7MB. Free memory was 53.9MB in the beginning and 57.7MB in the end (delta: -3.8MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * TraceAbstraction took 2815.58ms. Allocated memory was 100.7MB in the beginning and 125.8MB in the end (delta: 25.2MB). Free memory was 57.2MB in the beginning and 71.0MB in the end (delta: -13.7MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 125.8MB. Free memory was 71.0MB in the beginning and 70.9MB in the end (delta: 19.6kB). There was no memory consumed. 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 - UnprovableResult [Line: 21]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 89. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_11 mask_SORT_11 = (SORT_11)-1 >> (sizeof(SORT_11) * 8 - 2); [L30] const SORT_11 msb_SORT_11 = (SORT_11)1 << (2 - 1); [L32] const SORT_15 mask_SORT_15 = (SORT_15)-1 >> (sizeof(SORT_15) * 8 - 32); [L33] const SORT_15 msb_SORT_15 = (SORT_15)1 << (32 - 1); [L35] const SORT_1 var_5 = 0; [L36] const SORT_11 var_12 = 0; [L37] const SORT_15 var_17 = 2; [L38] const SORT_1 var_22 = 1; [L39] const SORT_11 var_39 = 1; [L41] SORT_1 input_2; [L42] SORT_1 input_3; [L43] SORT_1 input_4; [L44] SORT_11 input_26; [L45] SORT_11 input_40; [L46] SORT_1 input_45; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L48] SORT_1 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L49] SORT_1 state_8 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L50] EXPR __VERIFIER_nondet_uchar() & mask_SORT_11 VAL [mask_SORT_11=3, mask_SORT_1=1, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L50] SORT_11 state_13 = __VERIFIER_nondet_uchar() & mask_SORT_11; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L51] SORT_1 state_31 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L53] SORT_1 init_7_arg_1 = var_5; [L54] state_6 = init_7_arg_1 [L55] SORT_1 init_9_arg_1 = var_5; [L56] state_8 = init_9_arg_1 [L57] SORT_11 init_14_arg_1 = var_12; [L58] state_13 = init_14_arg_1 [L59] SORT_1 init_32_arg_1 = var_5; [L60] state_31 = init_32_arg_1 VAL [mask_SORT_11=3, mask_SORT_1=1, state_13=0, state_31=0, state_6=0, state_8=0, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L63] input_2 = __VERIFIER_nondet_uchar() [L64] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_11=3, mask_SORT_1=1, state_13=0, state_31=0, state_6=0, state_8=0, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L64] input_2 = input_2 & mask_SORT_1 [L65] input_3 = __VERIFIER_nondet_uchar() [L66] EXPR input_3 & mask_SORT_1 VAL [input_2=0, mask_SORT_11=3, mask_SORT_1=1, state_13=0, state_31=0, state_6=0, state_8=0, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L66] input_3 = input_3 & mask_SORT_1 [L67] input_4 = __VERIFIER_nondet_uchar() [L68] input_26 = __VERIFIER_nondet_uchar() [L69] input_40 = __VERIFIER_nondet_uchar() [L70] input_45 = __VERIFIER_nondet_uchar() [L73] SORT_1 var_10_arg_0 = state_6; [L74] SORT_1 var_10_arg_1 = state_8; [L75] SORT_1 var_10 = var_10_arg_0 == var_10_arg_1; [L76] SORT_11 var_16_arg_0 = state_13; VAL [input_2=0, input_3=0, mask_SORT_11=3, mask_SORT_1=1, state_31=0, var_10=1, var_12=0, var_16_arg_0=0, var_17=2, var_22=1, var_39=1, var_5=0] [L77] EXPR var_16_arg_0 & mask_SORT_11 VAL [input_2=0, input_3=0, mask_SORT_11=3, mask_SORT_1=1, state_31=0, var_10=1, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L77] var_16_arg_0 = var_16_arg_0 & mask_SORT_11 [L78] SORT_15 var_16 = var_16_arg_0; [L79] SORT_15 var_18_arg_0 = var_16; [L80] SORT_15 var_18_arg_1 = var_17; [L81] SORT_1 var_18 = var_18_arg_0 != var_18_arg_1; [L82] SORT_1 var_19_arg_0 = var_10; [L83] SORT_1 var_19_arg_1 = var_18; VAL [input_2=0, input_3=0, mask_SORT_11=3, mask_SORT_1=1, state_31=0, var_12=0, var_17=2, var_19_arg_0=1, var_19_arg_1=1, var_22=1, var_39=1, var_5=0] [L84] EXPR var_19_arg_0 & var_19_arg_1 VAL [input_2=0, input_3=0, mask_SORT_11=3, mask_SORT_1=1, state_31=0, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L84] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L85] SORT_1 var_23_arg_0 = var_19; [L86] SORT_1 var_23 = ~var_23_arg_0; [L87] SORT_1 var_24_arg_0 = var_22; [L88] SORT_1 var_24_arg_1 = var_23; VAL [input_2=0, input_3=0, mask_SORT_11=3, mask_SORT_1=1, state_31=0, var_12=0, var_17=2, var_22=1, var_24_arg_0=1, var_24_arg_1=-2, var_39=1, var_5=0] [L89] EXPR var_24_arg_0 & var_24_arg_1 VAL [input_2=0, input_3=0, mask_SORT_11=3, mask_SORT_1=1, state_31=0, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L89] SORT_1 var_24 = var_24_arg_0 & var_24_arg_1; [L90] EXPR var_24 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_11=3, mask_SORT_1=1, state_31=0, var_12=0, var_17=2, var_22=1, var_39=1, var_5=0] [L90] var_24 = var_24 & mask_SORT_1 [L91] SORT_1 bad_25_arg_0 = var_24; [L92] CALL __VERIFIER_assert(!(bad_25_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 62 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 251 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 251 mSDsluCounter, 1552 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1163 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 201 IncrementalHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 389 mSDtfsCounter, 201 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 36 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=4, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 163 NumberOfCodeBlocks, 163 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 129 ConstructedInterpolants, 0 QuantifiedInterpolants, 420 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 0/0 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 RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-07 02:58:13,023 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/hardware-verification-bv/btor2c-lazyMod.h_b06.c -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.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 64bit --witnessprinter.graph.data.programhash ec179c2b0ae29cffe9fd88f2044fb26f554ea0dd1abcec6f41fd07a61f74c869 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 02:58:15,198 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 02:58:15,293 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-07 02:58:15,299 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 02:58:15,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 02:58:15,317 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 02:58:15,318 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 02:58:15,318 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 02:58:15,318 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 02:58:15,318 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 02:58:15,319 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 02:58:15,319 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 02:58:15,319 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 02:58:15,319 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 02:58:15,321 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 02:58:15,321 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 02:58:15,321 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 02:58:15,321 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 02:58:15,322 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 02:58:15,322 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 02:58:15,322 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 02:58:15,322 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 02:58:15,322 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 02:58:15,322 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 02:58:15,322 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 02:58:15,322 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 02:58:15,322 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 02:58:15,322 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 02:58:15,322 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 02:58:15,322 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 02:58:15,322 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 02:58:15,322 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:58:15,323 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 02:58:15,323 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 02:58:15,323 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 02:58:15,323 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 02:58:15,323 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 02:58:15,323 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 02:58:15,323 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 02:58:15,323 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 02:58:15,323 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 02:58:15,323 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ec179c2b0ae29cffe9fd88f2044fb26f554ea0dd1abcec6f41fd07a61f74c869 [2024-11-07 02:58:15,576 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 02:58:15,586 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 02:58:15,588 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 02:58:15,591 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 02:58:15,591 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 02:58:15,592 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b06.c [2024-11-07 02:58:16,975 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 02:58:17,225 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 02:58:17,226 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.h_b06.c [2024-11-07 02:58:17,238 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/566df74ff/dda45ea8047a4976b511960e695d4fa7/FLAG1310075c0 [2024-11-07 02:58:17,551 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/566df74ff/dda45ea8047a4976b511960e695d4fa7 [2024-11-07 02:58:17,554 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 02:58:17,555 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 02:58:17,556 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 02:58:17,556 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 02:58:17,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 02:58:17,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:58:17" (1/1) ... [2024-11-07 02:58:17,563 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12e7e3c9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:17, skipping insertion in model container [2024-11-07 02:58:17,563 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:58:17" (1/1) ... [2024-11-07 02:58:17,580 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 02:58:17,707 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/hardware-verification-bv/btor2c-lazyMod.h_b06.c[1245,1258] [2024-11-07 02:58:17,753 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:58:17,764 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 02:58:17,774 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/hardware-verification-bv/btor2c-lazyMod.h_b06.c[1245,1258] [2024-11-07 02:58:17,796 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:58:17,810 INFO L204 MainTranslator]: Completed translation [2024-11-07 02:58:17,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:17 WrapperNode [2024-11-07 02:58:17,811 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 02:58:17,812 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 02:58:17,813 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 02:58:17,813 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 02:58:17,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:17" (1/1) ... [2024-11-07 02:58:17,829 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:17" (1/1) ... [2024-11-07 02:58:17,858 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 155 [2024-11-07 02:58:17,862 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 02:58:17,862 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 02:58:17,862 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 02:58:17,862 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 02:58:17,871 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:17" (1/1) ... [2024-11-07 02:58:17,872 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:17" (1/1) ... [2024-11-07 02:58:17,877 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:17" (1/1) ... [2024-11-07 02:58:17,900 INFO L175 MemorySlicer]: Split 10 memory accesses to 2 slices as follows [2, 8]. 80 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [2, 8]. The 0 writes are split as follows [0, 0]. [2024-11-07 02:58:17,900 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:17" (1/1) ... [2024-11-07 02:58:17,900 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:17" (1/1) ... [2024-11-07 02:58:17,909 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:17" (1/1) ... [2024-11-07 02:58:17,915 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:17" (1/1) ... [2024-11-07 02:58:17,917 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:17" (1/1) ... [2024-11-07 02:58:17,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:17" (1/1) ... [2024-11-07 02:58:17,923 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 02:58:17,928 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 02:58:17,928 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 02:58:17,928 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 02:58:17,929 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:17" (1/1) ... [2024-11-07 02:58:17,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:58:17,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 02:58:17,963 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-07 02:58:17,967 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-07 02:58:17,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 02:58:17,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 02:58:17,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 02:58:17,988 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 02:58:17,988 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 02:58:18,069 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 02:58:18,070 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 02:58:18,242 INFO L? ?]: Removed 37 outVars from TransFormulas that were not future-live. [2024-11-07 02:58:18,242 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 02:58:18,250 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 02:58:18,251 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 02:58:18,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:58:18 BoogieIcfgContainer [2024-11-07 02:58:18,251 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 02:58:18,254 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 02:58:18,254 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 02:58:18,259 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 02:58:18,259 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:58:17" (1/3) ... [2024-11-07 02:58:18,260 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7c7342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:58:18, skipping insertion in model container [2024-11-07 02:58:18,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:58:17" (2/3) ... [2024-11-07 02:58:18,261 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a7c7342 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:58:18, skipping insertion in model container [2024-11-07 02:58:18,261 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:58:18" (3/3) ... [2024-11-07 02:58:18,264 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.h_b06.c [2024-11-07 02:58:18,275 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 02:58:18,275 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 02:58:18,322 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 02:58:18,331 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;@5a898509, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 02:58:18,332 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 02:58:18,336 INFO L276 IsEmpty]: Start isEmpty. Operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 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-07 02:58:18,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 02:58:18,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:58:18,341 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 02:58:18,341 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:58:18,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:58:18,345 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-07 02:58:18,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 02:58:18,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [352879042] [2024-11-07 02:58:18,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:58:18,356 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:58:18,356 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 02:58:18,359 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 02:58:18,360 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-07 02:58:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:58:18,464 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-07 02:58:18,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 02:58:18,777 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-07 02:58:18,778 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 02:58:18,778 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 02:58:18,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [352879042] [2024-11-07 02:58:18,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [352879042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:58:18,782 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:58:18,782 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:58:18,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674625157] [2024-11-07 02:58:18,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:58:18,789 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:58:18,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 02:58:18,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:58:18,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:58:18,806 INFO L87 Difference]: Start difference. First operand has 10 states, 8 states have (on average 1.375) internal successors, (11), 9 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-07 02:58:18,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:58:18,837 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-11-07 02:58:18,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:58:18,840 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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 5 [2024-11-07 02:58:18,840 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:58:18,845 INFO L225 Difference]: With dead ends: 17 [2024-11-07 02:58:18,845 INFO L226 Difference]: Without dead ends: 9 [2024-11-07 02:58:18,847 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:58:18,849 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:58:18,851 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:58:18,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-07 02:58:18,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-07 02:58:18,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 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-07 02:58:18,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-07 02:58:18,892 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-07 02:58:18,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:58:18,892 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-07 02:58:18,892 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 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-07 02:58:18,892 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-07 02:58:18,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 02:58:18,893 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:58:18,893 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-07 02:58:18,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-07 02:58:19,096 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:58:19,096 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:58:19,097 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:58:19,097 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-07 02:58:19,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 02:58:19,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691528186] [2024-11-07 02:58:19,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:58:19,098 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:58:19,098 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 02:58:19,101 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 02:58:19,102 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-07 02:58:19,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:58:19,187 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-07 02:58:19,192 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 02:58:19,591 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:58:19,591 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 02:58:27,031 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:58:27,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 02:58:27,033 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691528186] [2024-11-07 02:58:27,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691528186] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 02:58:27,033 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 02:58:27,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 02:58:27,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135128903] [2024-11-07 02:58:27,033 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 02:58:27,034 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:58:27,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 02:58:27,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:58:27,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=39, Unknown=1, NotChecked=0, Total=56 [2024-11-07 02:58:27,037 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-07 02:58:28,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:58:28,554 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-07 02:58:28,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 02:58:28,554 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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 8 [2024-11-07 02:58:28,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:58:28,555 INFO L225 Difference]: With dead ends: 14 [2024-11-07 02:58:28,555 INFO L226 Difference]: Without dead ends: 12 [2024-11-07 02:58:28,555 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 6.8s TimeCoverageRelationStatistics Valid=27, Invalid=62, Unknown=1, NotChecked=0, Total=90 [2024-11-07 02:58:28,555 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-07 02:58:28,556 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-07 02:58:28,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-07 02:58:28,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-07 02:58:28,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 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-07 02:58:28,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-07 02:58:28,559 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-07 02:58:28,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:58:28,559 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-07 02:58:28,559 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 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-07 02:58:28,559 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-07 02:58:28,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 02:58:28,560 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:58:28,560 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-07 02:58:28,562 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-07 02:58:28,760 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:58:28,760 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:58:28,761 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:58:28,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-07 02:58:28,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 02:58:28,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [952933514] [2024-11-07 02:58:28,762 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 02:58:28,762 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:58:28,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 02:58:28,764 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 02:58:28,766 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-07 02:58:28,855 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 02:58:28,855 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 02:58:28,862 INFO L255 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-07 02:58:28,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 02:58:31,544 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-07 02:58:31,547 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 02:58:46,891 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 ((_ zero_extend 24) |c_ULTIMATE.start_main_~mask_SORT_1~0#1|))) (let ((.cse10 (forall ((|v_ULTIMATE.start_main_~var_24_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv254 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_24_arg_0~0#1_16|))))))))) (.cse8 (forall ((|v_ULTIMATE.start_main_~var_24_arg_0~0#1_16| (_ BitVec 8))) (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) (bvand (_ bv255 32) ((_ zero_extend 24) |v_ULTIMATE.start_main_~var_24_arg_0~0#1_16|))))))))) (.cse9 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_39~0#1|))))) (let ((.cse3 (let ((.cse12 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse9))))) (.cse11 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_12~0#1|))))))))) (and (or (forall ((|ULTIMATE.start_main_~mask_SORT_11~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_11~0#1|) .cse11))) |c_ULTIMATE.start_main_~var_17~0#1|)) .cse10) (or (forall ((|ULTIMATE.start_main_~mask_SORT_11~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_11~0#1|) .cse12))) |c_ULTIMATE.start_main_~var_17~0#1|)) .cse10) (or .cse8 (forall ((|ULTIMATE.start_main_~mask_SORT_11~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_11~0#1|) .cse12))) |c_ULTIMATE.start_main_~var_17~0#1|)))) (or .cse8 (forall ((|ULTIMATE.start_main_~mask_SORT_11~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_11~0#1|) .cse11))) |c_ULTIMATE.start_main_~var_17~0#1|))))))) (.cse1 (and (or .cse8 (forall ((|ULTIMATE.start_main_~mask_SORT_11~0#1| (_ BitVec 8))) (not (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_11~0#1|)))) |c_ULTIMATE.start_main_~var_17~0#1|)))) (or (forall ((|ULTIMATE.start_main_~mask_SORT_11~0#1| (_ BitVec 8))) (= ((_ zero_extend 24) ((_ extract 7 0) (bvand .cse9 ((_ zero_extend 24) |ULTIMATE.start_main_~mask_SORT_11~0#1|)))) |c_ULTIMATE.start_main_~var_17~0#1|)) .cse10))) (.cse5 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_22~0#1|)))) (.cse0 (= |c_ULTIMATE.start_main_~state_31~0#1| (_ bv0 8)))) (and (or (not .cse0) (let ((.cse2 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 .cse5))))) (and (or .cse1 (not .cse2)) (or .cse2 .cse3)))) (or (let ((.cse7 (= (_ bv0 8) ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) .cse5)))))))) (.cse6 (= ((_ extract 7 0) (bvand .cse4 ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) ((_ extract 7 0) ((_ zero_extend 24) |c_ULTIMATE.start_main_~var_5~0#1|))))))))) (_ bv0 8)))) (and (or .cse3 .cse6) (or .cse7 .cse3) (or (not .cse7) .cse1) (or (not .cse6) .cse1))) .cse0))))) is different from false [2024-11-07 02:58:51,108 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-07 02:58:51,109 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 02:58:51,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [952933514] [2024-11-07 02:58:51,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [952933514] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 02:58:51,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 02:58:51,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-07 02:58:51,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562323793] [2024-11-07 02:58:51,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 02:58:51,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-07 02:58:51,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 02:58:51,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-07 02:58:51,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=53, Unknown=2, NotChecked=14, Total=90 [2024-11-07 02:58:51,111 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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-07 02:59:05,627 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.67s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-07 02:59:09,890 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-07 02:59:10,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:59:10,433 INFO L93 Difference]: Finished difference Result 20 states and 21 transitions. [2024-11-07 02:59:10,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-07 02:59:10,434 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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 11 [2024-11-07 02:59:10,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:59:10,434 INFO L225 Difference]: With dead ends: 20 [2024-11-07 02:59:10,434 INFO L226 Difference]: Without dead ends: 18 [2024-11-07 02:59:10,434 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 20.5s TimeCoverageRelationStatistics Valid=59, Invalid=152, Unknown=3, NotChecked=26, Total=240 [2024-11-07 02:59:10,435 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 5 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 11 IncrementalHoareTripleChecker+Unchecked, 10.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:59:10,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 34 Invalid, 2 Unknown, 11 Unchecked, 10.0s Time] [2024-11-07 02:59:10,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-07 02:59:10,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-07 02:59:10,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 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-07 02:59:10,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2024-11-07 02:59:10,440 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 11 [2024-11-07 02:59:10,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:59:10,440 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2024-11-07 02:59:10,440 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 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-07 02:59:10,441 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2024-11-07 02:59:10,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-07 02:59:10,441 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:59:10,441 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2024-11-07 02:59:10,445 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-07 02:59:10,643 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:59:10,643 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:59:10,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:59:10,644 INFO L85 PathProgramCache]: Analyzing trace with hash -37306491, now seen corresponding path program 3 times [2024-11-07 02:59:10,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 02:59:10,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1229431156] [2024-11-07 02:59:10,644 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 02:59:10,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:59:10,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 02:59:10,649 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-07 02:59:10,650 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-07 02:59:10,740 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-07 02:59:10,740 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 02:59:10,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-11-07 02:59:10,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 02:59:16,865 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-07 02:59:16,865 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 02:59:33,204 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2024-11-07 02:59:33,204 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 02:59:33,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1229431156] [2024-11-07 02:59:33,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1229431156] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 02:59:33,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 02:59:33,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 02:59:33,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715072892] [2024-11-07 02:59:33,205 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 02:59:33,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:59:33,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 02:59:33,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:59:33,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=39, Unknown=1, NotChecked=0, Total=56 [2024-11-07 02:59:33,206 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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-07 02:59:34,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:59:34,925 INFO L93 Difference]: Finished difference Result 18 states and 18 transitions. [2024-11-07 02:59:34,926 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-07 02:59:34,926 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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 17 [2024-11-07 02:59:34,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:59:34,926 INFO L225 Difference]: With dead ends: 18 [2024-11-07 02:59:34,926 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 02:59:34,927 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 9.6s TimeCoverageRelationStatistics Valid=28, Invalid=61, Unknown=1, NotChecked=0, Total=90 [2024-11-07 02:59:34,927 INFO L432 NwaCegarLoop]: 2 mSDtfsCounter, 0 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 7 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-07 02:59:34,927 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 7 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-07 02:59:34,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 02:59:34,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 02:59:34,928 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-07 02:59:34,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 02:59:34,928 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2024-11-07 02:59:34,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:59:34,928 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 02:59:34,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.0) internal successors, (16), 8 states have internal predecessors, (16), 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-07 02:59:34,928 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 02:59:34,929 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 02:59:34,931 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 02:59:34,935 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-07 02:59:35,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-07 02:59:35,135 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-11-07 02:59:35,136 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 02:59:38,820 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 02:59:38,830 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-07 02:59:38,834 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 02:59:38 BoogieIcfgContainer [2024-11-07 02:59:38,834 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 02:59:38,835 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 02:59:38,835 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 02:59:38,835 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 02:59:38,835 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:58:18" (3/4) ... [2024-11-07 02:59:38,837 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 02:59:38,845 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-07 02:59:38,846 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-07 02:59:38,846 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 02:59:38,846 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 02:59:38,846 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 02:59:38,932 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 02:59:38,932 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 02:59:38,932 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 02:59:38,933 INFO L158 Benchmark]: Toolchain (without parser) took 81377.52ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 60.4MB in the beginning and 69.9MB in the end (delta: -9.5MB). Peak memory consumption was 56.4MB. Max. memory is 16.1GB. [2024-11-07 02:59:38,934 INFO L158 Benchmark]: CDTParser took 0.41ms. Allocated memory is still 83.9MB. Free memory is still 64.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 02:59:38,934 INFO L158 Benchmark]: CACSL2BoogieTranslator took 255.62ms. Allocated memory is still 83.9MB. Free memory was 60.1MB in the beginning and 46.7MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 02:59:38,934 INFO L158 Benchmark]: Boogie Procedure Inliner took 49.29ms. Allocated memory is still 83.9MB. Free memory was 46.4MB in the beginning and 44.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 02:59:38,934 INFO L158 Benchmark]: Boogie Preprocessor took 64.80ms. Allocated memory is still 83.9MB. Free memory was 44.6MB in the beginning and 42.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 02:59:38,935 INFO L158 Benchmark]: RCFGBuilder took 323.60ms. Allocated memory is still 83.9MB. Free memory was 42.8MB in the beginning and 26.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 02:59:38,935 INFO L158 Benchmark]: TraceAbstraction took 80580.30ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 25.8MB in the beginning and 24.6MB in the end (delta: 1.3MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. [2024-11-07 02:59:38,935 INFO L158 Benchmark]: Witness Printer took 97.39ms. Allocated memory is still 100.7MB. Free memory was 24.6MB in the beginning and 69.9MB in the end (delta: -45.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 02:59:38,936 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.41ms. Allocated memory is still 83.9MB. Free memory is still 64.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 255.62ms. Allocated memory is still 83.9MB. Free memory was 60.1MB in the beginning and 46.7MB in the end (delta: 13.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 49.29ms. Allocated memory is still 83.9MB. Free memory was 46.4MB in the beginning and 44.6MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 64.80ms. Allocated memory is still 83.9MB. Free memory was 44.6MB in the beginning and 42.8MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 323.60ms. Allocated memory is still 83.9MB. Free memory was 42.8MB in the beginning and 26.4MB in the end (delta: 16.4MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 80580.30ms. Allocated memory was 83.9MB in the beginning and 100.7MB in the end (delta: 16.8MB). Free memory was 25.8MB in the beginning and 24.6MB in the end (delta: 1.3MB). Peak memory consumption was 14.4MB. Max. memory is 16.1GB. * Witness Printer took 97.39ms. Allocated memory is still 100.7MB. Free memory was 24.6MB in the beginning and 69.9MB in the end (delta: -45.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression * 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: 21]: 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, 10 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 76.8s, OverallIterations: 4, TraceHistogramMax: 5, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 22.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 11.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 66 SdHoareTripleChecker+Invalid, 10.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 11 IncrementalHoareTripleChecker+Unchecked, 51 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 79 IncrementalHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 15 mSDtfsCounter, 79 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 81 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 36.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=18occurred in iteration=3, 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.0s AutomataMinimizationTime, 4 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 52.9s InterpolantComputationTime, 41 NumberOfCodeBlocks, 32 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 70 ConstructedInterpolants, 26 QuantifiedInterpolants, 5338 SizeOfPredicates, 39 NumberOfNonLiveVariables, 352 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 36/70 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: 61]: Loop Invariant Derived loop invariant: ((((((0 == state_13) || (1 == state_13)) && (2 == var_17)) && (1 == var_39)) && (1 == mask_SORT_1)) && (0 == var_12)) RESULT: Ultimate proved your program to be correct! [2024-11-07 02:59:39,144 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2024-11-07 02:59:39,333 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 137 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE