./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.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.mul2.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', '275f3564868260c0f8bba92723013207b6a72ca364aead8f492ecb284c649797'] 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.mul2.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 275f3564868260c0f8bba92723013207b6a72ca364aead8f492ecb284c649797 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:13:18,260 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:13:18,344 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2024-11-07 03:13:18,353 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:13:18,353 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:13:18,377 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:13:18,378 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:13:18,378 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:13:18,379 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:13:18,379 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:13:18,379 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:13:18,379 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:13:18,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:13:18,379 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:13:18,379 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:13:18,379 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:13:18,379 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:13:18,379 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-07 03:13:18,379 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:13:18,379 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:13:18,379 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:13:18,380 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:13:18,380 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:13:18,380 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:13:18,380 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:13:18,380 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:13:18,380 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:13:18,380 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:13:18,380 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:13:18,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:13:18,380 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:13:18,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:13:18,380 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:13:18,380 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-07 03:13:18,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-07 03:13:18,380 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:13:18,380 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:13:18,380 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:13:18,380 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:13:18,380 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 -> 275f3564868260c0f8bba92723013207b6a72ca364aead8f492ecb284c649797 [2024-11-07 03:13:18,638 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:13:18,652 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:13:18,655 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:13:18,656 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:13:18,656 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:13:18,658 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.mul2.c [2024-11-07 03:13:19,861 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:13:20,083 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:13:20,084 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.c [2024-11-07 03:13:20,094 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8535e440c/cd08425b19704d74bb8a35d61f0f8eb5/FLAGea6791b54 [2024-11-07 03:13:20,453 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/8535e440c/cd08425b19704d74bb8a35d61f0f8eb5 [2024-11-07 03:13:20,455 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:13:20,457 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:13:20,458 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:13:20,458 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:13:20,461 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:13:20,462 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:13:20" (1/1) ... [2024-11-07 03:13:20,463 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78594bcc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:20, skipping insertion in model container [2024-11-07 03:13:20,463 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:13:20" (1/1) ... [2024-11-07 03:13:20,475 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:13:20,565 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.mul2.c[1298,1311] [2024-11-07 03:13:20,602 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:13:20,612 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:13:20,619 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.mul2.c[1298,1311] [2024-11-07 03:13:20,652 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:13:20,666 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:13:20,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:20 WrapperNode [2024-11-07 03:13:20,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:13:20,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:13:20,668 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:13:20,668 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:13:20,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:20" (1/1) ... [2024-11-07 03:13:20,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:20" (1/1) ... [2024-11-07 03:13:20,724 INFO L138 Inliner]: procedures = 18, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 373 [2024-11-07 03:13:20,725 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:13:20,725 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:13:20,725 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:13:20,725 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:13:20,738 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:20" (1/1) ... [2024-11-07 03:13:20,739 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:20" (1/1) ... [2024-11-07 03:13:20,746 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:20" (1/1) ... [2024-11-07 03:13:20,773 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-11-07 03:13:20,773 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:20" (1/1) ... [2024-11-07 03:13:20,774 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:20" (1/1) ... [2024-11-07 03:13:20,783 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:20" (1/1) ... [2024-11-07 03:13:20,789 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:20" (1/1) ... [2024-11-07 03:13:20,795 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:20" (1/1) ... [2024-11-07 03:13:20,796 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:20" (1/1) ... [2024-11-07 03:13:20,799 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:13:20,799 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:13:20,799 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:13:20,799 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:13:20,800 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:20" (1/1) ... [2024-11-07 03:13:20,804 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:13:20,813 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:13:20,823 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 03:13:20,826 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 03:13:20,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:13:20,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-07 03:13:20,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-07 03:13:20,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:13:20,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:13:20,939 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:13:20,941 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:13:21,391 INFO L? ?]: Removed 137 outVars from TransFormulas that were not future-live. [2024-11-07 03:13:21,392 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:13:21,401 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:13:21,403 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:13:21,406 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:13:21 BoogieIcfgContainer [2024-11-07 03:13:21,406 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:13:21,408 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:13:21,408 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:13:21,412 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:13:21,415 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:13:20" (1/3) ... [2024-11-07 03:13:21,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e69f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:13:21, skipping insertion in model container [2024-11-07 03:13:21,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:20" (2/3) ... [2024-11-07 03:13:21,416 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@45e69f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:13:21, skipping insertion in model container [2024-11-07 03:13:21,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:13:21" (3/3) ... [2024-11-07 03:13:21,421 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul2.c [2024-11-07 03:13:21,433 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:13:21,434 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:13:21,484 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:13:21,499 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;@eab3dd8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:13:21,499 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:13:21,505 INFO L276 IsEmpty]: Start isEmpty. Operand has 94 states, 92 states have (on average 1.4891304347826086) internal successors, (137), 93 states have internal predecessors, (137), 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 03:13:21,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-07 03:13:21,510 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:21,511 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 03:13:21,511 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:21,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:21,517 INFO L85 PathProgramCache]: Analyzing trace with hash 1096880015, now seen corresponding path program 1 times [2024-11-07 03:13:21,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:21,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287195573] [2024-11-07 03:13:21,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:21,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:21,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:22,032 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 03:13:22,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:13:22,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287195573] [2024-11-07 03:13:22,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [287195573] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:22,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:22,038 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:13:22,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718218175] [2024-11-07 03:13:22,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:22,041 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:13:22,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:13:22,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:13:22,058 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:13:22,059 INFO L87 Difference]: Start difference. First operand has 94 states, 92 states have (on average 1.4891304347826086) internal successors, (137), 93 states have internal predecessors, (137), 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 7.75) internal successors, (31), 4 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 03:13:22,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:22,103 INFO L93 Difference]: Finished difference Result 153 states and 225 transitions. [2024-11-07 03:13:22,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:13:22,105 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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 03:13:22,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:22,112 INFO L225 Difference]: With dead ends: 153 [2024-11-07 03:13:22,113 INFO L226 Difference]: Without dead ends: 93 [2024-11-07 03:13:22,119 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 03:13:22,121 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 387 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 03:13:22,125 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 387 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:13:22,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-07 03:13:22,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-07 03:13:22,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.4673913043478262) internal successors, (135), 92 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:22,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 135 transitions. [2024-11-07 03:13:22,165 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 135 transitions. Word has length 31 [2024-11-07 03:13:22,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:22,166 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 135 transitions. [2024-11-07 03:13:22,166 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 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 03:13:22,166 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 135 transitions. [2024-11-07 03:13:22,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-07 03:13:22,168 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:22,168 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 03:13:22,168 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-07 03:13:22,168 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:22,169 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:22,169 INFO L85 PathProgramCache]: Analyzing trace with hash -354762581, now seen corresponding path program 1 times [2024-11-07 03:13:22,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:22,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [175618206] [2024-11-07 03:13:22,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:22,170 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:22,340 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 03:13:22,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:13:22,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [175618206] [2024-11-07 03:13:22,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [175618206] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:22,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:22,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:13:22,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939072157] [2024-11-07 03:13:22,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:22,343 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:13:22,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:13:22,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:13:22,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:13:22,344 INFO L87 Difference]: Start difference. First operand 93 states and 135 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 03:13:22,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:22,382 INFO L93 Difference]: Finished difference Result 154 states and 223 transitions. [2024-11-07 03:13:22,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:13:22,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 32 [2024-11-07 03:13:22,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:22,385 INFO L225 Difference]: With dead ends: 154 [2024-11-07 03:13:22,385 INFO L226 Difference]: Without dead ends: 95 [2024-11-07 03:13:22,385 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 03:13:22,386 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 252 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 383 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 03:13:22,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 383 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:13:22,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-07 03:13:22,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-07 03:13:22,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.4574468085106382) internal successors, (137), 94 states have internal predecessors, (137), 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 03:13:22,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 137 transitions. [2024-11-07 03:13:22,391 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 137 transitions. Word has length 32 [2024-11-07 03:13:22,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:22,391 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 137 transitions. [2024-11-07 03:13:22,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 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 03:13:22,392 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 137 transitions. [2024-11-07 03:13:22,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-07 03:13:22,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:22,392 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:13:22,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-07 03:13:22,392 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:22,393 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:22,393 INFO L85 PathProgramCache]: Analyzing trace with hash 789296104, now seen corresponding path program 1 times [2024-11-07 03:13:22,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:22,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475525378] [2024-11-07 03:13:22,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:22,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:22,626 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 03:13:22,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-07 03:13:22,626 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475525378] [2024-11-07 03:13:22,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475525378] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:22,626 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:22,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-07 03:13:22,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857792460] [2024-11-07 03:13:22,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:22,627 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-07 03:13:22,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-07 03:13:22,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-07 03:13:22,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-07 03:13:22,627 INFO L87 Difference]: Start difference. First operand 95 states and 137 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 03:13:22,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:22,666 INFO L93 Difference]: Finished difference Result 154 states and 222 transitions. [2024-11-07 03:13:22,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:13:22,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 33 [2024-11-07 03:13:22,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:22,667 INFO L225 Difference]: With dead ends: 154 [2024-11-07 03:13:22,667 INFO L226 Difference]: Without dead ends: 93 [2024-11-07 03:13:22,667 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-07 03:13:22,668 INFO L432 NwaCegarLoop]: 125 mSDtfsCounter, 109 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:13:22,668 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 374 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-07 03:13:22,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2024-11-07 03:13:22,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2024-11-07 03:13:22,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 92 states have internal predecessors, (133), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-07 03:13:22,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 133 transitions. [2024-11-07 03:13:22,673 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 133 transitions. Word has length 33 [2024-11-07 03:13:22,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:22,673 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 133 transitions. [2024-11-07 03:13:22,673 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 03:13:22,673 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 133 transitions. [2024-11-07 03:13:22,674 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-07 03:13:22,674 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:22,674 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-07 03:13:22,674 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-07 03:13:22,674 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:22,675 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:22,675 INFO L85 PathProgramCache]: Analyzing trace with hash 262920718, now seen corresponding path program 1 times [2024-11-07 03:13:22,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-07 03:13:22,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282773167] [2024-11-07 03:13:22,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:22,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-07 03:13:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:13:22,716 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-07 03:13:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-07 03:13:22,764 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-07 03:13:22,764 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-07 03:13:22,765 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-07 03:13:22,766 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-07 03:13:22,769 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-07 03:13:22,796 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-07 03:13:22,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 07.11 03:13:22 BoogieIcfgContainer [2024-11-07 03:13:22,800 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-07 03:13:22,801 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-07 03:13:22,801 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-07 03:13:22,801 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-07 03:13:22,802 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:13:21" (3/4) ... [2024-11-07 03:13:22,803 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-07 03:13:22,804 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-07 03:13:22,805 INFO L158 Benchmark]: Toolchain (without parser) took 2347.97ms. Allocated memory is still 100.7MB. Free memory was 77.5MB in the beginning and 29.7MB in the end (delta: 47.8MB). Peak memory consumption was 50.5MB. Max. memory is 16.1GB. [2024-11-07 03:13:22,805 INFO L158 Benchmark]: CDTParser took 1.14ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:13:22,805 INFO L158 Benchmark]: CACSL2BoogieTranslator took 209.15ms. Allocated memory is still 100.7MB. Free memory was 77.3MB in the beginning and 62.8MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-07 03:13:22,805 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.55ms. Allocated memory is still 100.7MB. Free memory was 62.8MB in the beginning and 57.9MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-07 03:13:22,806 INFO L158 Benchmark]: Boogie Preprocessor took 73.38ms. Allocated memory is still 100.7MB. Free memory was 57.9MB in the beginning and 54.6MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 03:13:22,806 INFO L158 Benchmark]: RCFGBuilder took 607.29ms. Allocated memory is still 100.7MB. Free memory was 54.6MB in the beginning and 53.8MB in the end (delta: 722.5kB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2024-11-07 03:13:22,806 INFO L158 Benchmark]: TraceAbstraction took 1392.27ms. Allocated memory is still 100.7MB. Free memory was 53.4MB in the beginning and 30.6MB in the end (delta: 22.8MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-11-07 03:13:22,807 INFO L158 Benchmark]: Witness Printer took 2.93ms. Allocated memory is still 100.7MB. Free memory was 30.6MB in the beginning and 29.7MB in the end (delta: 901.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-07 03:13:22,808 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.14ms. Allocated memory is still 83.9MB. Free memory is still 48.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 209.15ms. Allocated memory is still 100.7MB. Free memory was 77.3MB in the beginning and 62.8MB in the end (delta: 14.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.55ms. Allocated memory is still 100.7MB. Free memory was 62.8MB in the beginning and 57.9MB in the end (delta: 4.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 73.38ms. Allocated memory is still 100.7MB. Free memory was 57.9MB in the beginning and 54.6MB in the end (delta: 3.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 607.29ms. Allocated memory is still 100.7MB. Free memory was 54.6MB in the beginning and 53.8MB in the end (delta: 722.5kB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * TraceAbstraction took 1392.27ms. Allocated memory is still 100.7MB. Free memory was 53.4MB in the beginning and 30.6MB in the end (delta: 22.8MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Witness Printer took 2.93ms. Allocated memory is still 100.7MB. Free memory was 30.6MB in the beginning and 29.7MB in the end (delta: 901.6kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 22]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of bitwiseAnd at line 92. Possible FailurePath: [L27] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L28] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L30] const SORT_5 mask_SORT_5 = (SORT_5)-1 >> (sizeof(SORT_5) * 8 - 64); [L31] const SORT_5 msb_SORT_5 = (SORT_5)1 << (64 - 1); [L33] const SORT_9 mask_SORT_9 = (SORT_9)-1 >> (sizeof(SORT_9) * 8 - 128); [L34] const SORT_9 msb_SORT_9 = (SORT_9)1 << (128 - 1); [L36] const SORT_9 var_10 = 0; [L37] const SORT_1 var_18 = 1; [L38] const SORT_5 var_22 = 0; [L40] SORT_1 input_2; [L41] SORT_1 input_3; [L42] SORT_1 input_4; [L43] SORT_5 input_6; [L44] SORT_5 input_7; [L45] SORT_1 input_8; [L47] EXPR __VERIFIER_nondet_uint128() & mask_SORT_9 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L47] SORT_9 state_11 = __VERIFIER_nondet_uint128() & mask_SORT_9; [L48] EXPR __VERIFIER_nondet_uint128() & mask_SORT_9 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L48] SORT_9 state_13 = __VERIFIER_nondet_uint128() & mask_SORT_9; [L49] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L49] SORT_5 state_23 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L50] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L50] SORT_5 state_25 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L51] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L51] SORT_1 state_27 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L52] EXPR __VERIFIER_nondet_uchar() & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L52] SORT_1 state_29 = __VERIFIER_nondet_uchar() & mask_SORT_1; [L53] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L53] SORT_5 state_31 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L54] EXPR __VERIFIER_nondet_ulong() & mask_SORT_5 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, var_10=0, var_18=1, var_22=0] [L54] SORT_5 state_33 = __VERIFIER_nondet_ulong() & mask_SORT_5; [L56] SORT_9 init_12_arg_1 = var_10; [L57] state_11 = init_12_arg_1 [L58] SORT_9 init_14_arg_1 = var_10; [L59] state_13 = init_14_arg_1 [L60] SORT_5 init_24_arg_1 = var_22; [L61] state_23 = init_24_arg_1 [L62] SORT_5 init_26_arg_1 = var_22; [L63] state_25 = init_26_arg_1 [L64] SORT_1 init_28_arg_1 = var_18; [L65] state_27 = init_28_arg_1 [L66] SORT_1 init_30_arg_1 = var_18; [L67] state_29 = init_30_arg_1 [L68] SORT_5 init_32_arg_1 = var_22; [L69] state_31 = init_32_arg_1 [L70] SORT_5 init_34_arg_1 = var_22; [L71] state_33 = init_34_arg_1 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_11=0, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L74] input_2 = __VERIFIER_nondet_uchar() [L75] input_3 = __VERIFIER_nondet_uchar() [L76] EXPR input_3 & mask_SORT_1 VAL [mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_11=0, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L76] input_3 = input_3 & mask_SORT_1 [L77] input_4 = __VERIFIER_nondet_uchar() [L78] EXPR input_4 & mask_SORT_1 VAL [input_3=0, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_11=0, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L78] input_4 = input_4 & mask_SORT_1 [L79] input_6 = __VERIFIER_nondet_ulong() [L80] input_7 = __VERIFIER_nondet_ulong() [L81] input_8 = __VERIFIER_nondet_uchar() [L82] EXPR input_8 & mask_SORT_1 VAL [input_3=0, input_4=0, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_11=0, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L82] input_8 = input_8 & mask_SORT_1 [L85] SORT_9 var_15_arg_0 = state_11; [L86] SORT_9 var_15_arg_1 = state_13; [L87] SORT_1 var_15 = var_15_arg_0 == var_15_arg_1; [L88] SORT_1 var_19_arg_0 = var_15; [L89] SORT_1 var_19 = ~var_19_arg_0; [L90] SORT_1 var_20_arg_0 = var_18; [L91] SORT_1 var_20_arg_1 = var_19; VAL [input_3=0, input_4=0, input_8=0, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_20_arg_0=1, var_20_arg_1=-2, var_22=0] [L92] EXPR var_20_arg_0 & var_20_arg_1 VAL [input_3=0, input_4=0, input_8=0, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L92] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L93] EXPR var_20 & mask_SORT_1 VAL [input_3=0, input_4=0, input_8=0, mask_SORT_1=1, mask_SORT_5=-1, mask_SORT_9=-1, state_13=0, state_23=0, state_25=0, state_27=1, state_29=1, state_31=0, state_33=0, var_10=0, var_18=1, var_22=0] [L93] var_20 = var_20 & mask_SORT_1 [L94] SORT_1 bad_21_arg_0 = var_20; [L95] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L22] COND TRUE !(cond) [L22] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 94 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 4, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 109 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 109 mSDsluCounter, 1144 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 757 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 40 IncrementalHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 387 mSDtfsCounter, 40 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 15 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=95occurred in iteration=2, InterpolantAutomatonStates: 12, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 130 NumberOfCodeBlocks, 130 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 93 ConstructedInterpolants, 0 QuantifiedInterpolants, 170 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 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 03:13:22,833 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 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.mul2.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 275f3564868260c0f8bba92723013207b6a72ca364aead8f492ecb284c649797 --- Real Ultimate output --- This is Ultimate 0.3.0-?-4f9af40 [2024-11-07 03:13:24,777 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-07 03:13:24,894 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2024-11-07 03:13:24,905 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-07 03:13:24,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-07 03:13:24,936 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-07 03:13:24,936 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-07 03:13:24,937 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-07 03:13:24,937 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-07 03:13:24,937 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-07 03:13:24,937 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-07 03:13:24,937 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-07 03:13:24,938 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-07 03:13:24,938 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-07 03:13:24,938 INFO L153 SettingsManager]: * Use SBE=true [2024-11-07 03:13:24,938 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-07 03:13:24,938 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-07 03:13:24,938 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-07 03:13:24,938 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-07 03:13:24,938 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-07 03:13:24,938 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-07 03:13:24,938 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-07 03:13:24,938 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-07 03:13:24,938 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-07 03:13:24,939 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-07 03:13:24,939 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-07 03:13:24,939 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-07 03:13:24,939 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-07 03:13:24,939 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-07 03:13:24,939 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-07 03:13:24,939 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-07 03:13:24,939 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:13:24,940 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-07 03:13:24,940 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-07 03:13:24,941 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-07 03:13:24,941 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-07 03:13:24,941 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-07 03:13:24,941 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-07 03:13:24,941 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-07 03:13:24,941 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-07 03:13:24,941 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-07 03:13:24,941 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 -> 275f3564868260c0f8bba92723013207b6a72ca364aead8f492ecb284c649797 [2024-11-07 03:13:25,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-07 03:13:25,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-07 03:13:25,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-07 03:13:25,197 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-07 03:13:25,197 INFO L274 PluginConnector]: CDTParser initialized [2024-11-07 03:13:25,198 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.mul2.c [2024-11-07 03:13:26,396 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-07 03:13:26,629 INFO L384 CDTParser]: Found 1 translation units. [2024-11-07 03:13:26,631 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.mul2.c [2024-11-07 03:13:26,640 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/57dcbfd66/71bfbb5fc9814c05855e7982a7fffada/FLAG72e379466 [2024-11-07 03:13:26,967 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/57dcbfd66/71bfbb5fc9814c05855e7982a7fffada [2024-11-07 03:13:26,969 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-07 03:13:26,970 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-07 03:13:26,972 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-07 03:13:26,972 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-07 03:13:26,977 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-07 03:13:26,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:13:26" (1/1) ... [2024-11-07 03:13:26,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@34347fe2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:26, skipping insertion in model container [2024-11-07 03:13:26,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 07.11 03:13:26" (1/1) ... [2024-11-07 03:13:27,000 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-07 03:13:27,148 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.mul2.c[1298,1311] [2024-11-07 03:13:27,192 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:13:27,201 INFO L200 MainTranslator]: Completed pre-run [2024-11-07 03:13:27,214 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.mul2.c[1298,1311] [2024-11-07 03:13:27,233 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-07 03:13:27,243 INFO L204 MainTranslator]: Completed translation [2024-11-07 03:13:27,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:27 WrapperNode [2024-11-07 03:13:27,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-07 03:13:27,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-07 03:13:27,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-07 03:13:27,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-07 03:13:27,251 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:27" (1/1) ... [2024-11-07 03:13:27,263 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:27" (1/1) ... [2024-11-07 03:13:27,292 INFO L138 Inliner]: procedures = 18, calls = 15, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 205 [2024-11-07 03:13:27,292 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-07 03:13:27,293 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-07 03:13:27,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-07 03:13:27,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-07 03:13:27,306 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:27" (1/1) ... [2024-11-07 03:13:27,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:27" (1/1) ... [2024-11-07 03:13:27,316 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:27" (1/1) ... [2024-11-07 03:13:27,328 INFO L175 MemorySlicer]: Split 9 memory accesses to 2 slices as follows [2, 7]. 78 percent of accesses are in the largest equivalence class. The 9 initializations are split as follows [2, 7]. The 0 writes are split as follows [0, 0]. [2024-11-07 03:13:27,328 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:27" (1/1) ... [2024-11-07 03:13:27,328 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:27" (1/1) ... [2024-11-07 03:13:27,342 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:27" (1/1) ... [2024-11-07 03:13:27,344 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:27" (1/1) ... [2024-11-07 03:13:27,351 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:27" (1/1) ... [2024-11-07 03:13:27,352 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:27" (1/1) ... [2024-11-07 03:13:27,354 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-07 03:13:27,355 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-07 03:13:27,355 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-07 03:13:27,355 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-07 03:13:27,356 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:27" (1/1) ... [2024-11-07 03:13:27,360 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-07 03:13:27,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2024-11-07 03:13:27,381 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 03:13:27,383 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 03:13:27,400 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-07 03:13:27,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-07 03:13:27,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-07 03:13:27,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-07 03:13:27,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-07 03:13:27,482 INFO L238 CfgBuilder]: Building ICFG [2024-11-07 03:13:27,483 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-07 03:13:28,316 INFO L? ?]: Removed 31 outVars from TransFormulas that were not future-live. [2024-11-07 03:13:28,316 INFO L287 CfgBuilder]: Performing block encoding [2024-11-07 03:13:28,321 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-07 03:13:28,321 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-07 03:13:28,322 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:13:28 BoogieIcfgContainer [2024-11-07 03:13:28,322 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-07 03:13:28,324 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-07 03:13:28,324 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-07 03:13:28,348 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-07 03:13:28,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 07.11 03:13:26" (1/3) ... [2024-11-07 03:13:28,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5523e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:13:28, skipping insertion in model container [2024-11-07 03:13:28,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 07.11 03:13:27" (2/3) ... [2024-11-07 03:13:28,349 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c5523e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 07.11 03:13:28, skipping insertion in model container [2024-11-07 03:13:28,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 07.11 03:13:28" (3/3) ... [2024-11-07 03:13:28,351 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.mul2.c [2024-11-07 03:13:28,360 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-07 03:13:28,360 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-07 03:13:28,394 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-07 03:13:28,404 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;@65707586, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-07 03:13:28,404 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-07 03:13:28,408 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 03:13:28,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-07 03:13:28,412 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:28,413 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-07 03:13:28,414 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:28,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:28,418 INFO L85 PathProgramCache]: Analyzing trace with hash 28694789, now seen corresponding path program 1 times [2024-11-07 03:13:28,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:13:28,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1606654499] [2024-11-07 03:13:28,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:28,426 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 03:13:28,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:13:28,431 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 03:13:28,436 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 03:13:28,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:28,515 INFO L255 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-07 03:13:28,520 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:13:28,708 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 03:13:28,709 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-07 03:13:28,709 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:13:28,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1606654499] [2024-11-07 03:13:28,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1606654499] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-07 03:13:28,710 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-07 03:13:28,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-07 03:13:28,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936940250] [2024-11-07 03:13:28,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-07 03:13:28,714 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-07 03:13:28,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:13:28,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-07 03:13:28,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:13:28,726 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 03:13:29,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:13:29,682 INFO L93 Difference]: Finished difference Result 17 states and 22 transitions. [2024-11-07 03:13:29,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-07 03:13:29,688 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 03:13:29,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:13:29,696 INFO L225 Difference]: With dead ends: 17 [2024-11-07 03:13:29,696 INFO L226 Difference]: Without dead ends: 9 [2024-11-07 03:13:29,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-07 03:13:29,702 INFO L432 NwaCegarLoop]: 5 mSDtfsCounter, 0 mSDsluCounter, 6 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 11 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-07 03:13:29,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 11 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-07 03:13:29,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2024-11-07 03:13:29,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2024-11-07 03:13:29,739 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 03:13:29,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2024-11-07 03:13:29,746 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2024-11-07 03:13:29,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:13:29,746 INFO L471 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2024-11-07 03:13:29,747 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 03:13:29,747 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2024-11-07 03:13:29,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-07 03:13:29,747 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:13:29,748 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-07 03:13:29,754 INFO L540 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)] Forceful destruction successful, exit code 0 [2024-11-07 03:13:29,948 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 03:13:29,949 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:13:29,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:13:29,949 INFO L85 PathProgramCache]: Analyzing trace with hash 152739811, now seen corresponding path program 1 times [2024-11-07 03:13:29,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:13:29,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1403945314] [2024-11-07 03:13:29,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-07 03:13:29,952 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 03:13:29,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:13:29,954 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 03:13:29,956 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 03:13:30,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-07 03:13:30,306 INFO L255 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-07 03:13:30,309 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:13:30,934 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 03:13:30,935 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-07 03:14:09,783 WARN L286 SmtUtils]: Spent 8.13s on a formula simplification that was a NOOP. DAG size: 65 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2024-11-07 03:14:16,816 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 03:14:16,817 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-07 03:14:16,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1403945314] [2024-11-07 03:14:16,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1403945314] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-07 03:14:16,818 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-07 03:14:16,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2024-11-07 03:14:16,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412275860] [2024-11-07 03:14:16,818 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-07 03:14:16,820 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-07 03:14:16,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-07 03:14:16,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-07 03:14:16,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=39, Unknown=1, NotChecked=0, Total=56 [2024-11-07 03:14:16,821 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 03:14:21,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-07 03:14:23,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-07 03:14:25,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.55s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-07 03:14:26,917 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-07 03:14:30,924 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [1] [2024-11-07 03:14:31,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-07 03:14:31,152 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2024-11-07 03:14:31,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-07 03:14:31,154 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 03:14:31,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-07 03:14:31,154 INFO L225 Difference]: With dead ends: 14 [2024-11-07 03:14:31,154 INFO L226 Difference]: Without dead ends: 12 [2024-11-07 03:14:31,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 23.5s TimeCoverageRelationStatistics Valid=28, Invalid=61, Unknown=1, NotChecked=0, Total=90 [2024-11-07 03:14:31,155 INFO L432 NwaCegarLoop]: 4 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2024-11-07 03:14:31,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 2 Unknown, 0 Unchecked, 14.0s Time] [2024-11-07 03:14:31,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2024-11-07 03:14:31,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2024-11-07 03:14:31,161 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 03:14:31,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2024-11-07 03:14:31,161 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2024-11-07 03:14:31,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-07 03:14:31,161 INFO L471 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2024-11-07 03:14:31,161 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 03:14:31,161 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2024-11-07 03:14:31,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-07 03:14:31,161 INFO L207 NwaCegarLoop]: Found error trace [2024-11-07 03:14:31,162 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2024-11-07 03:14:31,186 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 03:14:31,365 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 03:14:31,366 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-07 03:14:31,367 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-07 03:14:31,367 INFO L85 PathProgramCache]: Analyzing trace with hash 1906115653, now seen corresponding path program 2 times [2024-11-07 03:14:31,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-07 03:14:31,368 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353646455] [2024-11-07 03:14:31,368 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-07 03:14:31,368 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 03:14:31,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-07 03:14:31,370 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 03:14:31,372 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 03:14:32,039 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-07 03:14:32,039 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-07 03:14:32,086 INFO L255 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-07 03:14:32,093 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-07 03:14:50,638 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 03:14:50,638 INFO L311 TraceCheckSpWp]: Computing backward predicates...