./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-69.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-69.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 9946b8f2044511113ae8f74201f189348f6c8338b35f7642acfb4580613f868c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:04:36,101 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:04:36,165 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 18:04:36,170 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:04:36,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:04:36,196 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:04:36,196 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:04:36,197 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:04:36,197 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:04:36,199 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:04:36,199 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:04:36,199 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:04:36,200 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:04:36,200 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:04:36,200 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:04:36,200 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:04:36,201 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:04:36,201 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:04:36,201 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 18:04:36,204 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:04:36,205 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:04:36,205 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:04:36,205 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:04:36,205 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:04:36,205 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:04:36,206 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:04:36,206 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:04:36,206 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:04:36,206 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:04:36,206 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:04:36,206 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:04:36,206 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:04:36,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:04:36,207 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:04:36,207 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:04:36,207 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:04:36,207 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 18:04:36,207 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 18:04:36,208 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:04:36,208 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:04:36,208 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:04:36,209 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:04:36,210 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> 9946b8f2044511113ae8f74201f189348f6c8338b35f7642acfb4580613f868c [2024-11-16 18:04:36,432 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:04:36,457 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:04:36,463 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:04:36,464 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:04:36,464 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:04:36,466 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-69.i [2024-11-16 18:04:37,718 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:04:37,872 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:04:37,873 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-69.i [2024-11-16 18:04:37,879 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b8950aa4/b112645e04b64958bd2a236a3c7b44b7/FLAG1664a82df [2024-11-16 18:04:37,890 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b8950aa4/b112645e04b64958bd2a236a3c7b44b7 [2024-11-16 18:04:37,892 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:04:37,893 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:04:37,894 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:04:37,895 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:04:37,902 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:04:37,903 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:04:37" (1/1) ... [2024-11-16 18:04:37,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7560aed4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:37, skipping insertion in model container [2024-11-16 18:04:37,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:04:37" (1/1) ... [2024-11-16 18:04:37,925 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:04:38,066 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-69.i[913,926] [2024-11-16 18:04:38,102 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:04:38,110 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:04:38,119 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-69.i[913,926] [2024-11-16 18:04:38,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:04:38,146 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:04:38,147 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:38 WrapperNode [2024-11-16 18:04:38,147 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:04:38,148 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:04:38,148 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:04:38,148 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:04:38,153 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:38" (1/1) ... [2024-11-16 18:04:38,160 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:38" (1/1) ... [2024-11-16 18:04:38,180 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 106 [2024-11-16 18:04:38,180 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:04:38,181 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:04:38,181 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:04:38,181 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:04:38,190 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:38" (1/1) ... [2024-11-16 18:04:38,190 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:38" (1/1) ... [2024-11-16 18:04:38,191 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:38" (1/1) ... [2024-11-16 18:04:38,204 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 18:04:38,204 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:38" (1/1) ... [2024-11-16 18:04:38,204 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:38" (1/1) ... [2024-11-16 18:04:38,211 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:38" (1/1) ... [2024-11-16 18:04:38,212 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:38" (1/1) ... [2024-11-16 18:04:38,213 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:38" (1/1) ... [2024-11-16 18:04:38,213 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:38" (1/1) ... [2024-11-16 18:04:38,215 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:04:38,216 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:04:38,216 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:04:38,216 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:04:38,217 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:38" (1/1) ... [2024-11-16 18:04:38,222 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:04:38,237 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:04:38,253 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 18:04:38,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 18:04:38,295 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:04:38,296 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:04:38,296 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:04:38,296 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 18:04:38,296 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:04:38,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:04:38,353 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:04:38,355 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:04:38,553 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-16 18:04:38,554 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:04:38,566 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:04:38,566 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:04:38,584 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:04:38 BoogieIcfgContainer [2024-11-16 18:04:38,585 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:04:38,587 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:04:38,587 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:04:38,590 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:04:38,590 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:04:37" (1/3) ... [2024-11-16 18:04:38,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2737db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:04:38, skipping insertion in model container [2024-11-16 18:04:38,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:38" (2/3) ... [2024-11-16 18:04:38,591 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1b2737db and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:04:38, skipping insertion in model container [2024-11-16 18:04:38,591 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:04:38" (3/3) ... [2024-11-16 18:04:38,592 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-69.i [2024-11-16 18:04:38,624 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:04:38,624 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:04:38,674 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:04:38,680 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;@7f69ab4f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:04:38,681 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:04:38,684 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:04:38,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-16 18:04:38,692 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:04:38,692 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:04:38,693 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:04:38,697 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:04:38,697 INFO L85 PathProgramCache]: Analyzing trace with hash -990192702, now seen corresponding path program 1 times [2024-11-16 18:04:38,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:04:38,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986485022] [2024-11-16 18:04:38,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:04:38,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:04:38,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:04:38,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 18:04:38,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:04:38,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 18:04:38,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:04:38,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 18:04:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:04:38,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 18:04:38,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:04:38,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 18:04:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:04:38,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 18:04:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:04:38,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 18:04:38,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:04:38,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 18:04:38,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:04:38,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 18:04:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:04:38,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 18:04:38,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:04:38,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 18:04:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:04:38,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 18:04:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:04:38,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 18:04:38,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:04:38,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-16 18:04:38,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:04:38,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 18:04:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:04:38,960 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-16 18:04:38,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 18:04:38,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986485022] [2024-11-16 18:04:38,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986485022] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:04:38,962 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:04:38,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:04:38,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809164491] [2024-11-16 18:04:38,964 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:04:38,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:04:38,968 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 18:04:38,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:04:38,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:04:38,999 INFO L87 Difference]: Start difference. First operand has 55 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:04:39,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:04:39,028 INFO L93 Difference]: Finished difference Result 102 states and 168 transitions. [2024-11-16 18:04:39,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:04:39,030 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 99 [2024-11-16 18:04:39,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:04:39,044 INFO L225 Difference]: With dead ends: 102 [2024-11-16 18:04:39,055 INFO L226 Difference]: Without dead ends: 50 [2024-11-16 18:04:39,058 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:04:39,063 INFO L432 NwaCegarLoop]: 72 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, 72 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 [2024-11-16 18:04:39,063 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:04:39,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-16 18:04:39,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-16 18:04:39,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:04:39,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2024-11-16 18:04:39,107 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 99 [2024-11-16 18:04:39,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:04:39,108 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2024-11-16 18:04:39,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:04:39,109 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2024-11-16 18:04:39,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-16 18:04:39,111 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:04:39,112 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:04:39,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 18:04:39,113 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:04:39,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:04:39,114 INFO L85 PathProgramCache]: Analyzing trace with hash -1074144063, now seen corresponding path program 1 times [2024-11-16 18:04:39,114 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 18:04:39,114 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995845443] [2024-11-16 18:04:39,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:04:39,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 18:04:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 18:04:39,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1436888993] [2024-11-16 18:04:39,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:04:39,242 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:04:39,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:04:39,244 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 18:04:39,246 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 18:04:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:04:39,404 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 18:04:39,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 18:04:39,488 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 18:04:39,488 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 18:04:39,489 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 18:04:39,499 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 18:04:39,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 18:04:39,702 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-16 18:04:39,764 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 18:04:39,767 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 06:04:39 BoogieIcfgContainer [2024-11-16 18:04:39,767 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 18:04:39,767 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 18:04:39,768 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 18:04:39,768 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 18:04:39,768 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:04:38" (3/4) ... [2024-11-16 18:04:39,770 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 18:04:39,771 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 18:04:39,774 INFO L158 Benchmark]: Toolchain (without parser) took 1878.52ms. Allocated memory was 163.6MB in the beginning and 218.1MB in the end (delta: 54.5MB). Free memory was 89.9MB in the beginning and 154.8MB in the end (delta: -64.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:04:39,775 INFO L158 Benchmark]: CDTParser took 0.78ms. Allocated memory is still 163.6MB. Free memory is still 112.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:04:39,775 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.08ms. Allocated memory is still 163.6MB. Free memory was 89.9MB in the beginning and 75.7MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-16 18:04:39,775 INFO L158 Benchmark]: Boogie Procedure Inliner took 32.55ms. Allocated memory is still 163.6MB. Free memory was 75.7MB in the beginning and 73.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 18:04:39,776 INFO L158 Benchmark]: Boogie Preprocessor took 34.31ms. Allocated memory is still 163.6MB. Free memory was 73.6MB in the beginning and 71.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-16 18:04:39,776 INFO L158 Benchmark]: IcfgBuilder took 369.51ms. Allocated memory is still 163.6MB. Free memory was 71.5MB in the beginning and 131.6MB in the end (delta: -60.0MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. [2024-11-16 18:04:39,779 INFO L158 Benchmark]: TraceAbstraction took 1179.88ms. Allocated memory was 163.6MB in the beginning and 218.1MB in the end (delta: 54.5MB). Free memory was 130.9MB in the beginning and 154.8MB in the end (delta: -23.9MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. [2024-11-16 18:04:39,779 INFO L158 Benchmark]: Witness Printer took 3.79ms. Allocated memory is still 218.1MB. Free memory is still 154.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 18:04:39,780 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.78ms. Allocated memory is still 163.6MB. Free memory is still 112.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.08ms. Allocated memory is still 163.6MB. Free memory was 89.9MB in the beginning and 75.7MB in the end (delta: 14.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 32.55ms. Allocated memory is still 163.6MB. Free memory was 75.7MB in the beginning and 73.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 34.31ms. Allocated memory is still 163.6MB. Free memory was 73.6MB in the beginning and 71.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * IcfgBuilder took 369.51ms. Allocated memory is still 163.6MB. Free memory was 71.5MB in the beginning and 131.6MB in the end (delta: -60.0MB). Peak memory consumption was 22.5MB. Max. memory is 16.1GB. * TraceAbstraction took 1179.88ms. Allocated memory was 163.6MB in the beginning and 218.1MB in the end (delta: 54.5MB). Free memory was 130.9MB in the beginning and 154.8MB in the end (delta: -23.9MB). Peak memory consumption was 27.2MB. Max. memory is 16.1GB. * Witness Printer took 3.79ms. Allocated memory is still 218.1MB. Free memory is still 154.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: 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 someBinaryDOUBLEComparisonOperation at line 102. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -100; [L23] unsigned long int var_1_2 = 0; [L24] unsigned long int var_1_3 = 8; [L25] unsigned long int var_1_4 = 256; [L26] unsigned long int var_1_5 = 500; [L27] signed char var_1_7 = -64; [L28] signed char var_1_8 = -8; [L29] unsigned char var_1_9 = 0; [L30] unsigned char var_1_10 = 0; [L31] double var_1_11 = 4.625; [L32] double var_1_13 = 15.5; VAL [isInitial=0, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_2=0, var_1_3=8, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L106] isInitial = 1 [L107] FCALL initially() [L108] COND TRUE 1 [L109] FCALL updateLastVariables() [L110] CALL updateVariables() [L75] var_1_2 = __VERIFIER_nondet_ulong() [L76] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_3=8, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_3=8, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L76] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_3=8, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_2 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_3=8, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_3=8, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L77] RET assume_abort_if_not(var_1_2 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_3=8, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L78] var_1_3 = __VERIFIER_nondet_ulong() [L79] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L79] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L80] CALL assume_abort_if_not(var_1_3 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L80] RET assume_abort_if_not(var_1_3 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_4=256, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L81] var_1_4 = __VERIFIER_nondet_ulong() [L82] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L82] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L83] CALL assume_abort_if_not(var_1_4 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L83] RET assume_abort_if_not(var_1_4 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_5=500, var_1_7=-64, var_1_8=-8, var_1_9=0] [L84] var_1_5 = __VERIFIER_nondet_ulong() [L85] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=-8, var_1_9=0] [L85] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=-8, var_1_9=0] [L86] CALL assume_abort_if_not(var_1_5 <= 4294967295) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=-8, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=-8, var_1_9=0] [L86] RET assume_abort_if_not(var_1_5 <= 4294967295) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=-8, var_1_9=0] [L87] var_1_8 = __VERIFIER_nondet_char() [L88] CALL assume_abort_if_not(var_1_8 >= -127) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L88] RET assume_abort_if_not(var_1_8 >= -127) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L89] CALL assume_abort_if_not(var_1_8 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L89] RET assume_abort_if_not(var_1_8 <= 126) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L90] var_1_9 = __VERIFIER_nondet_uchar() [L91] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0] [L91] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0] [L92] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L92] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L93] var_1_10 = __VERIFIER_nondet_uchar() [L94] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L94] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L95] CALL assume_abort_if_not(var_1_10 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L95] RET assume_abort_if_not(var_1_10 <= 1) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_13=31/2, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L96] var_1_13 = __VERIFIER_nondet_double() [L97] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L97] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_7=-64, var_1_8=0, var_1_9=0] [L110] RET updateVariables() [L111] CALL step() [L36] COND TRUE var_1_2 < (((((var_1_4 * var_1_5)) > (var_1_3)) ? ((var_1_4 * var_1_5)) : (var_1_3))) [L37] var_1_7 = var_1_8 VAL [isInitial=1, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_2=0, var_1_3=-4294967295, var_1_4=0, var_1_5=4294967296, var_1_7=0, var_1_8=0, var_1_9=0] [L49] unsigned long int stepLocal_1 = var_1_5; [L50] unsigned long int stepLocal_0 = var_1_2 * ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4))); VAL [isInitial=1, stepLocal_0=0, stepLocal_1=4294967296, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_2=0, var_1_3=-4294967295, var_1_4=0, var_1_5=4294967296, var_1_7=0, var_1_8=0, var_1_9=0] [L51] COND FALSE !(stepLocal_0 < var_1_5) VAL [isInitial=1, stepLocal_1=4294967296, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_2=0, var_1_3=-4294967295, var_1_4=0, var_1_5=4294967296, var_1_7=0, var_1_8=0, var_1_9=0] [L58] unsigned char stepLocal_3 = var_1_9; [L59] signed long int stepLocal_2 = var_1_1 + var_1_7; VAL [isInitial=1, stepLocal_1=4294967296, stepLocal_2=-100, stepLocal_3=0, var_1_10=0, var_1_11=37/8, var_1_1=-100, var_1_2=0, var_1_3=-4294967295, var_1_4=0, var_1_5=4294967296, var_1_7=0, var_1_8=0, var_1_9=0] [L60] COND FALSE !(((var_1_7 + var_1_8) == var_1_4) && stepLocal_3) [L71] var_1_11 = var_1_13 VAL [isInitial=1, stepLocal_1=4294967296, stepLocal_2=-100, var_1_10=0, var_1_11=2, var_1_13=2, var_1_1=-100, var_1_2=0, var_1_3=-4294967295, var_1_4=0, var_1_5=4294967296, var_1_7=0, var_1_8=0, var_1_9=0] [L111] RET step() [L112] CALL, EXPR property() [L102-L103] return ((((var_1_2 * ((((var_1_3) < (var_1_4)) ? (var_1_3) : (var_1_4)))) < var_1_5) ? ((var_1_5 > var_1_2) ? (var_1_1 == ((signed short int) var_1_7)) : (var_1_1 == ((signed short int) var_1_7))) : 1) && ((var_1_2 < (((((var_1_4 * var_1_5)) > (var_1_3)) ? ((var_1_4 * var_1_5)) : (var_1_3)))) ? (var_1_7 == ((signed char) var_1_8)) : ((var_1_9 || var_1_10) ? (var_1_7 == ((signed char) var_1_8)) : ((var_1_3 < var_1_4) ? (var_1_7 == ((signed char) var_1_8)) : (var_1_7 == ((signed char) -4)))))) && ((((var_1_7 + var_1_8) == var_1_4) && var_1_9) ? ((! var_1_10) ? (((var_1_1 + var_1_7) != var_1_8) ? (var_1_11 == ((double) var_1_13)) : (var_1_11 == ((double) var_1_13))) : (var_1_11 == ((double) var_1_13))) : (var_1_11 == ((double) var_1_13))) ; VAL [\result=0, isInitial=1, var_1_10=0, var_1_11=2, var_1_13=2, var_1_1=-100, var_1_2=0, var_1_3=-4294967295, var_1_4=0, var_1_5=4294967296, var_1_7=0, var_1_8=0, var_1_9=0] [L112] RET, EXPR property() [L112] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=0, var_1_11=2, var_1_13=2, var_1_1=-100, var_1_2=0, var_1_3=-4294967295, var_1_4=0, var_1_5=4294967296, var_1_7=0, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, var_1_10=0, var_1_11=2, var_1_13=2, var_1_1=-100, var_1_2=0, var_1_3=-4294967295, var_1_4=0, var_1_5=4294967296, var_1_7=0, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 55 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.0s, OverallIterations: 2, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 72 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 72 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=55occurred in iteration=0, InterpolantAutomatonStates: 2, 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, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.2s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 98 ConstructedInterpolants, 0 QuantifiedInterpolants, 98 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 420/420 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-16 18:04:39,811 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-69.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/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 9946b8f2044511113ae8f74201f189348f6c8338b35f7642acfb4580613f868c --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 18:04:41,669 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 18:04:41,733 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 18:04:41,741 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 18:04:41,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 18:04:41,769 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 18:04:41,769 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 18:04:41,769 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 18:04:41,770 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 18:04:41,770 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 18:04:41,771 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 18:04:41,771 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 18:04:41,771 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 18:04:41,772 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 18:04:41,772 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 18:04:41,773 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 18:04:41,773 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 18:04:41,773 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 18:04:41,773 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 18:04:41,774 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 18:04:41,774 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 18:04:41,775 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 18:04:41,775 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 18:04:41,775 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 18:04:41,775 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 18:04:41,776 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 18:04:41,776 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 18:04:41,776 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 18:04:41,776 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 18:04:41,777 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 18:04:41,777 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 18:04:41,777 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 18:04:41,777 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 18:04:41,777 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 18:04:41,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:04:41,778 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 18:04:41,778 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 18:04:41,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 18:04:41,778 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 18:04:41,779 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 18:04:41,779 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 18:04:41,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 18:04:41,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 18:04:41,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 18:04:41,780 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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/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 -> 9946b8f2044511113ae8f74201f189348f6c8338b35f7642acfb4580613f868c [2024-11-16 18:04:42,048 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 18:04:42,070 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 18:04:42,074 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 18:04:42,081 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 18:04:42,081 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 18:04:42,082 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-69.i [2024-11-16 18:04:43,396 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 18:04:43,580 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 18:04:43,580 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-69.i [2024-11-16 18:04:43,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/379e8b1db/17cdaff4b25c4222b6dddac757a78d73/FLAG154e1c044 [2024-11-16 18:04:43,976 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/379e8b1db/17cdaff4b25c4222b6dddac757a78d73 [2024-11-16 18:04:43,980 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 18:04:43,983 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 18:04:43,984 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 18:04:43,984 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 18:04:43,988 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 18:04:43,988 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:04:43" (1/1) ... [2024-11-16 18:04:43,989 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22f6c6e3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:43, skipping insertion in model container [2024-11-16 18:04:43,989 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:04:43" (1/1) ... [2024-11-16 18:04:44,009 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 18:04:44,160 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-69.i[913,926] [2024-11-16 18:04:44,197 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:04:44,217 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 18:04:44,228 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-69.i[913,926] [2024-11-16 18:04:44,248 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 18:04:44,269 INFO L204 MainTranslator]: Completed translation [2024-11-16 18:04:44,269 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:44 WrapperNode [2024-11-16 18:04:44,270 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 18:04:44,271 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 18:04:44,271 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 18:04:44,271 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 18:04:44,276 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:44" (1/1) ... [2024-11-16 18:04:44,287 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:44" (1/1) ... [2024-11-16 18:04:44,322 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 105 [2024-11-16 18:04:44,322 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 18:04:44,326 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 18:04:44,326 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 18:04:44,326 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 18:04:44,334 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:44" (1/1) ... [2024-11-16 18:04:44,335 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:44" (1/1) ... [2024-11-16 18:04:44,337 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:44" (1/1) ... [2024-11-16 18:04:44,351 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 18:04:44,351 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:44" (1/1) ... [2024-11-16 18:04:44,352 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:44" (1/1) ... [2024-11-16 18:04:44,357 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:44" (1/1) ... [2024-11-16 18:04:44,361 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:44" (1/1) ... [2024-11-16 18:04:44,363 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:44" (1/1) ... [2024-11-16 18:04:44,365 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:44" (1/1) ... [2024-11-16 18:04:44,368 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 18:04:44,370 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 18:04:44,371 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 18:04:44,371 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 18:04:44,372 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:44" (1/1) ... [2024-11-16 18:04:44,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 18:04:44,386 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 18:04:44,402 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 18:04:44,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 18:04:44,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 18:04:44,443 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 18:04:44,443 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 18:04:44,443 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 18:04:44,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 18:04:44,443 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 18:04:44,509 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 18:04:44,511 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 18:04:44,790 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-16 18:04:44,790 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 18:04:44,803 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 18:04:44,803 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 18:04:44,803 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:04:44 BoogieIcfgContainer [2024-11-16 18:04:44,803 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 18:04:44,806 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 18:04:44,806 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 18:04:44,809 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 18:04:44,810 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:04:43" (1/3) ... [2024-11-16 18:04:44,810 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281745fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:04:44, skipping insertion in model container [2024-11-16 18:04:44,811 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:04:44" (2/3) ... [2024-11-16 18:04:44,812 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@281745fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:04:44, skipping insertion in model container [2024-11-16 18:04:44,812 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:04:44" (3/3) ... [2024-11-16 18:04:44,813 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-69.i [2024-11-16 18:04:44,826 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 18:04:44,826 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 18:04:44,897 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 18:04:44,902 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;@6febe82d, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 18:04:44,903 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 18:04:44,906 INFO L276 IsEmpty]: Start isEmpty. Operand has 55 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:04:44,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-16 18:04:44,916 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:04:44,917 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:04:44,918 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:04:44,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:04:44,924 INFO L85 PathProgramCache]: Analyzing trace with hash -990192702, now seen corresponding path program 1 times [2024-11-16 18:04:44,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:04:44,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1195273004] [2024-11-16 18:04:44,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:04:44,934 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-16 18:04:44,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:04:44,949 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/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-16 18:04:44,950 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-16 18:04:45,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:04:45,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-16 18:04:45,096 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:04:45,129 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 80 proven. 0 refuted. 0 times theorem prover too weak. 340 trivial. 0 not checked. [2024-11-16 18:04:45,129 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:04:45,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:04:45,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1195273004] [2024-11-16 18:04:45,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1195273004] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:04:45,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:04:45,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 18:04:45,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368100672] [2024-11-16 18:04:45,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:04:45,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 18:04:45,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:04:45,150 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 18:04:45,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:04:45,152 INFO L87 Difference]: Start difference. First operand has 55 states, 37 states have (on average 1.3513513513513513) internal successors, (50), 38 states have internal predecessors, (50), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:04:45,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:04:45,171 INFO L93 Difference]: Finished difference Result 102 states and 168 transitions. [2024-11-16 18:04:45,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 18:04:45,173 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 99 [2024-11-16 18:04:45,173 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:04:45,178 INFO L225 Difference]: With dead ends: 102 [2024-11-16 18:04:45,178 INFO L226 Difference]: Without dead ends: 50 [2024-11-16 18:04:45,181 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 18:04:45,184 INFO L432 NwaCegarLoop]: 72 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, 72 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 [2024-11-16 18:04:45,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 18:04:45,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-16 18:04:45,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-16 18:04:45,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.2727272727272727) internal successors, (42), 33 states have internal predecessors, (42), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:04:45,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 72 transitions. [2024-11-16 18:04:45,213 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 72 transitions. Word has length 99 [2024-11-16 18:04:45,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:04:45,213 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 72 transitions. [2024-11-16 18:04:45,213 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2024-11-16 18:04:45,213 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 72 transitions. [2024-11-16 18:04:45,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2024-11-16 18:04:45,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:04:45,216 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:04:45,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-16 18:04:45,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/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-16 18:04:45,417 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:04:45,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:04:45,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1074144063, now seen corresponding path program 1 times [2024-11-16 18:04:45,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:04:45,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445025659] [2024-11-16 18:04:45,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:04:45,419 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-16 18:04:45,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:04:45,421 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/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-16 18:04:45,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-16 18:04:45,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:04:45,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-16 18:04:45,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:05:02,150 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-16 18:05:02,151 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:05:02,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:05:02,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445025659] [2024-11-16 18:05:02,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445025659] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:05:02,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:05:02,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 18:05:02,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185863759] [2024-11-16 18:05:02,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:05:02,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 18:05:02,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:05:02,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 18:05:02,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:05:02,154 INFO L87 Difference]: Start difference. First operand 50 states and 72 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:05:07,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:05:07,859 INFO L93 Difference]: Finished difference Result 87 states and 116 transitions. [2024-11-16 18:05:07,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 18:05:07,866 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 99 [2024-11-16 18:05:07,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:05:07,867 INFO L225 Difference]: With dead ends: 87 [2024-11-16 18:05:07,868 INFO L226 Difference]: Without dead ends: 84 [2024-11-16 18:05:07,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=112, Invalid=350, Unknown=0, NotChecked=0, Total=462 [2024-11-16 18:05:07,869 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 144 mSDsluCounter, 174 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-11-16 18:05:07,869 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 218 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-11-16 18:05:07,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-16 18:05:07,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 63. [2024-11-16 18:05:07,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 45 states have (on average 1.288888888888889) internal successors, (58), 45 states have internal predecessors, (58), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:05:07,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 88 transitions. [2024-11-16 18:05:07,879 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 88 transitions. Word has length 99 [2024-11-16 18:05:07,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:05:07,880 INFO L471 AbstractCegarLoop]: Abstraction has 63 states and 88 transitions. [2024-11-16 18:05:07,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 11 states have internal predecessors, (30), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:05:07,880 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 88 transitions. [2024-11-16 18:05:07,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-16 18:05:07,881 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:05:07,881 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:05:07,888 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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-16 18:05:08,082 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/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-16 18:05:08,083 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:05:08,083 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:05:08,083 INFO L85 PathProgramCache]: Analyzing trace with hash -2058336639, now seen corresponding path program 1 times [2024-11-16 18:05:08,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:05:08,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [315256235] [2024-11-16 18:05:08,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:05:08,084 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-16 18:05:08,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:05:08,085 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/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-16 18:05:08,086 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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-16 18:05:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:08,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 161 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-16 18:05:08,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:05:19,808 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-16 18:05:19,809 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:05:19,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:05:19,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [315256235] [2024-11-16 18:05:19,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [315256235] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:05:19,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:05:19,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-16 18:05:19,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011204723] [2024-11-16 18:05:19,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:05:19,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-16 18:05:19,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:05:19,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-16 18:05:19,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2024-11-16 18:05:19,811 INFO L87 Difference]: Start difference. First operand 63 states and 88 transitions. Second operand has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:05:22,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:05:22,785 INFO L93 Difference]: Finished difference Result 84 states and 113 transitions. [2024-11-16 18:05:22,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-16 18:05:22,787 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100 [2024-11-16 18:05:22,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:05:22,790 INFO L225 Difference]: With dead ends: 84 [2024-11-16 18:05:22,790 INFO L226 Difference]: Without dead ends: 81 [2024-11-16 18:05:22,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=100, Invalid=280, Unknown=0, NotChecked=0, Total=380 [2024-11-16 18:05:22,791 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 126 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 379 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-16 18:05:22,792 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 251 Invalid, 379 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-16 18:05:22,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-16 18:05:22,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 64. [2024-11-16 18:05:22,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:05:22,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2024-11-16 18:05:22,806 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 100 [2024-11-16 18:05:22,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:05:22,808 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2024-11-16 18:05:22,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.8181818181818183) internal successors, (31), 10 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:05:22,809 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2024-11-16 18:05:22,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2024-11-16 18:05:22,810 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:05:22,810 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:05:22,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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)] Forceful destruction successful, exit code 0 [2024-11-16 18:05:23,010 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/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-16 18:05:23,011 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:05:23,011 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:05:23,011 INFO L85 PathProgramCache]: Analyzing trace with hash -1232663773, now seen corresponding path program 1 times [2024-11-16 18:05:23,011 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:05:23,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1522281941] [2024-11-16 18:05:23,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:05:23,012 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-16 18:05:23,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:05:23,016 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/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-16 18:05:23,017 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 18:05:23,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:23,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-16 18:05:23,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:05:31,891 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-16 18:05:31,891 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:05:31,892 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:05:31,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1522281941] [2024-11-16 18:05:31,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1522281941] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:05:31,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:05:31,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-16 18:05:31,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598394181] [2024-11-16 18:05:31,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:05:31,892 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-16 18:05:31,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:05:31,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-16 18:05:31,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2024-11-16 18:05:31,893 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:05:40,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:05:40,707 INFO L93 Difference]: Finished difference Result 101 states and 135 transitions. [2024-11-16 18:05:40,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-16 18:05:40,714 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 100 [2024-11-16 18:05:40,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:05:40,715 INFO L225 Difference]: With dead ends: 101 [2024-11-16 18:05:40,715 INFO L226 Difference]: Without dead ends: 98 [2024-11-16 18:05:40,716 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2024-11-16 18:05:40,716 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 123 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 443 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 443 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-16 18:05:40,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 275 Invalid, 485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 443 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-16 18:05:40,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-16 18:05:40,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 66. [2024-11-16 18:05:40,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 48 states have (on average 1.3125) internal successors, (63), 48 states have internal predecessors, (63), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:05:40,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 93 transitions. [2024-11-16 18:05:40,725 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 93 transitions. Word has length 100 [2024-11-16 18:05:40,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:05:40,726 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 93 transitions. [2024-11-16 18:05:40,726 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 12 states have internal predecessors, (31), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:05:40,726 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 93 transitions. [2024-11-16 18:05:40,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-16 18:05:40,727 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:05:40,728 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:05:40,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-16 18:05:40,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/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-16 18:05:40,932 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:05:40,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:05:40,932 INFO L85 PathProgramCache]: Analyzing trace with hash 1617486943, now seen corresponding path program 1 times [2024-11-16 18:05:40,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:05:40,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [830807536] [2024-11-16 18:05:40,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:05:40,933 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-16 18:05:40,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:05:40,934 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/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-16 18:05:40,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (6)] Waiting until timeout for monitored process [2024-11-16 18:05:41,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:41,003 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-16 18:05:41,005 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:05:46,524 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-16 18:05:46,524 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:05:46,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:05:46,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [830807536] [2024-11-16 18:05:46,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [830807536] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:05:46,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:05:46,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-16 18:05:46,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [325710639] [2024-11-16 18:05:46,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:05:46,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-16 18:05:46,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:05:46,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-16 18:05:46,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-11-16 18:05:46,526 INFO L87 Difference]: Start difference. First operand 66 states and 93 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:05:51,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:05:51,113 INFO L93 Difference]: Finished difference Result 98 states and 132 transitions. [2024-11-16 18:05:51,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-16 18:05:51,116 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-16 18:05:51,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:05:51,117 INFO L225 Difference]: With dead ends: 98 [2024-11-16 18:05:51,117 INFO L226 Difference]: Without dead ends: 95 [2024-11-16 18:05:51,118 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=122, Invalid=340, Unknown=0, NotChecked=0, Total=462 [2024-11-16 18:05:51,119 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 116 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 454 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2024-11-16 18:05:51,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [117 Valid, 283 Invalid, 454 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 411 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2024-11-16 18:05:51,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-16 18:05:51,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 64. [2024-11-16 18:05:51,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 46 states have (on average 1.3043478260869565) internal successors, (60), 46 states have internal predecessors, (60), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:05:51,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 90 transitions. [2024-11-16 18:05:51,125 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 90 transitions. Word has length 101 [2024-11-16 18:05:51,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:05:51,126 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 90 transitions. [2024-11-16 18:05:51,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 11 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:05:51,126 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 90 transitions. [2024-11-16 18:05:51,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-16 18:05:51,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:05:51,127 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:05:51,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/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 (6)] Forceful destruction successful, exit code 0 [2024-11-16 18:05:51,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/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-16 18:05:51,328 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:05:51,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:05:51,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1545581726, now seen corresponding path program 1 times [2024-11-16 18:05:51,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:05:51,329 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2059038834] [2024-11-16 18:05:51,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:05:51,329 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-16 18:05:51,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:05:51,330 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/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-16 18:05:51,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (7)] Waiting until timeout for monitored process [2024-11-16 18:05:51,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:05:51,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-16 18:05:51,417 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:05:56,987 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-16 18:05:56,987 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:05:56,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:05:56,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2059038834] [2024-11-16 18:05:56,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2059038834] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:05:56,987 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:05:56,987 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-16 18:05:56,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1460612986] [2024-11-16 18:05:56,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:05:56,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 18:05:56,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:05:56,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 18:05:56,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:05:56,989 INFO L87 Difference]: Start difference. First operand 64 states and 90 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:06:03,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 18:06:03,661 INFO L93 Difference]: Finished difference Result 173 states and 239 transitions. [2024-11-16 18:06:03,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-16 18:06:03,665 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) Word has length 101 [2024-11-16 18:06:03,665 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 18:06:03,666 INFO L225 Difference]: With dead ends: 173 [2024-11-16 18:06:03,666 INFO L226 Difference]: Without dead ends: 112 [2024-11-16 18:06:03,668 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=165, Invalid=485, Unknown=0, NotChecked=0, Total=650 [2024-11-16 18:06:03,669 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 137 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 424 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 424 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2024-11-16 18:06:03,669 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 333 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 424 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2024-11-16 18:06:03,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-16 18:06:03,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 69. [2024-11-16 18:06:03,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 51 states have (on average 1.2941176470588236) internal successors, (66), 51 states have internal predecessors, (66), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-11-16 18:06:03,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 96 transitions. [2024-11-16 18:06:03,680 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 96 transitions. Word has length 101 [2024-11-16 18:06:03,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 18:06:03,680 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 96 transitions. [2024-11-16 18:06:03,680 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15) [2024-11-16 18:06:03,680 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 96 transitions. [2024-11-16 18:06:03,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2024-11-16 18:06:03,681 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 18:06:03,681 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-16 18:06:03,692 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/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 (7)] Ended with exit code 0 [2024-11-16 18:06:03,881 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/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-16 18:06:03,882 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 18:06:03,882 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 18:06:03,882 INFO L85 PathProgramCache]: Analyzing trace with hash 1349068221, now seen corresponding path program 1 times [2024-11-16 18:06:03,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 18:06:03,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [272057019] [2024-11-16 18:06:03,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 18:06:03,883 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-16 18:06:03,883 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 18:06:03,884 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/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-16 18:06:03,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/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 (8)] Waiting until timeout for monitored process [2024-11-16 18:06:03,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 18:06:03,968 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-16 18:06:03,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 18:06:09,692 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 42 proven. 0 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2024-11-16 18:06:09,693 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 18:06:09,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 18:06:09,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [272057019] [2024-11-16 18:06:09,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [272057019] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 18:06:09,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 18:06:09,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-16 18:06:09,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675694076] [2024-11-16 18:06:09,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 18:06:09,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-16 18:06:09,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 18:06:09,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-16 18:06:09,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-16 18:06:09,694 INFO L87 Difference]: Start difference. First operand 69 states and 96 transitions. Second operand has 14 states, 14 states have (on average 2.2857142857142856) internal successors, (32), 13 states have internal predecessors, (32), 1 states have call successors, (15), 1 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 1 states have call successors, (15)