./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal57.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.cal57.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', '2328acd9311a64c53ad5874211f9b9da337dc2131958a2367da03f2374a4827a'] 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.cal57.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 2328acd9311a64c53ad5874211f9b9da337dc2131958a2367da03f2374a4827a --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 02:32:29,757 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 02:32:29,824 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:32:29,829 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 02:32:29,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 02:32:29,855 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 02:32:29,859 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 02:32:29,859 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 02:32:29,860 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 02:32:29,860 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 02:32:29,860 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 02:32:29,860 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 02:32:29,860 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 02:32:29,860 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 02:32:29,860 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 02:32:29,861 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 02:32:29,861 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 02:32:29,861 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 02:32:29,861 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 02:32:29,861 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 02:32:29,861 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 02:32:29,861 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 02:32:29,861 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 02:32:29,861 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 02:32:29,861 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 02:32:29,861 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 02:32:29,861 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 02:32:29,862 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 02:32:29,862 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 02:32:29,862 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:32:29,862 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 02:32:29,862 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 02:32:29,862 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 02:32:29,864 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 02:32:29,864 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 02:32:29,864 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 02:32:29,864 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 02:32:29,864 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 02:32:29,865 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 02:32:29,865 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 -> 2328acd9311a64c53ad5874211f9b9da337dc2131958a2367da03f2374a4827a [2024-11-07 02:32:30,189 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 02:32:30,195 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 02:32:30,197 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 02:32:30,199 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 02:32:30,200 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 02:32:30,201 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.cal57.c [2024-11-07 02:32:31,465 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 02:32:31,687 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 02:32:31,688 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal57.c [2024-11-07 02:32:31,695 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd5d7c92a/dfd6c1c59b714c2eaea7584be57cca2a/FLAG621c0e5bd [2024-11-07 02:32:31,714 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/cd5d7c92a/dfd6c1c59b714c2eaea7584be57cca2a [2024-11-07 02:32:31,717 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 02:32:31,718 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 02:32:31,719 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 02:32:31,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 02:32:31,722 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 02:32:31,723 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:32:31" (1/1) ... [2024-11-07 02:32:31,723 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@690b6e74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:32:31, skipping insertion in model container [2024-11-07 02:32:31,724 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:32:31" (1/1) ... [2024-11-07 02:32:31,738 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 02:32:31,871 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.cal57.c[1245,1258] [2024-11-07 02:32:31,927 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:32:31,936 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 02:32:31,948 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.cal57.c[1245,1258] [2024-11-07 02:32:31,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:32:31,991 INFO L204 MainTranslator]: Completed translation [2024-11-07 02:32:31,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:32:31 WrapperNode [2024-11-07 02:32:31,992 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 02:32:31,994 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 02:32:31,994 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 02:32:31,994 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 02:32:32,002 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:32:31" (1/1) ... [2024-11-07 02:32:32,011 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:32:31" (1/1) ... [2024-11-07 02:32:32,060 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 296 [2024-11-07 02:32:32,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 02:32:32,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 02:32:32,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 02:32:32,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 02:32:32,070 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:32:31" (1/1) ... [2024-11-07 02:32:32,071 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:32:31" (1/1) ... [2024-11-07 02:32:32,082 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:32:31" (1/1) ... [2024-11-07 02:32:32,112 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:32:32,112 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:32:31" (1/1) ... [2024-11-07 02:32:32,113 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:32:31" (1/1) ... [2024-11-07 02:32:32,129 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:32:31" (1/1) ... [2024-11-07 02:32:32,133 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:32:31" (1/1) ... [2024-11-07 02:32:32,136 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:32:31" (1/1) ... [2024-11-07 02:32:32,138 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:32:31" (1/1) ... [2024-11-07 02:32:32,148 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 02:32:32,149 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 02:32:32,149 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 02:32:32,149 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 02:32:32,149 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:32:31" (1/1) ... [2024-11-07 02:32:32,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:32:32,165 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 02:32:32,176 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:32:32,178 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:32:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 02:32:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 02:32:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 02:32:32,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 02:32:32,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 02:32:32,275 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 02:32:32,276 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 02:32:32,769 INFO L? ?]: Removed 128 outVars from TransFormulas that were not future-live. [2024-11-07 02:32:32,769 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 02:32:32,780 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 02:32:32,780 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 02:32:32,780 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:32:32 BoogieIcfgContainer [2024-11-07 02:32:32,781 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 02:32:32,783 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 02:32:32,783 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 02:32:32,787 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 02:32:32,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:32:31" (1/3) ... [2024-11-07 02:32:32,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ccc26a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:32:32, skipping insertion in model container [2024-11-07 02:32:32,788 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:32:31" (2/3) ... [2024-11-07 02:32:32,788 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ccc26a8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:32:32, skipping insertion in model container [2024-11-07 02:32:32,789 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:32:32" (3/3) ... [2024-11-07 02:32:32,790 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal57.c [2024-11-07 02:32:32,803 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 02:32:32,804 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 02:32:32,856 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 02:32:32,866 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;@1010868, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 02:32:32,867 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 02:32:32,872 INFO L276 IsEmpty]: Start isEmpty. Operand has 66 states, 64 states have (on average 1.484375) internal successors, (95), 65 states have internal predecessors, (95), 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:32:32,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-07 02:32:32,879 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:32:32,880 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:32:32,880 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:32:32,886 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:32:32,886 INFO L85 PathProgramCache]: Analyzing trace with hash 2017394231, now seen corresponding path program 1 times [2024-11-07 02:32:32,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:32:32,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [274015661] [2024-11-07 02:32:32,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:32:32,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:32:33,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:32:33,507 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:32:33,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:32:33,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [274015661] [2024-11-07 02:32:33,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [274015661] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:32:33,511 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:32:33,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:32:33,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811593195] [2024-11-07 02:32:33,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:32:33,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:32:33,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:32:33,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:32:33,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:32:33,539 INFO L87 Difference]: Start difference. First operand has 66 states, 64 states have (on average 1.484375) internal successors, (95), 65 states have internal predecessors, (95), 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.75) internal successors, (27), 4 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:32:33,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:32:33,591 INFO L93 Difference]: Finished difference Result 113 states and 165 transitions. [2024-11-07 02:32:33,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:32:33,594 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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:32:33,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:32:33,601 INFO L225 Difference]: With dead ends: 113 [2024-11-07 02:32:33,603 INFO L226 Difference]: Without dead ends: 65 [2024-11-07 02:32:33,606 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:32:33,609 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 261 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:32:33,610 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 261 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:32:33,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2024-11-07 02:32:33,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2024-11-07 02:32:33,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.453125) internal successors, (93), 64 states have internal predecessors, (93), 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:32:33,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 93 transitions. [2024-11-07 02:32:33,646 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 93 transitions. Word has length 27 [2024-11-07 02:32:33,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:32:33,646 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 93 transitions. [2024-11-07 02:32:33,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 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:32:33,647 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 93 transitions. [2024-11-07 02:32:33,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-07 02:32:33,647 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:32:33,647 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:32:33,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 02:32:33,648 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:32:33,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:32:33,650 INFO L85 PathProgramCache]: Analyzing trace with hash -1883592983, now seen corresponding path program 1 times [2024-11-07 02:32:33,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:32:33,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187905302] [2024-11-07 02:32:33,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:32:33,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:32:33,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:32:33,853 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:32:33,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:32:33,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187905302] [2024-11-07 02:32:33,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187905302] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:32:33,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:32:33,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:32:33,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392726293] [2024-11-07 02:32:33,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:32:33,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:32:33,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:32:33,858 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:32:33,858 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:32:33,858 INFO L87 Difference]: Start difference. First operand 65 states and 93 transitions. Second operand has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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:32:33,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:32:33,895 INFO L93 Difference]: Finished difference Result 114 states and 163 transitions. [2024-11-07 02:32:33,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:32:33,897 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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:32:33,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:32:33,898 INFO L225 Difference]: With dead ends: 114 [2024-11-07 02:32:33,899 INFO L226 Difference]: Without dead ends: 67 [2024-11-07 02:32:33,900 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:32:33,900 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 0 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 257 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:32:33,901 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 257 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:32:33,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-11-07 02:32:33,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2024-11-07 02:32:33,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 66 states have internal predecessors, (95), 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:32:33,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 95 transitions. [2024-11-07 02:32:33,911 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 95 transitions. Word has length 28 [2024-11-07 02:32:33,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:32:33,912 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 95 transitions. [2024-11-07 02:32:33,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.0) internal successors, (28), 4 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:32:33,912 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 95 transitions. [2024-11-07 02:32:33,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-07 02:32:33,913 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:32:33,913 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:32:33,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 02:32:33,913 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:32:33,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:32:33,914 INFO L85 PathProgramCache]: Analyzing trace with hash 640193872, now seen corresponding path program 1 times [2024-11-07 02:32:33,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:32:33,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653555749] [2024-11-07 02:32:33,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:32:33,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:32:33,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:32:34,286 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:32:34,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:32:34,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653555749] [2024-11-07 02:32:34,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653555749] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:32:34,288 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:32:34,288 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-07 02:32:34,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1241833590] [2024-11-07 02:32:34,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:32:34,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-07 02:32:34,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:32:34,290 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-07 02:32:34,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-07 02:32:34,290 INFO L87 Difference]: Start difference. First operand 67 states and 95 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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:32:34,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:32:34,414 INFO L93 Difference]: Finished difference Result 153 states and 215 transitions. [2024-11-07 02:32:34,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-07 02:32:34,416 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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 29 [2024-11-07 02:32:34,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:32:34,417 INFO L225 Difference]: With dead ends: 153 [2024-11-07 02:32:34,417 INFO L226 Difference]: Without dead ends: 104 [2024-11-07 02:32:34,417 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:32:34,418 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 179 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 179 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:32:34,418 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [179 Valid, 326 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:32:34,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-07 02:32:34,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 85. [2024-11-07 02:32:34,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.4404761904761905) internal successors, (121), 84 states have internal predecessors, (121), 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:32:34,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 121 transitions. [2024-11-07 02:32:34,429 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 121 transitions. Word has length 29 [2024-11-07 02:32:34,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:32:34,430 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 121 transitions. [2024-11-07 02:32:34,431 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 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:32:34,431 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 121 transitions. [2024-11-07 02:32:34,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-07 02:32:34,431 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:32:34,431 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:32:34,431 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 02:32:34,431 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:32:34,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:32:34,433 INFO L85 PathProgramCache]: Analyzing trace with hash -719939504, now seen corresponding path program 1 times [2024-11-07 02:32:34,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:32:34,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050512938] [2024-11-07 02:32:34,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:32:34,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:32:34,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:32:34,743 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:32:34,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:32:34,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050512938] [2024-11-07 02:32:34,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050512938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:32:34,743 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:32:34,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-07 02:32:34,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588861207] [2024-11-07 02:32:34,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:32:34,746 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:32:34,747 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:32:34,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:32:34,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:32:34,748 INFO L87 Difference]: Start difference. First operand 85 states and 121 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:32:34,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:32:34,905 INFO L93 Difference]: Finished difference Result 155 states and 217 transitions. [2024-11-07 02:32:34,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 02:32:34,907 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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 30 [2024-11-07 02:32:34,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:32:34,908 INFO L225 Difference]: With dead ends: 155 [2024-11-07 02:32:34,908 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 02:32:34,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2024-11-07 02:32:34,909 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 182 mSDsluCounter, 396 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 476 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:32:34,909 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [182 Valid, 476 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:32:34,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 02:32:34,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 88. [2024-11-07 02:32:34,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 87 states have (on average 1.4367816091954022) internal successors, (125), 87 states have internal predecessors, (125), 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:32:34,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 125 transitions. [2024-11-07 02:32:34,920 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 125 transitions. Word has length 30 [2024-11-07 02:32:34,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:32:34,920 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 125 transitions. [2024-11-07 02:32:34,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 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:32:34,921 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 125 transitions. [2024-11-07 02:32:34,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-07 02:32:34,921 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:32:34,921 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:32:34,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 02:32:34,922 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:32:34,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:32:34,922 INFO L85 PathProgramCache]: Analyzing trace with hash -523941715, now seen corresponding path program 1 times [2024-11-07 02:32:34,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:32:34,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120693222] [2024-11-07 02:32:34,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:32:34,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:32:34,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:32:35,411 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:32:35,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 02:32:35,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120693222] [2024-11-07 02:32:35,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1120693222] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:32:35,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:32:35,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-07 02:32:35,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983456882] [2024-11-07 02:32:35,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:32:35,413 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-07 02:32:35,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 02:32:35,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-07 02:32:35,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-07 02:32:35,414 INFO L87 Difference]: Start difference. First operand 88 states and 125 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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:32:35,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:32:35,612 INFO L93 Difference]: Finished difference Result 155 states and 216 transitions. [2024-11-07 02:32:35,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 02:32:35,613 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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 31 [2024-11-07 02:32:35,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:32:35,615 INFO L225 Difference]: With dead ends: 155 [2024-11-07 02:32:35,615 INFO L226 Difference]: Without dead ends: 106 [2024-11-07 02:32:35,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-07 02:32:35,616 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 177 mSDsluCounter, 382 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:32:35,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 458 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:32:35,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-07 02:32:35,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 92. [2024-11-07 02:32:35,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 91 states have (on average 1.4285714285714286) internal successors, (130), 91 states have internal predecessors, (130), 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:32:35,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 130 transitions. [2024-11-07 02:32:35,628 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 130 transitions. Word has length 31 [2024-11-07 02:32:35,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:32:35,628 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 130 transitions. [2024-11-07 02:32:35,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 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:32:35,628 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 130 transitions. [2024-11-07 02:32:35,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-07 02:32:35,629 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:32:35,629 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 02:32:35,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-07 02:32:35,632 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:32:35,632 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:32:35,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1792746033, now seen corresponding path program 1 times [2024-11-07 02:32:35,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 02:32:35,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746687893] [2024-11-07 02:32:35,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:32:35,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 02:32:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 02:32:35,675 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 02:32:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 02:32:35,727 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 02:32:35,728 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 02:32:35,728 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 02:32:35,730 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-07 02:32:35,733 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-11-07 02:32:35,767 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 02:32:35,771 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 02:32:35 BoogieIcfgContainer [2024-11-07 02:32:35,771 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 02:32:35,772 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 02:32:35,772 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 02:32:35,772 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 02:32:35,773 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:32:32" (3/4) ... [2024-11-07 02:32:35,774 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 02:32:35,775 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 02:32:35,776 INFO L158 Benchmark]: Toolchain (without parser) took 4057.72ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 91.7MB in the beginning and 93.8MB in the end (delta: -2.0MB). Peak memory consumption was 42.2MB. Max. memory is 16.1GB. [2024-11-07 02:32:35,777 INFO L158 Benchmark]: CDTParser took 0.72ms. Allocated memory is still 117.4MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 02:32:35,777 INFO L158 Benchmark]: CACSL2BoogieTranslator took 273.55ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 77.0MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 02:32:35,777 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.66ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 70.7MB in the end (delta: 6.3MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 02:32:35,777 INFO L158 Benchmark]: Boogie Preprocessor took 87.10ms. Allocated memory is still 117.4MB. Free memory was 70.7MB in the beginning and 66.7MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 02:32:35,779 INFO L158 Benchmark]: RCFGBuilder took 632.08ms. Allocated memory is still 117.4MB. Free memory was 66.6MB in the beginning and 75.0MB in the end (delta: -8.5MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. [2024-11-07 02:32:35,779 INFO L158 Benchmark]: TraceAbstraction took 2988.62ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 74.6MB in the beginning and 93.8MB in the end (delta: -19.2MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. [2024-11-07 02:32:35,779 INFO L158 Benchmark]: Witness Printer took 3.54ms. Allocated memory is still 159.4MB. Free memory was 93.8MB in the beginning and 93.8MB in the end (delta: 37.5kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 02:32:35,781 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.72ms. Allocated memory is still 117.4MB. Free memory is still 80.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 273.55ms. Allocated memory is still 117.4MB. Free memory was 91.6MB in the beginning and 77.0MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.66ms. Allocated memory is still 117.4MB. Free memory was 77.0MB in the beginning and 70.7MB in the end (delta: 6.3MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 87.10ms. Allocated memory is still 117.4MB. Free memory was 70.7MB in the beginning and 66.7MB in the end (delta: 4.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 632.08ms. Allocated memory is still 117.4MB. Free memory was 66.6MB in the beginning and 75.0MB in the end (delta: -8.5MB). Peak memory consumption was 31.3MB. Max. memory is 16.1GB. * TraceAbstraction took 2988.62ms. Allocated memory was 117.4MB in the beginning and 159.4MB in the end (delta: 41.9MB). Free memory was 74.6MB in the beginning and 93.8MB in the end (delta: -19.2MB). Peak memory consumption was 27.8MB. Max. memory is 16.1GB. * Witness Printer took 3.54ms. Allocated memory is still 159.4MB. Free memory was 93.8MB in the beginning and 93.8MB in the end (delta: 37.5kB). 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 bitwiseOr at line 96, overapproximation of bitwiseAnd at line 101. 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_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 3); [L30] const SORT_5 msb_SORT_5 = (SORT_5)1 << (3 - 1); [L32] const SORT_1 var_11 = 0; [L33] const SORT_5 var_15 = 0; [L34] const SORT_5 var_21 = 1; [L35] const SORT_1 var_31 = 1; [L37] SORT_1 input_2; [L38] SORT_1 input_3; [L39] SORT_1 input_4; [L40] SORT_5 input_6; [L41] SORT_5 input_7; [L42] SORT_1 input_8; [L43] SORT_5 input_9; [L44] SORT_5 input_10; [L46] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=7, var_11=0, var_15=0, var_21=1, var_31=1] [L46] SORT_1 state_12 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L47] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=7, var_11=0, var_15=0, var_21=1, var_31=1] [L47] SORT_5 state_16 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L48] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=7, var_11=0, var_15=0, var_21=1, var_31=1] [L48] SORT_1 state_18 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L49] EXPR __VERIFIER_nondet_uchar() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=7, var_11=0, var_15=0, var_21=1, var_31=1] [L49] SORT_5 state_23 = __VERIFIER_nondet_uchar() & mask_SORT_5; [L51] SORT_1 init_13_arg_1 = var_11; [L52] state_12 = init_13_arg_1 [L53] SORT_5 init_17_arg_1 = var_15; [L54] state_16 = init_17_arg_1 [L55] SORT_1 init_19_arg_1 = var_11; [L56] state_18 = init_19_arg_1 [L57] SORT_5 init_24_arg_1 = var_15; [L58] state_23 = init_24_arg_1 VAL [mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_15=0, var_21=1, var_31=1] [L61] input_2 = __VERIFIER_nondet_uchar() [L62] EXPR input_2 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_15=0, var_21=1, var_31=1] [L62] input_2 = input_2 & mask_SORT_1 [L63] input_3 = __VERIFIER_nondet_uchar() [L64] EXPR input_3 & mask_SORT_1 VAL [input_2=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_16=0, state_18=0, state_23=0, var_11=0, var_15=0, var_21=1, var_31=1] [L64] input_3 = input_3 & mask_SORT_1 [L65] input_4 = __VERIFIER_nondet_uchar() [L66] input_6 = __VERIFIER_nondet_uchar() [L67] input_7 = __VERIFIER_nondet_uchar() [L68] input_8 = __VERIFIER_nondet_uchar() [L69] input_9 = __VERIFIER_nondet_uchar() [L70] input_10 = __VERIFIER_nondet_uchar() [L73] SORT_1 var_14_arg_0 = state_12; [L74] SORT_1 var_14 = ~var_14_arg_0; [L75] SORT_1 var_20_arg_0 = state_18; [L76] SORT_5 var_20_arg_1 = state_16; [L77] SORT_5 var_20_arg_2 = input_7; [L78] SORT_5 var_20 = var_20_arg_0 ? var_20_arg_1 : var_20_arg_2; VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_18=0, state_23=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=1, var_31=1] [L79] EXPR var_20 & mask_SORT_5 VAL [input_2=0, input_3=0, input_7=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, state_18=0, state_23=0, var_11=0, var_14=-1, var_15=0, var_21=1, var_31=1] [L79] var_20 = var_20 & mask_SORT_5 [L80] SORT_5 var_22_arg_0 = var_20; [L81] SORT_5 var_22_arg_1 = var_21; [L82] SORT_1 var_22 = var_22_arg_0 == var_22_arg_1; [L83] SORT_1 var_25_arg_0 = state_18; [L84] SORT_5 var_25_arg_1 = state_23; [L85] SORT_5 var_25_arg_2 = input_7; [L86] SORT_5 var_25 = var_25_arg_0 ? var_25_arg_1 : var_25_arg_2; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=1, var_22=0, var_25=0, var_31=1] [L87] EXPR var_25 & mask_SORT_5 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_14=-1, var_15=0, var_20=0, var_21=1, var_22=0, var_31=1] [L87] var_25 = var_25 & mask_SORT_5 [L88] SORT_5 var_26_arg_0 = var_25; [L89] SORT_5 var_26_arg_1 = var_21; [L90] SORT_1 var_26 = var_26_arg_0 == var_26_arg_1; [L91] SORT_1 var_27_arg_0 = var_22; [L92] SORT_1 var_27_arg_1 = var_26; [L93] SORT_1 var_27 = var_27_arg_0 == var_27_arg_1; [L94] SORT_1 var_28_arg_0 = var_14; [L95] SORT_1 var_28_arg_1 = var_27; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=1, var_25=0, var_28_arg_0=-1, var_28_arg_1=1, var_31=1] [L96] EXPR var_28_arg_0 | var_28_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=1, var_25=0, var_31=1] [L96] SORT_1 var_28 = var_28_arg_0 | var_28_arg_1; [L97] SORT_1 var_32_arg_0 = var_28; [L98] SORT_1 var_32 = ~var_32_arg_0; [L99] SORT_1 var_33_arg_0 = var_31; [L100] SORT_1 var_33_arg_1 = var_32; VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=1, var_25=0, var_31=1, var_33_arg_0=1, var_33_arg_1=-1] [L101] EXPR var_33_arg_0 & var_33_arg_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=1, var_25=0, var_31=1] [L101] SORT_1 var_33 = var_33_arg_0 & var_33_arg_1; [L102] EXPR var_33 & mask_SORT_1 VAL [input_2=0, input_3=0, mask_SORT_1=1, mask_SORT_5=7, state_12=0, var_11=0, var_15=0, var_20=0, var_21=1, var_25=0, var_31=1] [L102] var_33 = var_33 & mask_SORT_1 [L103] SORT_1 bad_34_arg_0 = var_33; [L104] CALL __VERIFIER_assert(!(bad_34_arg_0)) [L21] COND TRUE !(cond) [L21] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 66 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.9s, OverallIterations: 6, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 538 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 538 mSDsluCounter, 1778 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1363 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 223 IncrementalHoareTripleChecker+Invalid, 224 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 415 mSDtfsCounter, 223 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=92occurred in iteration=5, InterpolantAutomatonStates: 31, 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, 51 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 177 NumberOfCodeBlocks, 177 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 140 ConstructedInterpolants, 0 QuantifiedInterpolants, 486 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:32:35,811 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.cal57.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 2328acd9311a64c53ad5874211f9b9da337dc2131958a2367da03f2374a4827a --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 02:32:38,029 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 02:32:38,136 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:32:38,144 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 02:32:38,145 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 02:32:38,172 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 02:32:38,173 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 02:32:38,173 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 02:32:38,174 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 02:32:38,174 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 02:32:38,174 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 02:32:38,174 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 02:32:38,174 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 02:32:38,174 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 02:32:38,174 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 02:32:38,175 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 02:32:38,175 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 02:32:38,175 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 02:32:38,175 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 02:32:38,175 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 02:32:38,175 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 02:32:38,176 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 02:32:38,176 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 02:32:38,176 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 02:32:38,176 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 02:32:38,176 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 02:32:38,176 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 02:32:38,177 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 02:32:38,177 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 02:32:38,177 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 02:32:38,177 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 02:32:38,177 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:32:38,177 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 02:32:38,177 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 02:32:38,178 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 02:32:38,178 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 02:32:38,178 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 02:32:38,178 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 02:32:38,178 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 02:32:38,178 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 02:32:38,178 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 02:32:38,178 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 -> 2328acd9311a64c53ad5874211f9b9da337dc2131958a2367da03f2374a4827a [2024-11-07 02:32:38,470 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 02:32:38,480 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 02:32:38,483 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 02:32:38,485 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 02:32:38,486 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 02:32:38,488 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.cal57.c [2024-11-07 02:32:39,849 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 02:32:40,100 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 02:32:40,102 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.cal57.c [2024-11-07 02:32:40,115 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a2361b7c/3432e9b45bc54bc5b60b0f7f7d6c5434/FLAGb22ed0f2d [2024-11-07 02:32:40,137 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4a2361b7c/3432e9b45bc54bc5b60b0f7f7d6c5434 [2024-11-07 02:32:40,141 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 02:32:40,143 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 02:32:40,145 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 02:32:40,145 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 02:32:40,149 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 02:32:40,150 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:32:40" (1/1) ... [2024-11-07 02:32:40,152 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4174c6b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:32:40, skipping insertion in model container [2024-11-07 02:32:40,153 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 02:32:40" (1/1) ... [2024-11-07 02:32:40,170 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 02:32:40,317 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.cal57.c[1245,1258] [2024-11-07 02:32:40,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:32:40,385 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 02:32:40,395 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.cal57.c[1245,1258] [2024-11-07 02:32:40,435 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 02:32:40,449 INFO L204 MainTranslator]: Completed translation [2024-11-07 02:32:40,450 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:32:40 WrapperNode [2024-11-07 02:32:40,450 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 02:32:40,451 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 02:32:40,451 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 02:32:40,452 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 02:32:40,462 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:32:40" (1/1) ... [2024-11-07 02:32:40,473 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:32:40" (1/1) ... [2024-11-07 02:32:40,515 INFO L138 Inliner]: procedures = 17, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 184 [2024-11-07 02:32:40,516 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 02:32:40,517 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 02:32:40,517 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 02:32:40,517 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 02:32:40,528 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:32:40" (1/1) ... [2024-11-07 02:32:40,528 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:32:40" (1/1) ... [2024-11-07 02:32:40,533 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:32:40" (1/1) ... [2024-11-07 02:32:40,559 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:32:40,563 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:32:40" (1/1) ... [2024-11-07 02:32:40,564 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:32:40" (1/1) ... [2024-11-07 02:32:40,572 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:32:40" (1/1) ... [2024-11-07 02:32:40,579 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:32:40" (1/1) ... [2024-11-07 02:32:40,585 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:32:40" (1/1) ... [2024-11-07 02:32:40,586 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:32:40" (1/1) ... [2024-11-07 02:32:40,590 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 02:32:40,595 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 02:32:40,595 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 02:32:40,595 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 02:32:40,596 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:32:40" (1/1) ... [2024-11-07 02:32:40,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 02:32:40,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 02:32:40,630 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:32:40,637 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:32:40,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 02:32:40,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 02:32:40,659 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 02:32:40,659 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 02:32:40,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 02:32:40,766 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 02:32:40,768 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 02:32:41,002 INFO L? ?]: Removed 47 outVars from TransFormulas that were not future-live. [2024-11-07 02:32:41,002 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 02:32:41,011 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 02:32:41,012 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 02:32:41,012 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:32:41 BoogieIcfgContainer [2024-11-07 02:32:41,012 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 02:32:41,015 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 02:32:41,015 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 02:32:41,039 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 02:32:41,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 02:32:40" (1/3) ... [2024-11-07 02:32:41,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9d4f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:32:41, skipping insertion in model container [2024-11-07 02:32:41,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 02:32:40" (2/3) ... [2024-11-07 02:32:41,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4b9d4f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 02:32:41, skipping insertion in model container [2024-11-07 02:32:41,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:32:41" (3/3) ... [2024-11-07 02:32:41,041 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.cal57.c [2024-11-07 02:32:41,053 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 02:32:41,054 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 02:32:41,104 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 02:32:41,114 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;@563505d5, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 02:32:41,114 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 02:32:41,120 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:32:41,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 02:32:41,125 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:32:41,126 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 02:32:41,126 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:32:41,130 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:32:41,131 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-07 02:32:41,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 02:32:41,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1936803617] [2024-11-07 02:32:41,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:32:41,144 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:32:41,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 02:32:41,149 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:32:41,150 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:32:41,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:32:41,276 INFO L255 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-07 02:32:41,284 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 02:32:41,447 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:32:41,447 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 02:32:41,450 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 02:32:41,451 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1936803617] [2024-11-07 02:32:41,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1936803617] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 02:32:41,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 02:32:41,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 02:32:41,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695993009] [2024-11-07 02:32:41,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 02:32:41,456 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 02:32:41,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 02:32:41,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 02:32:41,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 02:32:41,475 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:32:41,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:32:41,521 INFO L93 Difference]: Finished difference Result 18 states and 23 transitions. [2024-11-07 02:32:41,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 02:32:41,524 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:32:41,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:32:41,529 INFO L225 Difference]: With dead ends: 18 [2024-11-07 02:32:41,529 INFO L226 Difference]: Without dead ends: 10 [2024-11-07 02:32:41,531 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-07 02:32:41,534 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 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:32:41,534 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 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:32:41,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2024-11-07 02:32:41,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 9. [2024-11-07 02:32:41,554 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:32:41,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-07 02:32:41,558 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-07 02:32:41,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:32:41,558 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-07 02:32:41,558 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:32:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-07 02:32:41,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 02:32:41,559 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:32:41,559 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-07 02:32:41,564 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:32:41,762 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:32:41,762 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:32:41,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:32:41,763 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-07 02:32:41,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 02:32:41,763 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1295850253] [2024-11-07 02:32:41,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 02:32:41,764 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:32:41,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 02:32:41,766 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:32:41,767 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:32:41,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 02:32:41,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-07 02:32:41,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 02:32:42,276 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:32:42,276 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 02:32:43,672 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:32:43,672 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 02:32:43,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1295850253] [2024-11-07 02:32:43,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1295850253] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 02:32:43,672 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 02:32:43,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 02:32:43,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381713458] [2024-11-07 02:32:43,673 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 02:32:43,673 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 02:32:43,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 02:32:43,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 02:32:43,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-07 02:32:43,674 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:32:43,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:32:43,760 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-07 02:32:43,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 02:32:43,766 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:32:43,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:32:43,766 INFO L225 Difference]: With dead ends: 14 [2024-11-07 02:32:43,766 INFO L226 Difference]: Without dead ends: 12 [2024-11-07 02:32:43,767 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-07 02:32:43,767 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 02:32:43,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 16 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 02:32:43,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-07 02:32:43,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-07 02:32:43,772 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:32:43,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-07 02:32:43,772 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-07 02:32:43,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:32:43,773 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-07 02:32:43,773 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:32:43,773 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-07 02:32:43,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 02:32:43,774 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:32:43,774 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-07 02:32:43,778 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:32:43,974 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:32:43,975 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:32:43,976 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:32:43,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-07 02:32:43,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 02:32:43,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [52348166] [2024-11-07 02:32:43,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 02:32:43,976 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:32:43,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 02:32:43,978 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:32:43,979 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:32:44,108 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 02:32:44,108 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 02:32:44,117 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 46 conjuncts are in the unsatisfiable core [2024-11-07 02:32:44,123 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 02:32:45,070 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:32:45,071 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 02:33:04,746 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:33:04,747 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 02:33:04,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [52348166] [2024-11-07 02:33:04,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [52348166] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 02:33:04,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 02:33:04,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-07 02:33:04,747 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790007739] [2024-11-07 02:33:04,747 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 02:33:04,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-07 02:33:04,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 02:33:04,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-07 02:33:04,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-07 02:33:04,749 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 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:33:04,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:33:04,959 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2024-11-07 02:33:04,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-07 02:33:04,959 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 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:33:04,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:33:04,960 INFO L225 Difference]: With dead ends: 17 [2024-11-07 02:33:04,960 INFO L226 Difference]: Without dead ends: 15 [2024-11-07 02:33:04,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=38, Invalid=144, Unknown=0, NotChecked=0, Total=182 [2024-11-07 02:33:04,961 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 62 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:33:04,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 62 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:33:04,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2024-11-07 02:33:04,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2024-11-07 02:33:04,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 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:33:04,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2024-11-07 02:33:04,964 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2024-11-07 02:33:04,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:33:04,964 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2024-11-07 02:33:04,965 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.6666666666666667) internal successors, (20), 12 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:33:04,965 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2024-11-07 02:33:04,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2024-11-07 02:33:04,965 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 02:33:04,965 INFO L215 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2024-11-07 02:33:04,968 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:33:05,165 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:33:05,166 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 02:33:05,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 02:33:05,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1333570723, now seen corresponding path program 3 times [2024-11-07 02:33:05,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 02:33:05,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1255182490] [2024-11-07 02:33:05,167 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-07 02:33:05,167 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:33:05,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 02:33:05,171 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:33:05,172 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:33:05,300 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-07 02:33:05,301 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 02:33:05,303 INFO L255 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 60 conjuncts are in the unsatisfiable core [2024-11-07 02:33:05,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 02:33:06,255 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 02:33:06,255 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 02:33:48,464 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-07 02:33:48,464 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 02:33:48,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1255182490] [2024-11-07 02:33:48,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1255182490] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 02:33:48,464 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 02:33:48,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2024-11-07 02:33:48,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544239704] [2024-11-07 02:33:48,465 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 02:33:48,465 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-07 02:33:48,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 02:33:48,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-07 02:33:48,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2024-11-07 02:33:48,466 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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:33:48,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 02:33:48,660 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2024-11-07 02:33:48,660 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-07 02:33:48,661 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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 14 [2024-11-07 02:33:48,661 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 02:33:48,661 INFO L225 Difference]: With dead ends: 15 [2024-11-07 02:33:48,661 INFO L226 Difference]: Without dead ends: 0 [2024-11-07 02:33:48,661 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 9.1s TimeCoverageRelationStatistics Valid=64, Invalid=176, Unknown=0, NotChecked=0, Total=240 [2024-11-07 02:33:48,662 INFO L432 NwaCegarLoop]: 3 mSDtfsCounter, 0 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 14 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-07 02:33:48,662 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 14 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-07 02:33:48,663 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-07 02:33:48,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-07 02:33:48,663 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:33:48,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-07 02:33:48,663 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 14 [2024-11-07 02:33:48,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 02:33:48,663 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-07 02:33:48,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 1.5714285714285714) internal successors, (22), 14 states have internal predecessors, (22), 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:33:48,663 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-07 02:33:48,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-07 02:33:48,665 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 02:33:48,669 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:33:48,866 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:33:48,869 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1] [2024-11-07 02:33:48,871 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-11-07 02:33:49,043 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 02:33:49,051 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-07 02:33:49,051 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-07 02:33:49,052 WARN L976 BoogieBacktranslator]: Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression [2024-11-07 02:33:49,060 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 02:33:49 BoogieIcfgContainer [2024-11-07 02:33:49,060 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 02:33:49,061 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 02:33:49,061 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 02:33:49,061 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 02:33:49,062 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 02:32:41" (3/4) ... [2024-11-07 02:33:49,063 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-07 02:33:49,069 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 15 nodes and edges [2024-11-07 02:33:49,069 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2024-11-07 02:33:49,070 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-07 02:33:49,070 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 02:33:49,070 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-11-07 02:33:49,146 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-07 02:33:49,146 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-07 02:33:49,146 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 02:33:49,147 INFO L158 Benchmark]: Toolchain (without parser) took 69004.10ms. Allocated memory was 83.9MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 60.3MB in the beginning and 694.7MB in the end (delta: -634.4MB). Peak memory consumption was 338.1MB. Max. memory is 16.1GB. [2024-11-07 02:33:49,147 INFO L158 Benchmark]: CDTParser took 0.42ms. Allocated memory is still 83.9MB. Free memory is still 65.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 02:33:49,147 INFO L158 Benchmark]: CACSL2BoogieTranslator took 305.93ms. Allocated memory is still 83.9MB. Free memory was 60.0MB in the beginning and 46.0MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 02:33:49,147 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.90ms. Allocated memory is still 83.9MB. Free memory was 46.0MB in the beginning and 44.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 02:33:49,147 INFO L158 Benchmark]: Boogie Preprocessor took 77.29ms. Allocated memory is still 83.9MB. Free memory was 44.0MB in the beginning and 41.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 02:33:49,148 INFO L158 Benchmark]: RCFGBuilder took 417.56ms. Allocated memory is still 83.9MB. Free memory was 41.6MB in the beginning and 22.5MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 02:33:49,148 INFO L158 Benchmark]: TraceAbstraction took 68045.61ms. Allocated memory was 83.9MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 22.2MB in the beginning and 702.9MB in the end (delta: -680.8MB). Peak memory consumption was 296.1MB. Max. memory is 16.1GB. [2024-11-07 02:33:49,148 INFO L158 Benchmark]: Witness Printer took 84.92ms. Allocated memory is still 1.1GB. Free memory was 702.9MB in the beginning and 694.7MB in the end (delta: 8.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 02:33:49,152 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.42ms. Allocated memory is still 83.9MB. Free memory is still 65.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 305.93ms. Allocated memory is still 83.9MB. Free memory was 60.0MB in the beginning and 46.0MB in the end (delta: 14.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.90ms. Allocated memory is still 83.9MB. Free memory was 46.0MB in the beginning and 44.0MB in the end (delta: 2.0MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 77.29ms. Allocated memory is still 83.9MB. Free memory was 44.0MB in the beginning and 41.6MB in the end (delta: 2.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 417.56ms. Allocated memory is still 83.9MB. Free memory was 41.6MB in the beginning and 22.5MB in the end (delta: 19.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 68045.61ms. Allocated memory was 83.9MB in the beginning and 1.1GB in the end (delta: 973.1MB). Free memory was 22.2MB in the beginning and 702.9MB in the end (delta: -680.8MB). Peak memory consumption was 296.1MB. Max. memory is 16.1GB. * Witness Printer took 84.92ms. Allocated memory is still 1.1GB. Free memory was 702.9MB in the beginning and 694.7MB in the end (delta: 8.3MB). 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 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Expression type not yet supported in backtranslation: QuantifierExpression - 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: 67.8s, OverallIterations: 4, TraceHistogramMax: 4, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 69 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 54 mSDsCounter, 7 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 124 IncrementalHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 7 mSolverCounterUnsat, 15 mSDtfsCounter, 124 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 13.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=15occurred in iteration=3, InterpolantAutomatonStates: 28, 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, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 65.7s InterpolantComputationTime, 38 NumberOfCodeBlocks, 35 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 64 ConstructedInterpolants, 27 QuantifiedInterpolants, 107381 SizeOfPredicates, 38 NumberOfNonLiveVariables, 465 ConjunctsInSsa, 155 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 12/48 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: 59]: Loop Invariant Derived loop invariant: ((((((((((0 == var_15) && (0 == var_11)) && (7 == mask_SORT_5)) && (1 == mask_SORT_1)) && (1 == state_12)) && (1 == state_18)) && (1 == var_31)) && (1 == var_21)) || ((((((((0 == state_18) && (0 == var_15)) && (0 == state_12)) && (0 == var_11)) && (7 == mask_SORT_5)) && (1 == mask_SORT_1)) && (1 == var_31)) && (1 == var_21))) || ((((((((0 == state_18) && (0 == var_15)) && (0 == var_11)) && (7 == mask_SORT_5)) && (1 == mask_SORT_1)) && (1 == state_12)) && (1 == var_31)) && (1 == var_21))) RESULT: Ultimate proved your program to be correct! [2024-11-07 02:33:49,203 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE