./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-95.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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_wrapper-s_file-95.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 4cc757866639008b8de2bb637453380004a1f2541632c98c93ed486e64a84677 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 13:12:53,127 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 13:12:53,173 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 13:12:53,176 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 13:12:53,176 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 13:12:53,215 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 13:12:53,216 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 13:12:53,217 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 13:12:53,217 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 13:12:53,218 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 13:12:53,219 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 13:12:53,219 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 13:12:53,219 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 13:12:53,220 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 13:12:53,221 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 13:12:53,221 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 13:12:53,221 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 13:12:53,222 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 13:12:53,222 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 13:12:53,222 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 13:12:53,222 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 13:12:53,225 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 13:12:53,225 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 13:12:53,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 13:12:53,233 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 13:12:53,233 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 13:12:53,233 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 13:12:53,233 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 13:12:53,234 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 13:12:53,234 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 13:12:53,234 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 13:12:53,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 13:12:53,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:12:53,234 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 13:12:53,234 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 13:12:53,235 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 13:12:53,235 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 13:12:53,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 13:12:53,235 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 13:12:53,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 13:12:53,235 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 13:12:53,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 13:12:53,237 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 -> 4cc757866639008b8de2bb637453380004a1f2541632c98c93ed486e64a84677 [2024-11-22 13:12:53,427 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 13:12:53,449 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 13:12:53,451 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 13:12:53,452 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 13:12:53,456 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 13:12:53,457 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-95.i [2024-11-22 13:12:54,758 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 13:12:54,966 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 13:12:54,967 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-95.i [2024-11-22 13:12:54,974 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93c5e59a7/439e8277dd5a4030a37972fd4efa2ec6/FLAG3a1235819 [2024-11-22 13:12:54,985 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/93c5e59a7/439e8277dd5a4030a37972fd4efa2ec6 [2024-11-22 13:12:54,987 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 13:12:54,989 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 13:12:54,989 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 13:12:54,990 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 13:12:54,994 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 13:12:54,994 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:12:54" (1/1) ... [2024-11-22 13:12:54,995 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6a2f3dad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:54, skipping insertion in model container [2024-11-22 13:12:54,995 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:12:54" (1/1) ... [2024-11-22 13:12:55,018 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 13:12:55,136 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_wrapper-s_file-95.i[916,929] [2024-11-22 13:12:55,213 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:12:55,224 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 13:12:55,236 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_wrapper-s_file-95.i[916,929] [2024-11-22 13:12:55,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:12:55,302 INFO L204 MainTranslator]: Completed translation [2024-11-22 13:12:55,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:55 WrapperNode [2024-11-22 13:12:55,302 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 13:12:55,303 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 13:12:55,303 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 13:12:55,304 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 13:12:55,308 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:55" (1/1) ... [2024-11-22 13:12:55,322 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:55" (1/1) ... [2024-11-22 13:12:55,353 INFO L138 Inliner]: procedures = 30, calls = 149, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 476 [2024-11-22 13:12:55,353 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 13:12:55,354 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 13:12:55,354 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 13:12:55,354 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 13:12:55,362 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:55" (1/1) ... [2024-11-22 13:12:55,363 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:55" (1/1) ... [2024-11-22 13:12:55,367 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:55" (1/1) ... [2024-11-22 13:12:55,374 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-22 13:12:55,374 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:55" (1/1) ... [2024-11-22 13:12:55,374 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:55" (1/1) ... [2024-11-22 13:12:55,396 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:55" (1/1) ... [2024-11-22 13:12:55,403 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:55" (1/1) ... [2024-11-22 13:12:55,405 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:55" (1/1) ... [2024-11-22 13:12:55,407 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:55" (1/1) ... [2024-11-22 13:12:55,418 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 13:12:55,418 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 13:12:55,419 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 13:12:55,419 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 13:12:55,421 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:55" (1/1) ... [2024-11-22 13:12:55,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:12:55,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:12:55,458 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-22 13:12:55,475 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-22 13:12:55,516 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 13:12:55,516 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-22 13:12:55,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-22 13:12:55,517 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-22 13:12:55,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-22 13:12:55,517 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-22 13:12:55,518 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-22 13:12:55,518 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 13:12:55,519 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 13:12:55,519 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-22 13:12:55,519 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 13:12:55,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 13:12:55,605 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 13:12:55,607 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 13:12:56,026 INFO L? ?]: Removed 125 outVars from TransFormulas that were not future-live. [2024-11-22 13:12:56,026 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 13:12:56,040 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 13:12:56,040 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 13:12:56,040 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:12:56 BoogieIcfgContainer [2024-11-22 13:12:56,041 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 13:12:56,042 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 13:12:56,042 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 13:12:56,045 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 13:12:56,045 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:12:54" (1/3) ... [2024-11-22 13:12:56,045 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9eaeea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:12:56, skipping insertion in model container [2024-11-22 13:12:56,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:12:55" (2/3) ... [2024-11-22 13:12:56,046 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2f9eaeea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:12:56, skipping insertion in model container [2024-11-22 13:12:56,046 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:12:56" (3/3) ... [2024-11-22 13:12:56,047 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-95.i [2024-11-22 13:12:56,061 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 13:12:56,062 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 13:12:56,114 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 13:12:56,119 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;@7c39bd6a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 13:12:56,120 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 13:12:56,123 INFO L276 IsEmpty]: Start isEmpty. Operand has 114 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 96 states have internal predecessors, (135), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 13:12:56,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-22 13:12:56,133 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:56,133 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:12:56,134 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:56,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:56,138 INFO L85 PathProgramCache]: Analyzing trace with hash 710017665, now seen corresponding path program 1 times [2024-11-22 13:12:56,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:56,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [388952328] [2024-11-22 13:12:56,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:56,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:56,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:56,448 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-22 13:12:56,448 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:56,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [388952328] [2024-11-22 13:12:56,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [388952328] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:12:56,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1930299176] [2024-11-22 13:12:56,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:56,450 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:12:56,450 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:12:56,456 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-22 13:12:56,459 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-22 13:12:56,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:56,695 INFO L255 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 13:12:56,702 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:12:56,721 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-11-22 13:12:56,721 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:12:56,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1930299176] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:56,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:12:56,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 13:12:56,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463266929] [2024-11-22 13:12:56,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:56,730 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 13:12:56,730 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:56,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 13:12:56,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 13:12:56,752 INFO L87 Difference]: Start difference. First operand has 114 states, 95 states have (on average 1.4210526315789473) internal successors, (135), 96 states have internal predecessors, (135), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 13:12:56,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:56,783 INFO L93 Difference]: Finished difference Result 221 states and 344 transitions. [2024-11-22 13:12:56,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 13:12:56,785 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) Word has length 132 [2024-11-22 13:12:56,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:56,792 INFO L225 Difference]: With dead ends: 221 [2024-11-22 13:12:56,793 INFO L226 Difference]: Without dead ends: 110 [2024-11-22 13:12:56,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 133 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-22 13:12:56,800 INFO L432 NwaCegarLoop]: 156 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, 156 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-22 13:12:56,801 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:12:56,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-22 13:12:56,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-22 13:12:56,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 92 states have (on average 1.3478260869565217) internal successors, (124), 92 states have internal predecessors, (124), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 13:12:56,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 156 transitions. [2024-11-22 13:12:56,838 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 156 transitions. Word has length 132 [2024-11-22 13:12:56,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:56,839 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 156 transitions. [2024-11-22 13:12:56,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.5) internal successors, (57), 2 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 13:12:56,839 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2024-11-22 13:12:56,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-22 13:12:56,843 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:56,843 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:12:56,851 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-22 13:12:57,043 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 13:12:57,044 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:57,045 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:57,045 INFO L85 PathProgramCache]: Analyzing trace with hash 373116069, now seen corresponding path program 1 times [2024-11-22 13:12:57,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:57,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [798930822] [2024-11-22 13:12:57,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:57,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:57,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:57,346 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 13:12:57,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:57,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [798930822] [2024-11-22 13:12:57,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [798930822] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:57,348 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:57,348 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:12:57,348 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [640067122] [2024-11-22 13:12:57,348 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:57,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:12:57,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:57,350 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:12:57,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:12:57,352 INFO L87 Difference]: Start difference. First operand 110 states and 156 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 13:12:57,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:57,390 INFO L93 Difference]: Finished difference Result 219 states and 312 transitions. [2024-11-22 13:12:57,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:12:57,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 132 [2024-11-22 13:12:57,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:57,392 INFO L225 Difference]: With dead ends: 219 [2024-11-22 13:12:57,392 INFO L226 Difference]: Without dead ends: 112 [2024-11-22 13:12:57,392 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:12:57,393 INFO L432 NwaCegarLoop]: 154 mSDtfsCounter, 0 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:57,393 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 451 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:12:57,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-22 13:12:57,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-22 13:12:57,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 94 states have (on average 1.3404255319148937) internal successors, (126), 94 states have internal predecessors, (126), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 13:12:57,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 158 transitions. [2024-11-22 13:12:57,412 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 158 transitions. Word has length 132 [2024-11-22 13:12:57,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:57,413 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 158 transitions. [2024-11-22 13:12:57,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 13:12:57,414 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 158 transitions. [2024-11-22 13:12:57,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-22 13:12:57,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:57,417 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:12:57,418 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 13:12:57,418 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:57,418 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:57,419 INFO L85 PathProgramCache]: Analyzing trace with hash 1411700643, now seen corresponding path program 1 times [2024-11-22 13:12:57,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:57,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312087426] [2024-11-22 13:12:57,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:57,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:57,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:57,646 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 13:12:57,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:57,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312087426] [2024-11-22 13:12:57,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1312087426] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:57,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:57,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:12:57,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181780017] [2024-11-22 13:12:57,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:57,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:12:57,650 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:57,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:12:57,651 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:12:57,651 INFO L87 Difference]: Start difference. First operand 112 states and 158 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 13:12:57,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:57,686 INFO L93 Difference]: Finished difference Result 224 states and 317 transitions. [2024-11-22 13:12:57,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:12:57,687 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2024-11-22 13:12:57,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:57,688 INFO L225 Difference]: With dead ends: 224 [2024-11-22 13:12:57,691 INFO L226 Difference]: Without dead ends: 115 [2024-11-22 13:12:57,691 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:12:57,692 INFO L432 NwaCegarLoop]: 153 mSDtfsCounter, 1 mSDsluCounter, 297 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 450 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:57,692 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 450 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:12:57,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-22 13:12:57,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-22 13:12:57,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 96 states have (on average 1.3333333333333333) internal successors, (128), 96 states have internal predecessors, (128), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 13:12:57,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2024-11-22 13:12:57,706 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 132 [2024-11-22 13:12:57,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:57,706 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2024-11-22 13:12:57,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 13:12:57,708 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2024-11-22 13:12:57,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-22 13:12:57,711 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:57,712 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:12:57,712 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 13:12:57,712 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:57,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:57,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1413547685, now seen corresponding path program 1 times [2024-11-22 13:12:57,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:57,713 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1711214216] [2024-11-22 13:12:57,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:57,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:57,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:58,193 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 13:12:58,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:58,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1711214216] [2024-11-22 13:12:58,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1711214216] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:12:58,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:12:58,194 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 13:12:58,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659753824] [2024-11-22 13:12:58,194 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:12:58,195 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 13:12:58,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:12:58,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 13:12:58,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 13:12:58,197 INFO L87 Difference]: Start difference. First operand 114 states and 160 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 13:12:58,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:12:58,364 INFO L93 Difference]: Finished difference Result 226 states and 318 transitions. [2024-11-22 13:12:58,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 13:12:58,365 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 132 [2024-11-22 13:12:58,365 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:12:58,366 INFO L225 Difference]: With dead ends: 226 [2024-11-22 13:12:58,366 INFO L226 Difference]: Without dead ends: 115 [2024-11-22 13:12:58,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 13:12:58,367 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 62 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 13:12:58,367 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 289 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 103 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 13:12:58,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-22 13:12:58,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-22 13:12:58,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 96 states have (on average 1.3229166666666667) internal successors, (127), 96 states have internal predecessors, (127), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 13:12:58,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2024-11-22 13:12:58,377 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 132 [2024-11-22 13:12:58,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:12:58,378 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2024-11-22 13:12:58,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 13:12:58,378 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2024-11-22 13:12:58,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-22 13:12:58,379 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:12:58,379 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:12:58,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 13:12:58,379 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:12:58,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:12:58,380 INFO L85 PathProgramCache]: Analyzing trace with hash -532592928, now seen corresponding path program 1 times [2024-11-22 13:12:58,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:12:58,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528789385] [2024-11-22 13:12:58,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:58,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:12:58,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:12:59,935 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-22 13:12:59,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:12:59,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528789385] [2024-11-22 13:12:59,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528789385] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:12:59,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2126755889] [2024-11-22 13:12:59,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:12:59,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:12:59,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:12:59,942 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:12:59,949 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 13:13:00,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:13:00,557 INFO L255 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-22 13:13:00,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:13:00,624 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-22 13:13:00,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-22 13:13:00,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-22 13:13:00,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-22 13:13:00,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-22 13:13:00,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-22 13:13:00,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:13:00,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 46 [2024-11-22 13:13:00,959 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:13:00,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 18 [2024-11-22 13:13:00,982 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 199 proven. 33 refuted. 0 times theorem prover too weak. 248 trivial. 0 not checked. [2024-11-22 13:13:00,983 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:13:01,297 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 12 proven. 33 refuted. 0 times theorem prover too weak. 435 trivial. 0 not checked. [2024-11-22 13:13:01,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2126755889] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 13:13:01,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 13:13:01,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 20 [2024-11-22 13:13:01,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [301788371] [2024-11-22 13:13:01,298 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 13:13:01,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-22 13:13:01,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:13:01,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-22 13:13:01,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2024-11-22 13:13:01,299 INFO L87 Difference]: Start difference. First operand 114 states and 159 transitions. Second operand has 20 states, 17 states have (on average 6.411764705882353) internal successors, (109), 20 states have internal predecessors, (109), 7 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (44), 4 states have call predecessors, (44), 7 states have call successors, (44) [2024-11-22 13:13:02,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:13:02,406 INFO L93 Difference]: Finished difference Result 264 states and 365 transitions. [2024-11-22 13:13:02,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-22 13:13:02,407 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 17 states have (on average 6.411764705882353) internal successors, (109), 20 states have internal predecessors, (109), 7 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (44), 4 states have call predecessors, (44), 7 states have call successors, (44) Word has length 134 [2024-11-22 13:13:02,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:13:02,408 INFO L225 Difference]: With dead ends: 264 [2024-11-22 13:13:02,409 INFO L226 Difference]: Without dead ends: 153 [2024-11-22 13:13:02,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=254, Invalid=936, Unknown=0, NotChecked=0, Total=1190 [2024-11-22 13:13:02,410 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 362 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 362 SdHoareTripleChecker+Valid, 734 SdHoareTripleChecker+Invalid, 1101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 80 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 13:13:02,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 734 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-22 13:13:02,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-22 13:13:02,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 148. [2024-11-22 13:13:02,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 125 states have (on average 1.32) internal successors, (165), 126 states have internal predecessors, (165), 19 states have call successors, (19), 3 states have call predecessors, (19), 3 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2024-11-22 13:13:02,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 203 transitions. [2024-11-22 13:13:02,425 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 203 transitions. Word has length 134 [2024-11-22 13:13:02,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:13:02,428 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 203 transitions. [2024-11-22 13:13:02,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 17 states have (on average 6.411764705882353) internal successors, (109), 20 states have internal predecessors, (109), 7 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (44), 4 states have call predecessors, (44), 7 states have call successors, (44) [2024-11-22 13:13:02,428 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 203 transitions. [2024-11-22 13:13:02,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-22 13:13:02,429 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:13:02,429 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:13:02,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-22 13:13:02,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:13:02,631 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:13:02,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:13:02,631 INFO L85 PathProgramCache]: Analyzing trace with hash 2017461842, now seen corresponding path program 1 times [2024-11-22 13:13:02,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:13:02,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048890730] [2024-11-22 13:13:02,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:13:02,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:13:02,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:13:03,508 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 13:13:03,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 13:13:03,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048890730] [2024-11-22 13:13:03,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048890730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:13:03,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:13:03,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 13:13:03,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984506205] [2024-11-22 13:13:03,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:13:03,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 13:13:03,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 13:13:03,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 13:13:03,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-22 13:13:03,511 INFO L87 Difference]: Start difference. First operand 148 states and 203 transitions. Second operand has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 13:13:04,458 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:13:04,458 INFO L93 Difference]: Finished difference Result 359 states and 487 transitions. [2024-11-22 13:13:04,459 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:13:04,459 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 135 [2024-11-22 13:13:04,459 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:13:04,461 INFO L225 Difference]: With dead ends: 359 [2024-11-22 13:13:04,461 INFO L226 Difference]: Without dead ends: 238 [2024-11-22 13:13:04,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-22 13:13:04,465 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 202 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 202 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 516 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-22 13:13:04,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [202 Valid, 477 Invalid, 516 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-22 13:13:04,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-22 13:13:04,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 187. [2024-11-22 13:13:04,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 149 states have (on average 1.2751677852348993) internal successors, (190), 149 states have internal predecessors, (190), 32 states have call successors, (32), 5 states have call predecessors, (32), 5 states have return successors, (32), 32 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-22 13:13:04,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 254 transitions. [2024-11-22 13:13:04,481 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 254 transitions. Word has length 135 [2024-11-22 13:13:04,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:13:04,481 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 254 transitions. [2024-11-22 13:13:04,482 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.25) internal successors, (58), 8 states have internal predecessors, (58), 2 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 13:13:04,482 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 254 transitions. [2024-11-22 13:13:04,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-22 13:13:04,483 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:13:04,483 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:13:04,483 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 13:13:04,483 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:13:04,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:13:04,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1696575056, now seen corresponding path program 1 times [2024-11-22 13:13:04,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 13:13:04,484 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74782428] [2024-11-22 13:13:04,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:13:04,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 13:13:04,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-22 13:13:04,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [645315849] [2024-11-22 13:13:04,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:13:04,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:13:04,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:13:04,587 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 13:13:04,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 13:13:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 13:13:05,420 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 13:13:05,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 13:13:06,004 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 13:13:06,005 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 13:13:06,007 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 13:13:06,020 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-22 13:13:06,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 13:13:06,211 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-22 13:13:06,280 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 13:13:06,282 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 01:13:06 BoogieIcfgContainer [2024-11-22 13:13:06,284 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 13:13:06,284 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 13:13:06,284 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 13:13:06,284 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 13:13:06,284 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:12:56" (3/4) ... [2024-11-22 13:13:06,286 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 13:13:06,287 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 13:13:06,287 INFO L158 Benchmark]: Toolchain (without parser) took 11298.71ms. Allocated memory was 163.6MB in the beginning and 377.5MB in the end (delta: 213.9MB). Free memory was 115.3MB in the beginning and 324.8MB in the end (delta: -209.5MB). Peak memory consumption was 6.0MB. Max. memory is 16.1GB. [2024-11-22 13:13:06,287 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 163.6MB. Free memory is still 129.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 13:13:06,288 INFO L158 Benchmark]: CACSL2BoogieTranslator took 313.25ms. Allocated memory is still 163.6MB. Free memory was 114.9MB in the beginning and 96.8MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-22 13:13:06,288 INFO L158 Benchmark]: Boogie Procedure Inliner took 50.11ms. Allocated memory is still 163.6MB. Free memory was 96.8MB in the beginning and 92.3MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 13:13:06,288 INFO L158 Benchmark]: Boogie Preprocessor took 63.97ms. Allocated memory is still 163.6MB. Free memory was 92.3MB in the beginning and 88.5MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 13:13:06,288 INFO L158 Benchmark]: RCFGBuilder took 622.28ms. Allocated memory is still 163.6MB. Free memory was 88.5MB in the beginning and 53.2MB in the end (delta: 35.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-22 13:13:06,288 INFO L158 Benchmark]: TraceAbstraction took 10241.60ms. Allocated memory was 163.6MB in the beginning and 377.5MB in the end (delta: 213.9MB). Free memory was 52.8MB in the beginning and 325.8MB in the end (delta: -273.0MB). Peak memory consumption was 150.7MB. Max. memory is 16.1GB. [2024-11-22 13:13:06,288 INFO L158 Benchmark]: Witness Printer took 2.85ms. Allocated memory is still 377.5MB. Free memory was 325.8MB in the beginning and 324.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 13:13:06,289 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.11ms. Allocated memory is still 163.6MB. Free memory is still 129.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 313.25ms. Allocated memory is still 163.6MB. Free memory was 114.9MB in the beginning and 96.8MB in the end (delta: 18.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 50.11ms. Allocated memory is still 163.6MB. Free memory was 96.8MB in the beginning and 92.3MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 63.97ms. Allocated memory is still 163.6MB. Free memory was 92.3MB in the beginning and 88.5MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 622.28ms. Allocated memory is still 163.6MB. Free memory was 88.5MB in the beginning and 53.2MB in the end (delta: 35.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 10241.60ms. Allocated memory was 163.6MB in the beginning and 377.5MB in the end (delta: 213.9MB). Free memory was 52.8MB in the beginning and 325.8MB in the end (delta: -273.0MB). Peak memory consumption was 150.7MB. Max. memory is 16.1GB. * Witness Printer took 2.85ms. Allocated memory is still 377.5MB. Free memory was 325.8MB in the beginning and 324.8MB in the end (delta: 1.0MB). 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 someBinaryFLOATComparisonOperation at line 107, overapproximation of someBinaryArithmeticFLOAToperation at line 60. Possible FailurePath: [L38] unsigned char isInitial = 0; [L39-L54] struct WrapperStruct00 WrapperStruct00 = { -64, 1.8, 8.54, 255.8, 50.4, 0, 8, 32, 5, 2, 0, 16, -1, -16 }; [L55] unsigned char last_1_WrapperStruct00_var_1_7 = 0; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_7=0] [L111] isInitial = 1 [L112] FCALL initially() [L113] COND TRUE 1 [L114] CALL updateLastVariables() [L104] EXPR WrapperStruct00.var_1_7 [L104] last_1_WrapperStruct00_var_1_7 = WrapperStruct00.var_1_7 [L114] RET updateLastVariables() [L115] CALL updateVariables() [L77] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L78] EXPR WrapperStruct00.var_1_4 [L78] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F [L78] EXPR WrapperStruct00.var_1_4 [L78] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L78] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L78] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L78] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L79] WrapperStruct00.var_1_5 = __VERIFIER_nondet_float() [L80] EXPR WrapperStruct00.var_1_5 [L80] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F [L80] EXPR WrapperStruct00.var_1_5 [L80] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L80] EXPR (WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L80] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L80] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L81] WrapperStruct00.var_1_6 = __VERIFIER_nondet_float() [L82] EXPR WrapperStruct00.var_1_6 [L82] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F [L82] EXPR WrapperStruct00.var_1_6 [L82] EXPR WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L82] EXPR (WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L82] CALL assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L82] RET assume_abort_if_not((WrapperStruct00.var_1_6 >= 0.0F && WrapperStruct00.var_1_6 <= -1.0e-20F) || (WrapperStruct00.var_1_6 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_6 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L83] WrapperStruct00.var_1_8 = __VERIFIER_nondet_ulong() [L84] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L84] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L84] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L85] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L85] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L85] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L86] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L87] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L87] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L87] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L88] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L88] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L88] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L89] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L90] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L91] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L91] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L91] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L92] WrapperStruct00.var_1_12 = __VERIFIER_nondet_uchar() [L93] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L94] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_12 <= 127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L95] WrapperStruct00.var_1_14 = __VERIFIER_nondet_ulong() [L96] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L97] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L97] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967295) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L97] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967295) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L98] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_14 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_14 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L99] WrapperStruct00.var_1_17 = __VERIFIER_nondet_char() [L100] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L100] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= -127) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L100] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= -127) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L101] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L101] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 126) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L115] RET updateVariables() [L116] CALL step() [L59] WrapperStruct00.var_1_1 = ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))) [L60] EXPR WrapperStruct00.var_1_4 [L60] EXPR WrapperStruct00.var_1_5 [L60] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L60] EXPR ((256.5f) < ((WrapperStruct00.var_1_6 - 16.125f))) ? (256.5f) : ((WrapperStruct00.var_1_6 - 16.125f)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L60] WrapperStruct00.var_1_3 = ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5) + ((((256.5f) < ((WrapperStruct00.var_1_6 - 16.125f))) ? (256.5f) : ((WrapperStruct00.var_1_6 - 16.125f))))) [L61] EXPR WrapperStruct00.var_1_17 [L61] WrapperStruct00.var_1_16 = WrapperStruct00.var_1_17 [L62] EXPR WrapperStruct00.var_1_16 [L62] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L62] EXPR WrapperStruct00.var_1_16 & WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L62] signed long int stepLocal_0 = WrapperStruct00.var_1_16 & WrapperStruct00.var_1_1; [L63] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0, stepLocal_0=0] [L63] COND TRUE (- (3351680781u - WrapperStruct00.var_1_8)) > stepLocal_0 [L64] EXPR WrapperStruct00.var_1_10 [L64] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L64] EXPR ((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11) [L64] EXPR WrapperStruct00.var_1_11 [L64] EXPR ((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L64] EXPR ((WrapperStruct00.var_1_10) < (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) ? (WrapperStruct00.var_1_10) : (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) [L64] EXPR WrapperStruct00.var_1_10 [L64] EXPR ((WrapperStruct00.var_1_10) < (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) ? (WrapperStruct00.var_1_10) : (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L64] EXPR WrapperStruct00.var_1_12 [L64] WrapperStruct00.var_1_7 = (((((WrapperStruct00.var_1_10) < (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) ? (WrapperStruct00.var_1_10) : (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))) + WrapperStruct00.var_1_12) [L66] EXPR WrapperStruct00.var_1_16 [L66] EXPR WrapperStruct00.var_1_14 [L66] EXPR WrapperStruct00.var_1_7 [L66] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L66] EXPR WrapperStruct00.var_1_7 >> WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L66] COND FALSE !((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_14) < (WrapperStruct00.var_1_7 >> WrapperStruct00.var_1_7)) [L69] EXPR WrapperStruct00.var_1_16 [L69] EXPR WrapperStruct00.var_1_1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L69] COND TRUE WrapperStruct00.var_1_16 >= WrapperStruct00.var_1_1 [L70] EXPR WrapperStruct00.var_1_12 [L70] EXPR WrapperStruct00.var_1_11 [L70] WrapperStruct00.var_1_13 = (-5 + (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_11)) [L116] RET step() [L117] CALL, EXPR property() [L107] EXPR WrapperStruct00.var_1_1 [L107] EXPR (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && (WrapperStruct00.var_1_3 == ((float) ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5) + ((((256.5f) < ((WrapperStruct00.var_1_6 - 16.125f))) ? (256.5f) : ((WrapperStruct00.var_1_6 - 16.125f))))))) [L107] EXPR WrapperStruct00.var_1_3 [L107] EXPR WrapperStruct00.var_1_4 [L107] EXPR WrapperStruct00.var_1_5 [L107] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L107] EXPR ((256.5f) < ((WrapperStruct00.var_1_6 - 16.125f))) ? (256.5f) : ((WrapperStruct00.var_1_6 - 16.125f)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L107] EXPR (WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && (WrapperStruct00.var_1_3 == ((float) ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5) + ((((256.5f) < ((WrapperStruct00.var_1_6 - 16.125f))) ? (256.5f) : ((WrapperStruct00.var_1_6 - 16.125f))))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L107] EXPR ((WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && (WrapperStruct00.var_1_3 == ((float) ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5) + ((((256.5f) < ((WrapperStruct00.var_1_6 - 16.125f))) ? (256.5f) : ((WrapperStruct00.var_1_6 - 16.125f)))))))) && (((- (3351680781u - WrapperStruct00.var_1_8)) > (WrapperStruct00.var_1_16 & WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (((((WrapperStruct00.var_1_10) < (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) ? (WrapperStruct00.var_1_10) : (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))) + WrapperStruct00.var_1_12))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L107] EXPR (((WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && (WrapperStruct00.var_1_3 == ((float) ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5) + ((((256.5f) < ((WrapperStruct00.var_1_6 - 16.125f))) ? (256.5f) : ((WrapperStruct00.var_1_6 - 16.125f)))))))) && (((- (3351680781u - WrapperStruct00.var_1_8)) > (WrapperStruct00.var_1_16 & WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (((((WrapperStruct00.var_1_10) < (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) ? (WrapperStruct00.var_1_10) : (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))) + WrapperStruct00.var_1_12))) : 1)) && (((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_14) < (WrapperStruct00.var_1_7 >> WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((((4 - WrapperStruct00.var_1_11) < 0 ) ? -(4 - WrapperStruct00.var_1_11) : (4 - WrapperStruct00.var_1_11))))) : ((WrapperStruct00.var_1_16 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_13 == ((signed short int) (-5 + (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_11)))) : (WrapperStruct00.var_1_13 == ((signed short int) 256)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L107] EXPR ((((WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && (WrapperStruct00.var_1_3 == ((float) ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5) + ((((256.5f) < ((WrapperStruct00.var_1_6 - 16.125f))) ? (256.5f) : ((WrapperStruct00.var_1_6 - 16.125f)))))))) && (((- (3351680781u - WrapperStruct00.var_1_8)) > (WrapperStruct00.var_1_16 & WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (((((WrapperStruct00.var_1_10) < (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) ? (WrapperStruct00.var_1_10) : (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))) + WrapperStruct00.var_1_12))) : 1)) && (((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_14) < (WrapperStruct00.var_1_7 >> WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((((4 - WrapperStruct00.var_1_11) < 0 ) ? -(4 - WrapperStruct00.var_1_11) : (4 - WrapperStruct00.var_1_11))))) : ((WrapperStruct00.var_1_16 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_13 == ((signed short int) (-5 + (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_11)))) : (WrapperStruct00.var_1_13 == ((signed short int) 256))))) && (WrapperStruct00.var_1_16 == ((signed char) WrapperStruct00.var_1_17)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L107-L108] return ((((WrapperStruct00.var_1_1 == ((signed long int) ((((last_1_WrapperStruct00_var_1_7) < 0 ) ? -(last_1_WrapperStruct00_var_1_7) : (last_1_WrapperStruct00_var_1_7))))) && (WrapperStruct00.var_1_3 == ((float) ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5) + ((((256.5f) < ((WrapperStruct00.var_1_6 - 16.125f))) ? (256.5f) : ((WrapperStruct00.var_1_6 - 16.125f)))))))) && (((- (3351680781u - WrapperStruct00.var_1_8)) > (WrapperStruct00.var_1_16 & WrapperStruct00.var_1_1)) ? (WrapperStruct00.var_1_7 == ((unsigned char) (((((WrapperStruct00.var_1_10) < (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11))))) ? (WrapperStruct00.var_1_10) : (((((WrapperStruct00.var_1_11) < 0 ) ? -(WrapperStruct00.var_1_11) : (WrapperStruct00.var_1_11)))))) + WrapperStruct00.var_1_12))) : 1)) && (((WrapperStruct00.var_1_16 / WrapperStruct00.var_1_14) < (WrapperStruct00.var_1_7 >> WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_13 == ((signed short int) ((((4 - WrapperStruct00.var_1_11) < 0 ) ? -(4 - WrapperStruct00.var_1_11) : (4 - WrapperStruct00.var_1_11))))) : ((WrapperStruct00.var_1_16 >= WrapperStruct00.var_1_1) ? (WrapperStruct00.var_1_13 == ((signed short int) (-5 + (WrapperStruct00.var_1_12 - WrapperStruct00.var_1_11)))) : (WrapperStruct00.var_1_13 == ((signed short int) 256))))) && (WrapperStruct00.var_1_16 == ((signed char) WrapperStruct00.var_1_17)) ; [L117] RET, EXPR property() [L117] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_7=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 114 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.1s, OverallIterations: 7, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 627 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 627 mSDsluCounter, 2557 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1786 mSDsCounter, 152 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1604 IncrementalHoareTripleChecker+Invalid, 1756 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 152 mSolverCounterUnsat, 771 mSDtfsCounter, 1604 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 465 GetRequests, 415 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 206 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred in iteration=6, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 58 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.6s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 1337 NumberOfCodeBlocks, 1337 NumberOfCodeBlocksAsserted, 10 NumberOfCheckSat, 1188 ConstructedInterpolants, 0 QuantifiedInterpolants, 3327 SizeOfPredicates, 8 NumberOfNonLiveVariables, 977 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 4191/4320 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-22 13:13:06,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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_wrapper-s_file-95.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 4cc757866639008b8de2bb637453380004a1f2541632c98c93ed486e64a84677 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 13:13:08,189 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 13:13:08,256 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 13:13:08,262 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 13:13:08,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 13:13:08,292 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 13:13:08,294 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 13:13:08,294 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 13:13:08,295 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 13:13:08,295 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 13:13:08,295 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 13:13:08,296 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 13:13:08,296 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 13:13:08,296 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 13:13:08,296 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 13:13:08,297 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 13:13:08,297 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 13:13:08,299 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 13:13:08,299 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 13:13:08,299 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 13:13:08,300 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 13:13:08,304 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 13:13:08,304 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 13:13:08,304 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 13:13:08,304 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 13:13:08,305 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 13:13:08,305 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 13:13:08,305 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 13:13:08,305 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 13:13:08,305 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 13:13:08,305 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 13:13:08,306 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 13:13:08,306 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 13:13:08,306 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 13:13:08,306 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:13:08,306 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 13:13:08,306 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 13:13:08,307 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 13:13:08,307 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 13:13:08,307 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 13:13:08,307 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 13:13:08,307 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 13:13:08,308 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 13:13:08,308 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 13:13:08,308 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 -> 4cc757866639008b8de2bb637453380004a1f2541632c98c93ed486e64a84677 [2024-11-22 13:13:08,551 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 13:13:08,569 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 13:13:08,573 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 13:13:08,574 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 13:13:08,574 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 13:13:08,575 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-95.i [2024-11-22 13:13:09,916 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 13:13:10,080 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 13:13:10,081 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-95.i [2024-11-22 13:13:10,092 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9af7eed23/414c75244b944d099f1225044360c242/FLAG5b6ee812c [2024-11-22 13:13:10,474 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9af7eed23/414c75244b944d099f1225044360c242 [2024-11-22 13:13:10,476 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 13:13:10,477 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 13:13:10,478 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 13:13:10,478 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 13:13:10,493 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 13:13:10,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:13:10" (1/1) ... [2024-11-22 13:13:10,495 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4bb8456a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:10, skipping insertion in model container [2024-11-22 13:13:10,495 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 01:13:10" (1/1) ... [2024-11-22 13:13:10,518 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 13:13:10,637 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_wrapper-s_file-95.i[916,929] [2024-11-22 13:13:10,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:13:10,706 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 13:13:10,716 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_wrapper-s_file-95.i[916,929] [2024-11-22 13:13:10,747 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 13:13:10,765 INFO L204 MainTranslator]: Completed translation [2024-11-22 13:13:10,765 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:10 WrapperNode [2024-11-22 13:13:10,765 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 13:13:10,766 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 13:13:10,766 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 13:13:10,766 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 13:13:10,770 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:10" (1/1) ... [2024-11-22 13:13:10,788 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:10" (1/1) ... [2024-11-22 13:13:10,814 INFO L138 Inliner]: procedures = 37, calls = 149, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 443 [2024-11-22 13:13:10,815 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 13:13:10,815 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 13:13:10,815 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 13:13:10,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 13:13:10,823 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:10" (1/1) ... [2024-11-22 13:13:10,823 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:10" (1/1) ... [2024-11-22 13:13:10,828 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:10" (1/1) ... [2024-11-22 13:13:10,840 INFO L175 MemorySlicer]: Split 122 memory accesses to 2 slices as follows [2, 120]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 31 writes are split as follows [0, 31]. [2024-11-22 13:13:10,841 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:10" (1/1) ... [2024-11-22 13:13:10,841 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:10" (1/1) ... [2024-11-22 13:13:10,853 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:10" (1/1) ... [2024-11-22 13:13:10,856 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:10" (1/1) ... [2024-11-22 13:13:10,858 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:10" (1/1) ... [2024-11-22 13:13:10,860 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:10" (1/1) ... [2024-11-22 13:13:10,863 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 13:13:10,864 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 13:13:10,864 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 13:13:10,864 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 13:13:10,865 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:10" (1/1) ... [2024-11-22 13:13:10,869 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 13:13:10,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 13:13:10,897 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-22 13:13:10,900 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-22 13:13:10,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 13:13:10,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-22 13:13:10,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-22 13:13:10,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 13:13:10,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 13:13:10,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-22 13:13:10,941 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-22 13:13:10,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 13:13:10,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 13:13:10,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-22 13:13:10,942 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-22 13:13:10,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-22 13:13:10,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-22 13:13:10,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-22 13:13:10,942 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-22 13:13:10,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-22 13:13:10,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-22 13:13:10,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-22 13:13:10,943 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-22 13:13:10,943 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 13:13:10,944 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 13:13:10,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-22 13:13:10,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-22 13:13:10,944 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 13:13:10,944 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 13:13:10,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-22 13:13:10,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-22 13:13:10,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-22 13:13:10,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-22 13:13:10,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 13:13:10,944 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 13:13:11,060 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 13:13:11,062 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 13:13:12,444 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-22 13:13:12,445 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 13:13:12,460 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 13:13:12,460 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 13:13:12,460 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:13:12 BoogieIcfgContainer [2024-11-22 13:13:12,460 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 13:13:12,463 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 13:13:12,463 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 13:13:12,466 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 13:13:12,466 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 01:13:10" (1/3) ... [2024-11-22 13:13:12,466 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ceaf2c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:13:12, skipping insertion in model container [2024-11-22 13:13:12,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 01:13:10" (2/3) ... [2024-11-22 13:13:12,467 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ceaf2c2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 01:13:12, skipping insertion in model container [2024-11-22 13:13:12,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 01:13:12" (3/3) ... [2024-11-22 13:13:12,468 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-95.i [2024-11-22 13:13:12,481 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 13:13:12,481 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 13:13:12,523 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 13:13:12,528 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;@5581d560, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 13:13:12,529 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 13:13:12,532 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 85 states have internal predecessors, (118), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 13:13:12,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-22 13:13:12,544 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:13:12,545 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:13:12,545 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:13:12,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:13:12,550 INFO L85 PathProgramCache]: Analyzing trace with hash -1308038037, now seen corresponding path program 1 times [2024-11-22 13:13:12,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:13:12,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [853050311] [2024-11-22 13:13:12,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:13:12,580 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-22 13:13:12,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:13:12,583 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-22 13:13:12,583 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-22 13:13:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:13:12,943 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 13:13:12,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:13:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 246 proven. 0 refuted. 0 times theorem prover too weak. 234 trivial. 0 not checked. [2024-11-22 13:13:12,975 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:13:12,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:13:12,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [853050311] [2024-11-22 13:13:12,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [853050311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:13:12,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:13:12,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 13:13:12,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006943411] [2024-11-22 13:13:12,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:13:12,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 13:13:12,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:13:13,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 13:13:13,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 13:13:13,003 INFO L87 Difference]: Start difference. First operand has 103 states, 84 states have (on average 1.4047619047619047) internal successors, (118), 85 states have internal predecessors, (118), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 13:13:13,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:13:13,035 INFO L93 Difference]: Finished difference Result 199 states and 310 transitions. [2024-11-22 13:13:13,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 13:13:13,038 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 129 [2024-11-22 13:13:13,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:13:13,044 INFO L225 Difference]: With dead ends: 199 [2024-11-22 13:13:13,045 INFO L226 Difference]: Without dead ends: 99 [2024-11-22 13:13:13,049 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 128 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-22 13:13:13,052 INFO L432 NwaCegarLoop]: 139 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, 139 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-22 13:13:13,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 13:13:13,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-22 13:13:13,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-22 13:13:13,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 81 states have internal predecessors, (107), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 13:13:13,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 139 transitions. [2024-11-22 13:13:13,089 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 139 transitions. Word has length 129 [2024-11-22 13:13:13,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:13:13,089 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 139 transitions. [2024-11-22 13:13:13,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 13:13:13,090 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 139 transitions. [2024-11-22 13:13:13,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-22 13:13:13,092 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:13:13,092 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:13:13,104 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-22 13:13:13,292 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-22 13:13:13,296 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:13:13,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:13:13,297 INFO L85 PathProgramCache]: Analyzing trace with hash 1652192455, now seen corresponding path program 1 times [2024-11-22 13:13:13,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:13:13,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037044951] [2024-11-22 13:13:13,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:13:13,298 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-22 13:13:13,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:13:13,300 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-22 13:13:13,301 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-22 13:13:13,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:13:13,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 13:13:13,674 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:13:13,757 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 13:13:13,758 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:13:13,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:13:13,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2037044951] [2024-11-22 13:13:13,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2037044951] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:13:13,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:13:13,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-22 13:13:13,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648362241] [2024-11-22 13:13:13,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:13:13,760 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:13:13,760 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:13:13,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:13:13,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:13:13,761 INFO L87 Difference]: Start difference. First operand 99 states and 139 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 13:13:14,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:13:14,113 INFO L93 Difference]: Finished difference Result 202 states and 285 transitions. [2024-11-22 13:13:14,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 13:13:14,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2024-11-22 13:13:14,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:13:14,115 INFO L225 Difference]: With dead ends: 202 [2024-11-22 13:13:14,115 INFO L226 Difference]: Without dead ends: 106 [2024-11-22 13:13:14,115 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:13:14,116 INFO L432 NwaCegarLoop]: 132 mSDtfsCounter, 1 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 644 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:13:14,116 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 644 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 13:13:14,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-22 13:13:14,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-22 13:13:14,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.2988505747126438) internal successors, (113), 87 states have internal predecessors, (113), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 13:13:14,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 145 transitions. [2024-11-22 13:13:14,125 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 145 transitions. Word has length 129 [2024-11-22 13:13:14,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:13:14,126 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 145 transitions. [2024-11-22 13:13:14,126 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 6 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 13:13:14,126 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 145 transitions. [2024-11-22 13:13:14,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-22 13:13:14,127 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:13:14,127 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:13:14,144 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-22 13:13:14,331 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-22 13:13:14,332 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:13:14,333 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:13:14,333 INFO L85 PathProgramCache]: Analyzing trace with hash 1654039497, now seen corresponding path program 1 times [2024-11-22 13:13:14,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:13:14,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1480672314] [2024-11-22 13:13:14,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:13:14,334 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-22 13:13:14,334 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:13:14,336 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-22 13:13:14,337 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-22 13:13:14,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:13:14,645 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 13:13:14,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:13:14,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-22 13:13:14,810 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 13:13:14,811 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:13:14,811 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:13:14,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1480672314] [2024-11-22 13:13:14,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1480672314] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:13:14,812 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:13:14,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:13:14,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368941073] [2024-11-22 13:13:14,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:13:14,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:13:14,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:13:14,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:13:14,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:13:14,814 INFO L87 Difference]: Start difference. First operand 105 states and 145 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 13:13:16,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:13:16,370 INFO L93 Difference]: Finished difference Result 208 states and 288 transitions. [2024-11-22 13:13:16,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:13:16,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 129 [2024-11-22 13:13:16,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:13:16,372 INFO L225 Difference]: With dead ends: 208 [2024-11-22 13:13:16,372 INFO L226 Difference]: Without dead ends: 106 [2024-11-22 13:13:16,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:13:16,373 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 133 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 395 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-22 13:13:16,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 395 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-22 13:13:16,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-22 13:13:16,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-22 13:13:16,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.2873563218390804) internal successors, (112), 87 states have internal predecessors, (112), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 13:13:16,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 144 transitions. [2024-11-22 13:13:16,387 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 144 transitions. Word has length 129 [2024-11-22 13:13:16,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:13:16,388 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 144 transitions. [2024-11-22 13:13:16,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 13:13:16,388 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 144 transitions. [2024-11-22 13:13:16,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-22 13:13:16,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:13:16,389 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:13:16,404 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-22 13:13:16,590 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-22 13:13:16,590 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:13:16,594 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:13:16,594 INFO L85 PathProgramCache]: Analyzing trace with hash -1320083773, now seen corresponding path program 1 times [2024-11-22 13:13:16,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:13:16,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1632954400] [2024-11-22 13:13:16,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:13:16,595 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-22 13:13:16,595 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:13:16,597 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-22 13:13:16,598 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-22 13:13:16,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:13:16,915 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 13:13:16,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:13:16,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-22 13:13:17,015 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 60 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-11-22 13:13:17,015 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:13:17,015 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:13:17,015 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1632954400] [2024-11-22 13:13:17,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1632954400] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:13:17,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:13:17,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:13:17,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276553166] [2024-11-22 13:13:17,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:13:17,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:13:17,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:13:17,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:13:17,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:13:17,021 INFO L87 Difference]: Start difference. First operand 105 states and 144 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 13:13:18,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:13:18,345 INFO L93 Difference]: Finished difference Result 208 states and 286 transitions. [2024-11-22 13:13:18,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:13:18,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 131 [2024-11-22 13:13:18,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:13:18,347 INFO L225 Difference]: With dead ends: 208 [2024-11-22 13:13:18,347 INFO L226 Difference]: Without dead ends: 106 [2024-11-22 13:13:18,347 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:13:18,348 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 122 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:13:18,348 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 390 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-22 13:13:18,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-22 13:13:18,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-22 13:13:18,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.2758620689655173) internal successors, (111), 87 states have internal predecessors, (111), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 13:13:18,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 143 transitions. [2024-11-22 13:13:18,356 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 143 transitions. Word has length 131 [2024-11-22 13:13:18,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:13:18,356 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 143 transitions. [2024-11-22 13:13:18,356 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 5 states have internal predecessors, (57), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 13:13:18,356 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 143 transitions. [2024-11-22 13:13:18,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-22 13:13:18,358 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:13:18,358 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:13:18,371 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 (5)] Ended with exit code 0 [2024-11-22 13:13:18,558 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-22 13:13:18,559 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:13:18,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:13:18,560 INFO L85 PathProgramCache]: Analyzing trace with hash 80331145, now seen corresponding path program 1 times [2024-11-22 13:13:18,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:13:18,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1029464174] [2024-11-22 13:13:18,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:13:18,564 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-22 13:13:18,564 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:13:18,566 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-22 13:13:18,567 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-22 13:13:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:13:18,894 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 13:13:18,897 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:13:18,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 41 [2024-11-22 13:13:18,993 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 112 proven. 0 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2024-11-22 13:13:18,994 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:13:18,994 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:13:18,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1029464174] [2024-11-22 13:13:18,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1029464174] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:13:18,994 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 13:13:18,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 13:13:18,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754526985] [2024-11-22 13:13:18,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:13:18,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:13:18,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:13:18,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:13:18,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-22 13:13:18,995 INFO L87 Difference]: Start difference. First operand 105 states and 143 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 13:13:20,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:13:20,292 INFO L93 Difference]: Finished difference Result 208 states and 284 transitions. [2024-11-22 13:13:20,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:13:20,293 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 133 [2024-11-22 13:13:20,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:13:20,295 INFO L225 Difference]: With dead ends: 208 [2024-11-22 13:13:20,295 INFO L226 Difference]: Without dead ends: 106 [2024-11-22 13:13:20,296 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-22 13:13:20,296 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 113 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-11-22 13:13:20,302 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 386 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-11-22 13:13:20,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-22 13:13:20,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-22 13:13:20,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 87 states have (on average 1.264367816091954) internal successors, (110), 87 states have internal predecessors, (110), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 13:13:20,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 142 transitions. [2024-11-22 13:13:20,315 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 142 transitions. Word has length 133 [2024-11-22 13:13:20,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:13:20,316 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 142 transitions. [2024-11-22 13:13:20,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 2 states have call successors, (16), 2 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2024-11-22 13:13:20,316 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 142 transitions. [2024-11-22 13:13:20,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-22 13:13:20,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:13:20,324 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:13:20,339 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 (6)] Ended with exit code 0 [2024-11-22 13:13:20,524 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-22 13:13:20,524 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:13:20,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:13:20,525 INFO L85 PathProgramCache]: Analyzing trace with hash 616356483, now seen corresponding path program 1 times [2024-11-22 13:13:20,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:13:20,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [443430852] [2024-11-22 13:13:20,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:13:20,526 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-22 13:13:20,526 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:13:20,528 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-22 13:13:20,531 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-22 13:13:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:13:20,976 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-22 13:13:20,981 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:13:20,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:20,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:20,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:20,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:20,992 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 13:13:20,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:20,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:20,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:20,995 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:20,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:20,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:20,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:20,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:20,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:21,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:21,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:21,001 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:21,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:21,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:21,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:21,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:21,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:21,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:21,005 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:21,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:21,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:21,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:21,008 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:21,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 28 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 89 [2024-11-22 13:13:21,210 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:13:21,211 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 99 treesize of output 39 [2024-11-22 13:13:21,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 13:13:21,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 13 [2024-11-22 13:13:21,404 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-11-22 13:13:21,564 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:13:21,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2024-11-22 13:13:21,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:13:21,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2024-11-22 13:13:21,918 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:13:21,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2024-11-22 13:13:22,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2024-11-22 13:13:22,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:13:22,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 60 treesize of output 28 [2024-11-22 13:13:22,223 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 327 proven. 33 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2024-11-22 13:13:22,223 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:13:22,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:13:22,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [443430852] [2024-11-22 13:13:22,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [443430852] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:13:22,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [972236146] [2024-11-22 13:13:22,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:13:22,361 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 13:13:22,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 13:13:22,364 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 13:13:22,365 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2024-11-22 13:13:23,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:13:23,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-22 13:13:23,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:13:23,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 13:13:23,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 12 [2024-11-22 13:13:23,842 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:13:23,843 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 43 [2024-11-22 13:13:23,898 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:13:23,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 69 treesize of output 45 [2024-11-22 13:13:23,922 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-22 13:13:23,922 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 13:13:23,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [972236146] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 13:13:23,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 13:13:23,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-11-22 13:13:23,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [177057705] [2024-11-22 13:13:23,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 13:13:23,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-22 13:13:23,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:13:23,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-22 13:13:23,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-22 13:13:23,924 INFO L87 Difference]: Start difference. First operand 105 states and 142 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 13:13:25,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:13:25,492 INFO L93 Difference]: Finished difference Result 240 states and 324 transitions. [2024-11-22 13:13:25,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 13:13:25,493 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) Word has length 135 [2024-11-22 13:13:25,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:13:25,496 INFO L225 Difference]: With dead ends: 240 [2024-11-22 13:13:25,496 INFO L226 Difference]: Without dead ends: 138 [2024-11-22 13:13:25,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2024-11-22 13:13:25,497 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 181 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-22 13:13:25,497 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 203 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-22 13:13:25,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-22 13:13:25,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 103. [2024-11-22 13:13:25,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 85 states have (on average 1.2588235294117647) internal successors, (107), 85 states have internal predecessors, (107), 16 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2024-11-22 13:13:25,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 139 transitions. [2024-11-22 13:13:25,511 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 139 transitions. Word has length 135 [2024-11-22 13:13:25,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:13:25,511 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 139 transitions. [2024-11-22 13:13:25,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 5 states have internal predecessors, (58), 1 states have call successors, (16), 1 states have call predecessors, (16), 1 states have return successors, (16), 1 states have call predecessors, (16), 1 states have call successors, (16) [2024-11-22 13:13:25,511 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 139 transitions. [2024-11-22 13:13:25,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-22 13:13:25,516 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:13:25,516 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:13:25,530 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 (7)] Forceful destruction successful, exit code 0 [2024-11-22 13:13:25,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Forceful destruction successful, exit code 0 [2024-11-22 13:13:25,917 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,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-22 13:13:25,918 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:13:25,918 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:13:25,918 INFO L85 PathProgramCache]: Analyzing trace with hash -733443842, now seen corresponding path program 1 times [2024-11-22 13:13:25,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:13:25,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [306436214] [2024-11-22 13:13:25,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:13:25,919 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-22 13:13:25,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:13:25,920 INFO L229 MonitoredProcess]: Starting monitored process 9 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-22 13:13:25,922 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 (9)] Waiting until timeout for monitored process [2024-11-22 13:13:26,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:13:26,531 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-22 13:13:26,539 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:13:26,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:26,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:26,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:26,577 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 13:13:26,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:26,581 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:26,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:26,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:26,583 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:26,584 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:26,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:26,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:26,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:26,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:26,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:26,595 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:26,596 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:26,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:26,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:26,604 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:26,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:26,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 21 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 79 [2024-11-22 13:13:26,729 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:13:26,729 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 89 treesize of output 35 [2024-11-22 13:13:26,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-22 13:13:26,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2024-11-22 13:13:26,973 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:13:26,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 36 [2024-11-22 13:13:27,164 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:13:27,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2024-11-22 13:13:27,304 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:13:27,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2024-11-22 13:13:27,525 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:13:27,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 49 treesize of output 39 [2024-11-22 13:13:27,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 39 [2024-11-22 13:13:27,779 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:13:27,780 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 68 treesize of output 30 [2024-11-22 13:13:27,815 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 271 proven. 33 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-11-22 13:13:27,815 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:13:27,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 13:13:27,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [306436214] [2024-11-22 13:13:27,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [306436214] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:13:27,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1660164529] [2024-11-22 13:13:27,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:13:27,963 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-22 13:13:27,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-22 13:13:27,964 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-22 13:13:27,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2024-11-22 13:13:29,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 13:13:29,435 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-22 13:13:29,439 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 13:13:29,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:29,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:29,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:29,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:29,452 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-22 13:13:29,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:29,453 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:29,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:29,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:29,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:29,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:29,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:29,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:29,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:29,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:29,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:29,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:29,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:29,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:29,462 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:29,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:29,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:29,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:29,465 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:29,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:29,466 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:29,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:29,468 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 13:13:29,469 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 64 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 71 [2024-11-22 13:13:29,664 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:13:29,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 9 select indices, 9 select index equivalence classes, 36 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 79 treesize of output 39 [2024-11-22 13:13:29,804 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-22 13:13:29,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 19 [2024-11-22 13:13:30,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:13:30,227 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 30 [2024-11-22 13:13:30,424 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:13:30,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 33 [2024-11-22 13:13:30,558 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:13:30,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 33 [2024-11-22 13:13:30,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 13:13:30,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 33 [2024-11-22 13:13:30,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2024-11-22 13:13:31,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 15 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 44 [2024-11-22 13:13:31,131 INFO L134 CoverageAnalysis]: Checked inductivity of 480 backedges. 271 proven. 33 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2024-11-22 13:13:31,131 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 13:13:31,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1660164529] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 13:13:31,340 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 13:13:31,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2024-11-22 13:13:31,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645389670] [2024-11-22 13:13:31,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 13:13:31,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-22 13:13:31,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 13:13:31,342 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-22 13:13:31,342 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870 [2024-11-22 13:13:31,343 INFO L87 Difference]: Start difference. First operand 103 states and 139 transitions. Second operand has 22 states, 20 states have (on average 6.05) internal successors, (121), 19 states have internal predecessors, (121), 8 states have call successors, (32), 6 states have call predecessors, (32), 8 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2024-11-22 13:13:36,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 13:13:36,562 INFO L93 Difference]: Finished difference Result 348 states and 461 transitions. [2024-11-22 13:13:36,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-22 13:13:36,563 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 6.05) internal successors, (121), 19 states have internal predecessors, (121), 8 states have call successors, (32), 6 states have call predecessors, (32), 8 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) Word has length 137 [2024-11-22 13:13:36,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 13:13:36,564 INFO L225 Difference]: With dead ends: 348 [2024-11-22 13:13:36,564 INFO L226 Difference]: Without dead ends: 248 [2024-11-22 13:13:36,565 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 301 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=330, Invalid=1310, Unknown=0, NotChecked=0, Total=1640 [2024-11-22 13:13:36,565 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 584 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 585 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 1309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 1206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2024-11-22 13:13:36,566 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 753 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2024-11-22 13:13:36,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-22 13:13:36,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 239. [2024-11-22 13:13:36,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 239 states, 197 states have (on average 1.248730964467005) internal successors, (246), 198 states have internal predecessors, (246), 35 states have call successors, (35), 6 states have call predecessors, (35), 6 states have return successors, (35), 34 states have call predecessors, (35), 35 states have call successors, (35) [2024-11-22 13:13:36,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 316 transitions. [2024-11-22 13:13:36,589 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 316 transitions. Word has length 137 [2024-11-22 13:13:36,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 13:13:36,590 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 316 transitions. [2024-11-22 13:13:36,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 6.05) internal successors, (121), 19 states have internal predecessors, (121), 8 states have call successors, (32), 6 states have call predecessors, (32), 8 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2024-11-22 13:13:36,590 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 316 transitions. [2024-11-22 13:13:36,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-22 13:13:36,591 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 13:13:36,591 INFO L215 NwaCegarLoop]: trace histogram [16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-22 13:13:36,611 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 (9)] Forceful destruction successful, exit code 0 [2024-11-22 13:13:36,807 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Forceful destruction successful, exit code 0 [2024-11-22 13:13:36,995 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-22 13:13:36,995 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 13:13:36,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 13:13:36,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1997671237, now seen corresponding path program 1 times [2024-11-22 13:13:36,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 13:13:36,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1166781122] [2024-11-22 13:13:36,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 13:13:36,996 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-22 13:13:36,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 13:13:36,999 INFO L229 MonitoredProcess]: Starting monitored process 11 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-22 13:13:37,001 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 (11)] Waiting until timeout for monitored process