./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound50.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 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/nla-digbench-scaling/divbin2_valuebound50.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 698c604312f3eb09bef7f8f6e092d43de99877a411ec8f3c76598811466d02b7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 03:14:34,638 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 03:14:34,697 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 03:14:34,701 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 03:14:34,701 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 03:14:34,719 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 03:14:34,719 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 03:14:34,720 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 03:14:34,720 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 03:14:34,720 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 03:14:34,720 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 03:14:34,720 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 03:14:34,721 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 03:14:34,721 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 03:14:34,721 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 03:14:34,721 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 03:14:34,721 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 03:14:34,721 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 03:14:34,721 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 03:14:34,721 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 03:14:34,721 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 03:14:34,722 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 03:14:34,722 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 03:14:34,722 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 03:14:34,722 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 03:14:34,722 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 03:14:34,722 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 03:14:34,722 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 03:14:34,722 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 03:14:34,722 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:14:34,722 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:14:34,722 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:14:34,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:14:34,723 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 03:14:34,723 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 03:14:34,723 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 03:14:34,723 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 03:14:34,723 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:14:34,723 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 03:14:34,723 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 03:14:34,723 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 03:14:34,723 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 03:14:34,724 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 03:14:34,724 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 03:14:34,724 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 03:14:34,724 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 03:14:34,724 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 03:14:34,724 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 03:14:34,724 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 698c604312f3eb09bef7f8f6e092d43de99877a411ec8f3c76598811466d02b7 [2025-01-09 03:14:34,903 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 03:14:34,910 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 03:14:34,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 03:14:34,912 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 03:14:34,912 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 03:14:34,913 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound50.i [2025-01-09 03:14:36,055 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/28408936f/d13084e74ab94c399b55927bd602534b/FLAG3d275e958 [2025-01-09 03:14:36,322 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 03:14:36,323 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/divbin2_valuebound50.i [2025-01-09 03:14:36,336 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/28408936f/d13084e74ab94c399b55927bd602534b/FLAG3d275e958 [2025-01-09 03:14:36,633 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/28408936f/d13084e74ab94c399b55927bd602534b [2025-01-09 03:14:36,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 03:14:36,636 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 03:14:36,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 03:14:36,638 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 03:14:36,641 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 03:14:36,642 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:14:36" (1/1) ... [2025-01-09 03:14:36,642 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9d75d5b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:36, skipping insertion in model container [2025-01-09 03:14:36,643 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 03:14:36" (1/1) ... [2025-01-09 03:14:36,651 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 03:14:36,736 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/nla-digbench-scaling/divbin2_valuebound50.i[951,964] [2025-01-09 03:14:36,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:14:36,753 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 03:14:36,761 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/nla-digbench-scaling/divbin2_valuebound50.i[951,964] [2025-01-09 03:14:36,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 03:14:36,778 INFO L204 MainTranslator]: Completed translation [2025-01-09 03:14:36,779 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:36 WrapperNode [2025-01-09 03:14:36,779 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 03:14:36,780 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 03:14:36,780 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 03:14:36,781 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 03:14:36,785 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:36" (1/1) ... [2025-01-09 03:14:36,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:36" (1/1) ... [2025-01-09 03:14:36,800 INFO L138 Inliner]: procedures = 16, calls = 9, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 40 [2025-01-09 03:14:36,801 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 03:14:36,801 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 03:14:36,802 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 03:14:36,802 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 03:14:36,808 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:36" (1/1) ... [2025-01-09 03:14:36,808 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:36" (1/1) ... [2025-01-09 03:14:36,808 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:36" (1/1) ... [2025-01-09 03:14:36,814 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2025-01-09 03:14:36,815 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:36" (1/1) ... [2025-01-09 03:14:36,815 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:36" (1/1) ... [2025-01-09 03:14:36,820 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:36" (1/1) ... [2025-01-09 03:14:36,820 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:36" (1/1) ... [2025-01-09 03:14:36,823 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:36" (1/1) ... [2025-01-09 03:14:36,824 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:36" (1/1) ... [2025-01-09 03:14:36,824 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:36" (1/1) ... [2025-01-09 03:14:36,825 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 03:14:36,826 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 03:14:36,826 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 03:14:36,826 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 03:14:36,827 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:36" (1/1) ... [2025-01-09 03:14:36,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 03:14:36,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:14:36,849 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) [2025-01-09 03:14:36,852 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 [2025-01-09 03:14:36,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 03:14:36,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 03:14:36,869 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 03:14:36,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 03:14:36,869 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2025-01-09 03:14:36,869 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2025-01-09 03:14:36,909 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 03:14:36,910 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 03:14:36,984 INFO L? ?]: Removed 7 outVars from TransFormulas that were not future-live. [2025-01-09 03:14:36,985 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 03:14:36,993 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 03:14:36,993 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-01-09 03:14:36,993 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:14:36 BoogieIcfgContainer [2025-01-09 03:14:36,993 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 03:14:36,995 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 03:14:36,995 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 03:14:36,998 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 03:14:36,998 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 03:14:36" (1/3) ... [2025-01-09 03:14:36,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0afd81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:14:36, skipping insertion in model container [2025-01-09 03:14:36,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 03:14:36" (2/3) ... [2025-01-09 03:14:36,999 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c0afd81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 03:14:36, skipping insertion in model container [2025-01-09 03:14:36,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 03:14:36" (3/3) ... [2025-01-09 03:14:37,000 INFO L128 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound50.i [2025-01-09 03:14:37,011 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 03:14:37,013 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG divbin2_valuebound50.i that has 2 procedures, 19 locations, 1 initial locations, 2 loop locations, and 1 error locations. [2025-01-09 03:14:37,054 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 03:14:37,062 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;@20385f35, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 03:14:37,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 03:14:37,065 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 03:14:37,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 03:14:37,070 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:14:37,070 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:14:37,071 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:14:37,073 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:14:37,074 INFO L85 PathProgramCache]: Analyzing trace with hash -586448253, now seen corresponding path program 1 times [2025-01-09 03:14:37,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:14:37,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1501760071] [2025-01-09 03:14:37,080 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:14:37,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:14:37,128 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 03:14:37,141 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 03:14:37,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:14:37,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:14:37,177 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:14:37,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:14:37,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1501760071] [2025-01-09 03:14:37,177 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1501760071] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:14:37,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:14:37,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 03:14:37,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802940125] [2025-01-09 03:14:37,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:14:37,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 03:14:37,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:14:37,195 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 03:14:37,195 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 03:14:37,196 INFO L87 Difference]: Start difference. First operand has 19 states, 15 states have (on average 1.4666666666666666) internal successors, (22), 15 states have internal predecessors, (22), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:14:37,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:14:37,206 INFO L93 Difference]: Finished difference Result 35 states and 50 transitions. [2025-01-09 03:14:37,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 03:14:37,208 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 03:14:37,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:14:37,212 INFO L225 Difference]: With dead ends: 35 [2025-01-09 03:14:37,212 INFO L226 Difference]: Without dead ends: 15 [2025-01-09 03:14:37,214 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 03:14:37,218 INFO L435 NwaCegarLoop]: 22 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 22 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:14:37,219 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:14:37,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-01-09 03:14:37,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-01-09 03:14:37,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 11 states have (on average 1.3636363636363635) internal successors, (15), 12 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 03:14:37,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 18 transitions. [2025-01-09 03:14:37,241 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 18 transitions. Word has length 9 [2025-01-09 03:14:37,242 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:14:37,242 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 18 transitions. [2025-01-09 03:14:37,242 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:14:37,242 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 18 transitions. [2025-01-09 03:14:37,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-01-09 03:14:37,243 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:14:37,243 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:14:37,243 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-01-09 03:14:37,243 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:14:37,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:14:37,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1184865025, now seen corresponding path program 1 times [2025-01-09 03:14:37,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:14:37,244 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642940527] [2025-01-09 03:14:37,244 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:14:37,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:14:37,251 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 03:14:37,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 03:14:37,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:14:37,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:14:37,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [133679821] [2025-01-09 03:14:37,270 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:14:37,271 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:14:37,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:14:37,273 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:14:37,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 03:14:37,311 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-01-09 03:14:37,321 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-01-09 03:14:37,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:14:37,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:14:37,322 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 12 conjuncts are in the unsatisfiable core [2025-01-09 03:14:37,326 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:14:37,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:14:37,504 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 03:14:37,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:14:37,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642940527] [2025-01-09 03:14:37,504 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:14:37,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133679821] [2025-01-09 03:14:37,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133679821] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:14:37,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:14:37,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2025-01-09 03:14:37,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564862631] [2025-01-09 03:14:37,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:14:37,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-01-09 03:14:37,505 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:14:37,506 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-01-09 03:14:37,506 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2025-01-09 03:14:37,506 INFO L87 Difference]: Start difference. First operand 15 states and 18 transitions. Second operand has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:14:37,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:14:37,587 INFO L93 Difference]: Finished difference Result 25 states and 30 transitions. [2025-01-09 03:14:37,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-01-09 03:14:37,588 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-01-09 03:14:37,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:14:37,588 INFO L225 Difference]: With dead ends: 25 [2025-01-09 03:14:37,588 INFO L226 Difference]: Without dead ends: 22 [2025-01-09 03:14:37,589 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2025-01-09 03:14:37,589 INFO L435 NwaCegarLoop]: 8 mSDtfsCounter, 11 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 03:14:37,589 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 42 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 03:14:37,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2025-01-09 03:14:37,599 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2025-01-09 03:14:37,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 16 states have (on average 1.3125) internal successors, (21), 17 states have internal predecessors, (21), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 03:14:37,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 26 transitions. [2025-01-09 03:14:37,600 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 26 transitions. Word has length 9 [2025-01-09 03:14:37,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:14:37,600 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 26 transitions. [2025-01-09 03:14:37,600 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.1428571428571428) internal successors, (8), 6 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-01-09 03:14:37,600 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 26 transitions. [2025-01-09 03:14:37,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-01-09 03:14:37,600 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:14:37,600 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:14:37,607 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 03:14:37,801 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:14:37,801 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:14:37,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:14:37,802 INFO L85 PathProgramCache]: Analyzing trace with hash 307606896, now seen corresponding path program 1 times [2025-01-09 03:14:37,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:14:37,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [227518630] [2025-01-09 03:14:37,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:14:37,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:14:37,812 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-01-09 03:14:37,838 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-01-09 03:14:37,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:14:37,838 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:14:37,981 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:14:37,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:14:37,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [227518630] [2025-01-09 03:14:37,982 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [227518630] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 03:14:37,982 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 03:14:37,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 03:14:37,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479621918] [2025-01-09 03:14:37,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 03:14:37,982 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 03:14:37,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:14:37,983 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 03:14:37,983 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:14:37,983 INFO L87 Difference]: Start difference. First operand 22 states and 26 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 03:14:37,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 03:14:37,995 INFO L93 Difference]: Finished difference Result 42 states and 51 transitions. [2025-01-09 03:14:37,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 03:14:37,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-01-09 03:14:37,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 03:14:37,996 INFO L225 Difference]: With dead ends: 42 [2025-01-09 03:14:37,996 INFO L226 Difference]: Without dead ends: 23 [2025-01-09 03:14:37,996 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 03:14:37,997 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 0 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 03:14:37,997 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 26 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 03:14:37,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2025-01-09 03:14:38,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2025-01-09 03:14:38,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.2941176470588236) internal successors, (22), 18 states have internal predecessors, (22), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 03:14:38,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2025-01-09 03:14:38,000 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 16 [2025-01-09 03:14:38,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 03:14:38,000 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2025-01-09 03:14:38,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-01-09 03:14:38,001 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2025-01-09 03:14:38,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-01-09 03:14:38,001 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 03:14:38,001 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 03:14:38,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 03:14:38,001 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 03:14:38,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 03:14:38,002 INFO L85 PathProgramCache]: Analyzing trace with hash 1115574231, now seen corresponding path program 1 times [2025-01-09 03:14:38,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 03:14:38,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12188506] [2025-01-09 03:14:38,002 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:14:38,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 03:14:38,007 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 03:14:38,025 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 03:14:38,025 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:14:38,025 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 03:14:38,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1836496499] [2025-01-09 03:14:38,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 03:14:38,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 03:14:38,026 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 03:14:38,028 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 03:14:38,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 03:14:38,053 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-01-09 03:14:38,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-01-09 03:14:38,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 03:14:38,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 03:14:38,084 WARN L254 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-01-09 03:14:38,089 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 03:14:38,411 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-01-09 03:14:38,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 03:15:07,413 WARN L286 SmtUtils]: Spent 16.05s on a formula simplification that was a NOOP. DAG size: 9 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 03:15:27,466 WARN L286 SmtUtils]: Spent 16.03s on a formula simplification that was a NOOP. DAG size: 11 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 03:15:43,564 WARN L286 SmtUtils]: Spent 16.08s on a formula simplification that was a NOOP. DAG size: 6 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2025-01-09 03:15:47,590 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (mod |c_ULTIMATE.start_main_~b~0#1| 2147483648))) (let ((.cse0 (mod |c_ULTIMATE.start_main_~A~0#1| 4294967296)) (.cse2 (* 2 .cse3)) (.cse1 (mod |c_ULTIMATE.start_main_~r~0#1| 4294967296))) (or (not (= (mod (+ (* 2 |c_ULTIMATE.start_main_~b~0#1| |c_ULTIMATE.start_main_~q~0#1|) |c_ULTIMATE.start_main_~r~0#1|) 4294967296) .cse0)) (< .cse1 (mod |c_ULTIMATE.start_main_~b~0#1| 4294967296)) (= .cse2 (mod |c_ULTIMATE.start_main_~B~0#1| 4294967296)) (= (mod (+ |c_ULTIMATE.start_main_~r~0#1| (* 2 .cse3 |c_ULTIMATE.start_main_~q~0#1|)) 4294967296) .cse0) (< .cse2 (+ .cse1 1))))) is different from true [2025-01-09 03:15:47,593 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2025-01-09 03:15:47,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 03:15:47,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12188506] [2025-01-09 03:15:47,593 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 03:15:47,593 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1836496499] [2025-01-09 03:15:47,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1836496499] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 03:15:47,593 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 03:15:47,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 20 [2025-01-09 03:15:47,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54370462] [2025-01-09 03:15:47,593 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 03:15:47,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-01-09 03:15:47,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 03:15:47,597 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-01-09 03:15:47,598 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=271, Unknown=2, NotChecked=34, Total=380 [2025-01-09 03:15:47,598 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 20 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-01-09 03:16:00,757 WARN L286 SmtUtils]: Spent 12.82s on a formula simplification that was a NOOP. DAG size: 26 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2025-01-09 03:16:04,835 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 03:16:08,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 03:16:12,875 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 03:16:16,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2025-01-09 03:16:21,843 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers []