./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 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_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-3061b6d-m [2024-11-19 01:13:04,080 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:13:04,162 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:13:04,167 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:13:04,169 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:13:04,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:13:04,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:13:04,201 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:13:04,202 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:13:04,204 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:13:04,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:13:04,204 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:13:04,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:13:04,205 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:13:04,206 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:13:04,209 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:13:04,209 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:13:04,209 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:13:04,210 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:13:04,210 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:13:04,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:13:04,211 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:13:04,211 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:13:04,211 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:13:04,212 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:13:04,212 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:13:04,212 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:13:04,212 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:13:04,213 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:13:04,213 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:13:04,213 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:13:04,213 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:13:04,214 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:13:04,214 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:13:04,216 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:13:04,216 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:13:04,217 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:13:04,217 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:13:04,217 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:13:04,217 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:13:04,218 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:13:04,218 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:13:04,218 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-19 01:13:04,471 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:13:04,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:13:04,495 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:13:04,496 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:13:04,497 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:13:04,498 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-19 01:13:05,918 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:13:06,143 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:13:06,144 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-95.i [2024-11-19 01:13:06,157 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1af3a5a5/81612ff76bf04ad7abfab17744693a6f/FLAGc94bc473e [2024-11-19 01:13:06,539 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e1af3a5a5/81612ff76bf04ad7abfab17744693a6f [2024-11-19 01:13:06,541 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:13:06,543 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:13:06,546 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:13:06,546 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:13:06,551 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:13:06,552 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:13:06" (1/1) ... [2024-11-19 01:13:06,552 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@20701586 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:06, skipping insertion in model container [2024-11-19 01:13:06,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:13:06" (1/1) ... [2024-11-19 01:13:06,579 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:13:06,746 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-19 01:13:06,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:13:06,812 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:13:06,822 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-19 01:13:06,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:13:06,899 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:13:06,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:06 WrapperNode [2024-11-19 01:13:06,899 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:13:06,901 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:13:06,901 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:13:06,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:13:06,908 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:06" (1/1) ... [2024-11-19 01:13:06,928 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:06" (1/1) ... [2024-11-19 01:13:06,972 INFO L138 Inliner]: procedures = 30, calls = 149, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 476 [2024-11-19 01:13:06,973 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:13:06,974 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:13:06,974 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:13:06,974 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:13:06,996 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:06" (1/1) ... [2024-11-19 01:13:07,004 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:06" (1/1) ... [2024-11-19 01:13:07,015 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:06" (1/1) ... [2024-11-19 01:13:07,023 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-19 01:13:07,024 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:06" (1/1) ... [2024-11-19 01:13:07,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:06" (1/1) ... [2024-11-19 01:13:07,056 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:06" (1/1) ... [2024-11-19 01:13:07,067 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:06" (1/1) ... [2024-11-19 01:13:07,070 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:06" (1/1) ... [2024-11-19 01:13:07,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:06" (1/1) ... [2024-11-19 01:13:07,088 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:13:07,090 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:13:07,091 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:13:07,091 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:13:07,093 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:06" (1/1) ... [2024-11-19 01:13:07,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:13:07,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:13:07,132 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-19 01:13:07,136 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-19 01:13:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:13:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-19 01:13:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-19 01:13:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-19 01:13:07,187 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 01:13:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-19 01:13:07,188 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 01:13:07,189 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:13:07,189 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:13:07,190 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 01:13:07,190 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:13:07,190 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:13:07,304 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:13:07,306 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:13:07,930 INFO L? ?]: Removed 125 outVars from TransFormulas that were not future-live. [2024-11-19 01:13:07,930 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:13:07,952 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:13:07,953 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:13:07,954 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:13:07 BoogieIcfgContainer [2024-11-19 01:13:07,954 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:13:07,956 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:13:07,958 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:13:07,961 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:13:07,961 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:13:06" (1/3) ... [2024-11-19 01:13:07,962 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30543736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:13:07, skipping insertion in model container [2024-11-19 01:13:07,963 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:06" (2/3) ... [2024-11-19 01:13:07,963 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30543736 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:13:07, skipping insertion in model container [2024-11-19 01:13:07,964 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:13:07" (3/3) ... [2024-11-19 01:13:07,965 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-95.i [2024-11-19 01:13:07,982 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:13:07,983 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:13:08,038 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:13:08,044 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;@38587756, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:13:08,045 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:13:08,049 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-19 01:13:08,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 01:13:08,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:13:08,065 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-19 01:13:08,066 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:13:08,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:13:08,071 INFO L85 PathProgramCache]: Analyzing trace with hash 710017665, now seen corresponding path program 1 times [2024-11-19 01:13:08,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:13:08,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537396838] [2024-11-19 01:13:08,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:08,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:13:08,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:08,516 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-19 01:13:08,518 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:13:08,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537396838] [2024-11-19 01:13:08,519 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537396838] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:13:08,519 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [76937833] [2024-11-19 01:13:08,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:08,520 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:13:08,520 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:13:08,522 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-19 01:13:08,523 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-19 01:13:08,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:08,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:13:08,767 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:13:08,800 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-19 01:13:08,801 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:13:08,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [76937833] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:13:08,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:13:08,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 01:13:08,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994382010] [2024-11-19 01:13:08,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:13:08,810 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:13:08,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:13:08,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:13:08,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:13:08,839 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-19 01:13:08,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:13:08,874 INFO L93 Difference]: Finished difference Result 221 states and 344 transitions. [2024-11-19 01:13:08,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:13:08,877 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-19 01:13:08,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:13:08,884 INFO L225 Difference]: With dead ends: 221 [2024-11-19 01:13:08,884 INFO L226 Difference]: Without dead ends: 110 [2024-11-19 01:13:08,886 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-19 01:13:08,889 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-19 01:13:08,890 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-19 01:13:08,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-19 01:13:08,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-19 01:13:08,926 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-19 01:13:08,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 156 transitions. [2024-11-19 01:13:08,930 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 156 transitions. Word has length 132 [2024-11-19 01:13:08,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:13:08,930 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 156 transitions. [2024-11-19 01:13:08,931 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-19 01:13:08,931 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 156 transitions. [2024-11-19 01:13:08,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 01:13:08,934 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:13:08,934 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-19 01:13:08,948 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-19 01:13:09,134 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-19 01:13:09,135 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:13:09,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:13:09,136 INFO L85 PathProgramCache]: Analyzing trace with hash 373116069, now seen corresponding path program 1 times [2024-11-19 01:13:09,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:13:09,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [160952856] [2024-11-19 01:13:09,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:09,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:13:09,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:09,488 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-19 01:13:09,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:13:09,489 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [160952856] [2024-11-19 01:13:09,489 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [160952856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:13:09,489 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:13:09,489 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:13:09,489 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288661931] [2024-11-19 01:13:09,490 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:13:09,491 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:13:09,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:13:09,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:13:09,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:13:09,492 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-19 01:13:09,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:13:09,554 INFO L93 Difference]: Finished difference Result 219 states and 312 transitions. [2024-11-19 01:13:09,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:13:09,555 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-19 01:13:09,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:13:09,556 INFO L225 Difference]: With dead ends: 219 [2024-11-19 01:13:09,556 INFO L226 Difference]: Without dead ends: 112 [2024-11-19 01:13:09,557 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-19 01:13:09,558 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-19 01:13:09,559 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-19 01:13:09,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-19 01:13:09,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2024-11-19 01:13:09,569 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-19 01:13:09,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 158 transitions. [2024-11-19 01:13:09,571 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 158 transitions. Word has length 132 [2024-11-19 01:13:09,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:13:09,572 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 158 transitions. [2024-11-19 01:13:09,573 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-19 01:13:09,573 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 158 transitions. [2024-11-19 01:13:09,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 01:13:09,575 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:13:09,575 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-19 01:13:09,576 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:13:09,576 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:13:09,576 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:13:09,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1411700643, now seen corresponding path program 1 times [2024-11-19 01:13:09,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:13:09,577 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929969694] [2024-11-19 01:13:09,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:09,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:13:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:09,849 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-19 01:13:09,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:13:09,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929969694] [2024-11-19 01:13:09,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929969694] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:13:09,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:13:09,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:13:09,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144365213] [2024-11-19 01:13:09,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:13:09,851 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:13:09,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:13:09,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:13:09,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:13:09,852 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-19 01:13:09,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:13:09,899 INFO L93 Difference]: Finished difference Result 224 states and 317 transitions. [2024-11-19 01:13:09,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:13:09,900 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-19 01:13:09,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:13:09,904 INFO L225 Difference]: With dead ends: 224 [2024-11-19 01:13:09,905 INFO L226 Difference]: Without dead ends: 115 [2024-11-19 01:13:09,905 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-19 01:13:09,909 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-19 01:13:09,909 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-19 01:13:09,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-19 01:13:09,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-19 01:13:09,924 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-19 01:13:09,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 160 transitions. [2024-11-19 01:13:09,928 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 160 transitions. Word has length 132 [2024-11-19 01:13:09,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:13:09,929 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 160 transitions. [2024-11-19 01:13:09,929 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-19 01:13:09,930 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 160 transitions. [2024-11-19 01:13:09,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2024-11-19 01:13:09,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:13:09,935 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-19 01:13:09,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:13:09,935 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:13:09,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:13:09,936 INFO L85 PathProgramCache]: Analyzing trace with hash 1413547685, now seen corresponding path program 1 times [2024-11-19 01:13:09,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:13:09,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291193637] [2024-11-19 01:13:09,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:09,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:13:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:10,640 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-19 01:13:10,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:13:10,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291193637] [2024-11-19 01:13:10,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291193637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:13:10,641 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:13:10,641 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:13:10,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185853919] [2024-11-19 01:13:10,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:13:10,642 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:13:10,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:13:10,643 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:13:10,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:13:10,643 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-19 01:13:10,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:13:10,863 INFO L93 Difference]: Finished difference Result 226 states and 318 transitions. [2024-11-19 01:13:10,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:13:10,864 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-19 01:13:10,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:13:10,865 INFO L225 Difference]: With dead ends: 226 [2024-11-19 01:13:10,867 INFO L226 Difference]: Without dead ends: 115 [2024-11-19 01:13:10,868 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-19 01:13:10,869 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 62 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:13:10,870 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.2s Time] [2024-11-19 01:13:10,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2024-11-19 01:13:10,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 114. [2024-11-19 01:13:10,882 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-19 01:13:10,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 159 transitions. [2024-11-19 01:13:10,885 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 159 transitions. Word has length 132 [2024-11-19 01:13:10,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:13:10,886 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 159 transitions. [2024-11-19 01:13:10,886 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-19 01:13:10,886 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 159 transitions. [2024-11-19 01:13:10,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2024-11-19 01:13:10,889 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:13:10,889 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-19 01:13:10,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:13:10,890 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:13:10,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:13:10,890 INFO L85 PathProgramCache]: Analyzing trace with hash -532592928, now seen corresponding path program 1 times [2024-11-19 01:13:10,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:13:10,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741875485] [2024-11-19 01:13:10,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:10,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:13:11,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:12,794 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-19 01:13:12,796 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:13:12,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741875485] [2024-11-19 01:13:12,796 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741875485] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:13:12,796 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1728970516] [2024-11-19 01:13:12,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:12,797 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:13:12,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:13:12,798 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-19 01:13:12,801 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-19 01:13:13,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:13,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-19 01:13:13,668 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:13:13,755 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-19 01:13:13,831 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-19 01:13:13,881 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-19 01:13:13,934 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-19 01:13:14,010 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-19 01:13:14,076 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-19 01:13:14,149 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:13:14,150 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-19 01:13:14,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:13:14,273 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-19 01:13:14,305 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-19 01:13:14,306 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:13:14,690 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-19 01:13:14,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1728970516] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 01:13:14,691 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 01:13:14,691 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 8] total 20 [2024-11-19 01:13:14,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26481217] [2024-11-19 01:13:14,692 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 01:13:14,692 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-19 01:13:14,692 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:13:14,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-19 01:13:14,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=296, Unknown=0, NotChecked=0, Total=380 [2024-11-19 01:13:14,696 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-19 01:13:16,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:13:16,122 INFO L93 Difference]: Finished difference Result 264 states and 365 transitions. [2024-11-19 01:13:16,123 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-19 01:13:16,123 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-19 01:13:16,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:13:16,125 INFO L225 Difference]: With dead ends: 264 [2024-11-19 01:13:16,125 INFO L226 Difference]: Without dead ends: 153 [2024-11-19 01:13:16,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 300 GetRequests, 267 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 194 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=254, Invalid=936, Unknown=0, NotChecked=0, Total=1190 [2024-11-19 01:13:16,127 INFO L432 NwaCegarLoop]: 96 mSDtfsCounter, 362 mSDsluCounter, 638 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 80 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s 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, 1.1s IncrementalHoareTripleChecker+Time [2024-11-19 01:13:16,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [362 Valid, 734 Invalid, 1101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [80 Valid, 1021 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-19 01:13:16,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-19 01:13:16,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 148. [2024-11-19 01:13:16,141 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-19 01:13:16,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 203 transitions. [2024-11-19 01:13:16,143 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 203 transitions. Word has length 134 [2024-11-19 01:13:16,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:13:16,144 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 203 transitions. [2024-11-19 01:13:16,144 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-19 01:13:16,145 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 203 transitions. [2024-11-19 01:13:16,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-19 01:13:16,146 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:13:16,146 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-19 01:13:16,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 01:13:16,347 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-19 01:13:16,347 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:13:16,348 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:13:16,348 INFO L85 PathProgramCache]: Analyzing trace with hash 2017461842, now seen corresponding path program 1 times [2024-11-19 01:13:16,348 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:13:16,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1658410177] [2024-11-19 01:13:16,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:16,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:13:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:17,619 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-19 01:13:17,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:13:17,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1658410177] [2024-11-19 01:13:17,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1658410177] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:13:17,620 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:13:17,620 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 01:13:17,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100302434] [2024-11-19 01:13:17,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:13:17,621 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 01:13:17,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:13:17,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 01:13:17,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:13:17,623 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-19 01:13:18,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:13:18,306 INFO L93 Difference]: Finished difference Result 359 states and 487 transitions. [2024-11-19 01:13:18,307 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:13:18,307 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-19 01:13:18,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:13:18,309 INFO L225 Difference]: With dead ends: 359 [2024-11-19 01:13:18,311 INFO L226 Difference]: Without dead ends: 238 [2024-11-19 01:13:18,312 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-19 01:13:18,312 INFO L432 NwaCegarLoop]: 92 mSDtfsCounter, 202 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:13:18,314 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.6s Time] [2024-11-19 01:13:18,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2024-11-19 01:13:18,330 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 187. [2024-11-19 01:13:18,331 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-19 01:13:18,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 254 transitions. [2024-11-19 01:13:18,332 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 254 transitions. Word has length 135 [2024-11-19 01:13:18,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:13:18,333 INFO L471 AbstractCegarLoop]: Abstraction has 187 states and 254 transitions. [2024-11-19 01:13:18,333 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-19 01:13:18,333 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 254 transitions. [2024-11-19 01:13:18,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-19 01:13:18,334 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:13:18,335 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-19 01:13:18,335 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 01:13:18,335 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:13:18,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:13:18,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1696575056, now seen corresponding path program 1 times [2024-11-19 01:13:18,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:13:18,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1744567944] [2024-11-19 01:13:18,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:18,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:13:18,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 01:13:18,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [259074643] [2024-11-19 01:13:18,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:18,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:13:18,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:13:18,490 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-19 01:13:18,493 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-19 01:13:19,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:13:19,879 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:13:20,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:13:20,535 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:13:20,536 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:13:20,537 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 01:13:20,555 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 01:13:20,739 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-19 01:13:20,742 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2024-11-19 01:13:20,822 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:13:20,825 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:13:20 BoogieIcfgContainer [2024-11-19 01:13:20,826 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:13:20,826 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:13:20,826 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:13:20,827 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:13:20,827 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:13:07" (3/4) ... [2024-11-19 01:13:20,829 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 01:13:20,830 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:13:20,831 INFO L158 Benchmark]: Toolchain (without parser) took 14288.26ms. Allocated memory was 153.1MB in the beginning and 371.2MB in the end (delta: 218.1MB). Free memory was 98.8MB in the beginning and 264.8MB in the end (delta: -166.1MB). Peak memory consumption was 53.8MB. Max. memory is 16.1GB. [2024-11-19 01:13:20,831 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 153.1MB. Free memory is still 112.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:13:20,831 INFO L158 Benchmark]: CACSL2BoogieTranslator took 354.24ms. Allocated memory is still 153.1MB. Free memory was 98.8MB in the beginning and 80.0MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-19 01:13:20,832 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.55ms. Allocated memory is still 153.1MB. Free memory was 80.0MB in the beginning and 75.4MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:13:20,832 INFO L158 Benchmark]: Boogie Preprocessor took 115.03ms. Allocated memory is still 153.1MB. Free memory was 75.4MB in the beginning and 71.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:13:20,832 INFO L158 Benchmark]: RCFGBuilder took 864.73ms. Allocated memory was 153.1MB in the beginning and 211.8MB in the end (delta: 58.7MB). Free memory was 71.2MB in the beginning and 156.3MB in the end (delta: -85.1MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. [2024-11-19 01:13:20,832 INFO L158 Benchmark]: TraceAbstraction took 12869.32ms. Allocated memory was 211.8MB in the beginning and 371.2MB in the end (delta: 159.4MB). Free memory was 155.2MB in the beginning and 265.9MB in the end (delta: -110.7MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. [2024-11-19 01:13:20,832 INFO L158 Benchmark]: Witness Printer took 4.24ms. Allocated memory is still 371.2MB. Free memory was 265.9MB in the beginning and 264.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:13:20,838 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.19ms. Allocated memory is still 153.1MB. Free memory is still 112.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 354.24ms. Allocated memory is still 153.1MB. Free memory was 98.8MB in the beginning and 80.0MB in the end (delta: 18.7MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.55ms. Allocated memory is still 153.1MB. Free memory was 80.0MB in the beginning and 75.4MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 115.03ms. Allocated memory is still 153.1MB. Free memory was 75.4MB in the beginning and 71.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 864.73ms. Allocated memory was 153.1MB in the beginning and 211.8MB in the end (delta: 58.7MB). Free memory was 71.2MB in the beginning and 156.3MB in the end (delta: -85.1MB). Peak memory consumption was 24.0MB. Max. memory is 16.1GB. * TraceAbstraction took 12869.32ms. Allocated memory was 211.8MB in the beginning and 371.2MB in the end (delta: 159.4MB). Free memory was 155.2MB in the beginning and 265.9MB in the end (delta: -110.7MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. * Witness Printer took 4.24ms. Allocated memory is still 371.2MB. Free memory was 265.9MB in the beginning and 264.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: 12.7s, OverallIterations: 7, TraceHistogramMax: 16, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 627 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 627 mSDsluCounter, 2557 SdHoareTripleChecker+Invalid, 1.7s 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.8s 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, 2.4s SatisfiabilityAnalysisTime, 5.3s 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-19 01:13:20,883 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/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_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-3061b6d-m [2024-11-19 01:13:23,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:13:23,166 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 01:13:23,173 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:13:23,174 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:13:23,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:13:23,210 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:13:23,211 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:13:23,211 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:13:23,212 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:13:23,214 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:13:23,214 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:13:23,215 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:13:23,215 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:13:23,215 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:13:23,216 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:13:23,216 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:13:23,216 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:13:23,217 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:13:23,217 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:13:23,218 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:13:23,218 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:13:23,218 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:13:23,219 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 01:13:23,219 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 01:13:23,219 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:13:23,220 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 01:13:23,220 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:13:23,221 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:13:23,221 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:13:23,221 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:13:23,222 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:13:23,222 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:13:23,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:13:23,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:13:23,223 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:13:23,223 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:13:23,223 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:13:23,223 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 01:13:23,224 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 01:13:23,224 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:13:23,226 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:13:23,226 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:13:23,226 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:13:23,227 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-19 01:13:23,570 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:13:23,598 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:13:23,602 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:13:23,604 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:13:23,604 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:13:23,606 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-19 01:13:25,059 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:13:25,306 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:13:25,307 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-95.i [2024-11-19 01:13:25,316 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b37843d7e/d2a3839b7734499c975d945ca718bd01/FLAGabb6a3077 [2024-11-19 01:13:25,663 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b37843d7e/d2a3839b7734499c975d945ca718bd01 [2024-11-19 01:13:25,665 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:13:25,666 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:13:25,667 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:13:25,667 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:13:25,673 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:13:25,674 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:13:25" (1/1) ... [2024-11-19 01:13:25,675 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@422dac9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:25, skipping insertion in model container [2024-11-19 01:13:25,675 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:13:25" (1/1) ... [2024-11-19 01:13:25,699 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:13:25,894 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-19 01:13:25,976 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:13:25,993 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:13:26,021 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-19 01:13:26,051 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:13:26,074 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:13:26,075 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:26 WrapperNode [2024-11-19 01:13:26,075 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:13:26,076 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:13:26,076 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:13:26,076 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:13:26,083 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:26" (1/1) ... [2024-11-19 01:13:26,109 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:26" (1/1) ... [2024-11-19 01:13:26,158 INFO L138 Inliner]: procedures = 37, calls = 149, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 443 [2024-11-19 01:13:26,159 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:13:26,159 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:13:26,159 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:13:26,159 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:13:26,171 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:26" (1/1) ... [2024-11-19 01:13:26,172 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:26" (1/1) ... [2024-11-19 01:13:26,181 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:26" (1/1) ... [2024-11-19 01:13:26,210 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-19 01:13:26,213 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:26" (1/1) ... [2024-11-19 01:13:26,213 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:26" (1/1) ... [2024-11-19 01:13:26,232 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:26" (1/1) ... [2024-11-19 01:13:26,237 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:26" (1/1) ... [2024-11-19 01:13:26,240 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:26" (1/1) ... [2024-11-19 01:13:26,246 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:26" (1/1) ... [2024-11-19 01:13:26,253 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:13:26,253 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:13:26,254 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:13:26,254 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:13:26,254 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:26" (1/1) ... [2024-11-19 01:13:26,261 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:13:26,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:13:26,287 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-19 01:13:26,292 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-19 01:13:26,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:13:26,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 01:13:26,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 01:13:26,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 01:13:26,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 01:13:26,342 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-19 01:13:26,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-19 01:13:26,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 01:13:26,343 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 01:13:26,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 01:13:26,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 01:13:26,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-19 01:13:26,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-19 01:13:26,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-19 01:13:26,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-19 01:13:26,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-19 01:13:26,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-19 01:13:26,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-19 01:13:26,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-19 01:13:26,346 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:13:26,346 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:13:26,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-19 01:13:26,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-19 01:13:26,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:13:26,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:13:26,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 01:13:26,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 01:13:26,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 01:13:26,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 01:13:26,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 01:13:26,348 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 01:13:26,509 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:13:26,511 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:13:28,093 INFO L? ?]: Removed 108 outVars from TransFormulas that were not future-live. [2024-11-19 01:13:28,093 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:13:28,112 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:13:28,113 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:13:28,114 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:13:28 BoogieIcfgContainer [2024-11-19 01:13:28,114 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:13:28,116 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:13:28,116 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:13:28,120 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:13:28,120 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:13:25" (1/3) ... [2024-11-19 01:13:28,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5069ba5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:13:28, skipping insertion in model container [2024-11-19 01:13:28,121 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:26" (2/3) ... [2024-11-19 01:13:28,121 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5069ba5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:13:28, skipping insertion in model container [2024-11-19 01:13:28,122 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:13:28" (3/3) ... [2024-11-19 01:13:28,123 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-95.i [2024-11-19 01:13:28,140 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:13:28,141 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:13:28,204 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:13:28,210 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;@5cc05716, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:13:28,210 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:13:28,213 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-19 01:13:28,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 01:13:28,225 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:13:28,226 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-19 01:13:28,226 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:13:28,251 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:13:28,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1308038037, now seen corresponding path program 1 times [2024-11-19 01:13:28,267 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:13:28,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1092785599] [2024-11-19 01:13:28,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:28,268 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-19 01:13:28,269 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:13:28,272 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-19 01:13:28,273 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-19 01:13:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:28,748 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:13:28,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:13:28,793 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-19 01:13:28,794 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:13:28,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:13:28,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1092785599] [2024-11-19 01:13:28,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1092785599] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:13:28,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:13:28,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:13:28,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87078328] [2024-11-19 01:13:28,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:13:28,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:13:28,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:13:28,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:13:28,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:13:28,826 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-19 01:13:28,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:13:28,863 INFO L93 Difference]: Finished difference Result 199 states and 310 transitions. [2024-11-19 01:13:28,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:13:28,866 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-19 01:13:28,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:13:28,874 INFO L225 Difference]: With dead ends: 199 [2024-11-19 01:13:28,874 INFO L226 Difference]: Without dead ends: 99 [2024-11-19 01:13:28,878 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-19 01:13:28,881 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-19 01:13:28,882 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-19 01:13:28,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-11-19 01:13:28,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-11-19 01:13:28,926 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-19 01:13:28,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 139 transitions. [2024-11-19 01:13:28,930 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 139 transitions. Word has length 129 [2024-11-19 01:13:28,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:13:28,931 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 139 transitions. [2024-11-19 01:13:28,931 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-19 01:13:28,931 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 139 transitions. [2024-11-19 01:13:28,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 01:13:28,935 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:13:28,935 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-19 01:13:28,948 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-19 01:13:29,135 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-19 01:13:29,136 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:13:29,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:13:29,137 INFO L85 PathProgramCache]: Analyzing trace with hash 1652192455, now seen corresponding path program 1 times [2024-11-19 01:13:29,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:13:29,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113706181] [2024-11-19 01:13:29,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:29,139 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-19 01:13:29,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:13:29,143 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-19 01:13:29,144 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-19 01:13:29,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:29,572 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 01:13:29,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:13:29,652 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-19 01:13:29,655 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:13:29,656 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:13:29,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113706181] [2024-11-19 01:13:29,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113706181] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:13:29,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:13:29,656 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:13:29,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [72878769] [2024-11-19 01:13:29,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:13:29,659 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:13:29,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:13:29,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:13:29,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:13:29,661 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-19 01:13:30,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:13:30,046 INFO L93 Difference]: Finished difference Result 202 states and 285 transitions. [2024-11-19 01:13:30,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:13:30,046 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-19 01:13:30,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:13:30,051 INFO L225 Difference]: With dead ends: 202 [2024-11-19 01:13:30,051 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 01:13:30,052 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-19 01:13:30,054 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.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:13:30,055 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.4s Time] [2024-11-19 01:13:30,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 01:13:30,065 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-19 01:13:30,065 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-19 01:13:30,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 145 transitions. [2024-11-19 01:13:30,067 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 145 transitions. Word has length 129 [2024-11-19 01:13:30,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:13:30,069 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 145 transitions. [2024-11-19 01:13:30,069 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-19 01:13:30,069 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 145 transitions. [2024-11-19 01:13:30,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-19 01:13:30,071 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:13:30,071 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-19 01:13:30,087 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 (3)] Forceful destruction successful, exit code 0 [2024-11-19 01:13:30,272 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-19 01:13:30,272 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:13:30,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:13:30,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1654039497, now seen corresponding path program 1 times [2024-11-19 01:13:30,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:13:30,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1338088261] [2024-11-19 01:13:30,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:30,279 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-19 01:13:30,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:13:30,282 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-19 01:13:30,283 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-19 01:13:30,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:30,666 INFO L255 TraceCheckSpWp]: Trace formula consists of 271 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:13:30,676 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:13:30,835 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-19 01:13:30,937 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-19 01:13:30,938 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:13:30,938 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:13:30,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1338088261] [2024-11-19 01:13:30,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1338088261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:13:30,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:13:30,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:13:30,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663953125] [2024-11-19 01:13:30,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:13:30,943 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:13:30,943 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:13:30,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:13:30,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:13:30,944 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-19 01:13:32,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:13:32,271 INFO L93 Difference]: Finished difference Result 208 states and 288 transitions. [2024-11-19 01:13:32,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:13:32,272 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-19 01:13:32,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:13:32,273 INFO L225 Difference]: With dead ends: 208 [2024-11-19 01:13:32,273 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 01:13:32,274 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 124 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-19 01:13:32,275 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 133 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s 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.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:13:32,276 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.3s Time] [2024-11-19 01:13:32,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 01:13:32,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-19 01:13:32,285 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-19 01:13:32,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 144 transitions. [2024-11-19 01:13:32,286 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 144 transitions. Word has length 129 [2024-11-19 01:13:32,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:13:32,287 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 144 transitions. [2024-11-19 01:13:32,287 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-19 01:13:32,287 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 144 transitions. [2024-11-19 01:13:32,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2024-11-19 01:13:32,290 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:13:32,290 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-19 01:13:32,304 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-19 01:13:32,490 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-19 01:13:32,491 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:13:32,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:13:32,492 INFO L85 PathProgramCache]: Analyzing trace with hash -1320083773, now seen corresponding path program 1 times [2024-11-19 01:13:32,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:13:32,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [824481562] [2024-11-19 01:13:32,493 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:32,493 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-19 01:13:32,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:13:32,496 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-19 01:13:32,497 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-19 01:13:32,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:32,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:13:32,876 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:13:32,961 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-19 01:13:32,986 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-19 01:13:32,987 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:13:32,987 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:13:32,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [824481562] [2024-11-19 01:13:32,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [824481562] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:13:32,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:13:32,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:13:32,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444703437] [2024-11-19 01:13:32,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:13:32,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:13:32,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:13:32,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:13:32,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:13:32,990 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-19 01:13:34,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:13:34,241 INFO L93 Difference]: Finished difference Result 208 states and 286 transitions. [2024-11-19 01:13:34,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:13:34,242 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-19 01:13:34,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:13:34,243 INFO L225 Difference]: With dead ends: 208 [2024-11-19 01:13:34,243 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 01:13:34,244 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-19 01:13:34,245 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 122 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s 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.2s IncrementalHoareTripleChecker+Time [2024-11-19 01:13:34,246 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.2s Time] [2024-11-19 01:13:34,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 01:13:34,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-19 01:13:34,257 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-19 01:13:34,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 143 transitions. [2024-11-19 01:13:34,258 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 143 transitions. Word has length 131 [2024-11-19 01:13:34,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:13:34,259 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 143 transitions. [2024-11-19 01:13:34,259 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-19 01:13:34,259 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 143 transitions. [2024-11-19 01:13:34,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2024-11-19 01:13:34,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:13:34,261 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-19 01:13:34,278 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-19 01:13:34,461 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-19 01:13:34,462 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:13:34,462 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:13:34,463 INFO L85 PathProgramCache]: Analyzing trace with hash 80331145, now seen corresponding path program 1 times [2024-11-19 01:13:34,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:13:34,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2043107917] [2024-11-19 01:13:34,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:34,464 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-19 01:13:34,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:13:34,467 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-19 01:13:34,468 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-19 01:13:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:34,845 INFO L255 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:13:34,849 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:13:34,933 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-19 01:13:34,959 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-19 01:13:34,959 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:13:34,960 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:13:34,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2043107917] [2024-11-19 01:13:34,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2043107917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:13:34,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:13:34,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:13:34,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1666791432] [2024-11-19 01:13:34,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:13:34,961 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:13:34,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:13:34,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:13:34,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:13:34,962 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-19 01:13:36,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:13:36,437 INFO L93 Difference]: Finished difference Result 208 states and 284 transitions. [2024-11-19 01:13:36,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:13:36,438 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-19 01:13:36,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:13:36,439 INFO L225 Difference]: With dead ends: 208 [2024-11-19 01:13:36,439 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 01:13:36,440 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 135 GetRequests, 128 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-19 01:13:36,441 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 113 mSDsluCounter, 267 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s 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.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:13:36,441 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.4s Time] [2024-11-19 01:13:36,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 01:13:36,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 105. [2024-11-19 01:13:36,448 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-19 01:13:36,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 142 transitions. [2024-11-19 01:13:36,449 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 142 transitions. Word has length 133 [2024-11-19 01:13:36,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:13:36,450 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 142 transitions. [2024-11-19 01:13:36,450 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-19 01:13:36,450 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 142 transitions. [2024-11-19 01:13:36,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2024-11-19 01:13:36,452 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:13:36,452 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-19 01:13:36,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-19 01:13:36,652 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-19 01:13:36,653 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:13:36,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:13:36,654 INFO L85 PathProgramCache]: Analyzing trace with hash 616356483, now seen corresponding path program 1 times [2024-11-19 01:13:36,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:13:36,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026333656] [2024-11-19 01:13:36,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:36,655 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-19 01:13:36,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:13:36,658 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-19 01:13:36,661 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-19 01:13:37,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:37,173 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-19 01:13:37,183 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:13:37,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:37,194 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:37,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:37,197 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:37,198 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 01:13:37,199 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:37,200 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:37,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:37,202 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:37,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:37,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:37,206 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:37,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:37,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:37,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:37,210 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:37,211 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:37,212 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:37,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:37,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:37,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:37,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:37,218 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:37,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:37,220 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:37,221 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:37,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:37,224 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:37,256 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-19 01:13:37,591 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:13:37,591 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-19 01:13:37,685 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-19 01:13:37,828 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-19 01:13:37,923 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-19 01:13:38,165 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:13:38,165 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-19 01:13:38,466 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:13:38,467 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-19 01:13:38,824 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:13:38,825 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-19 01:13:39,088 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-19 01:13:39,211 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:13:39,212 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-19 01:13:39,252 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-19 01:13:39,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:13:39,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:13:39,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026333656] [2024-11-19 01:13:39,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026333656] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:13:39,446 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2043266538] [2024-11-19 01:13:39,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:39,447 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 01:13:39,448 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 01:13:39,450 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-19 01:13:39,452 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-19 01:13:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:40,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-19 01:13:40,845 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:13:41,085 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-19 01:13:41,151 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-19 01:13:41,182 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:13:41,182 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-19 01:13:41,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:13:41,271 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-19 01:13:41,314 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-19 01:13:41,314 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:13:41,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2043266538] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:13:41,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:13:41,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 15 [2024-11-19 01:13:41,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708648750] [2024-11-19 01:13:41,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:13:41,316 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:13:41,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:13:41,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:13:41,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=288, Unknown=0, NotChecked=0, Total=342 [2024-11-19 01:13:41,320 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-19 01:13:42,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:13:42,955 INFO L93 Difference]: Finished difference Result 240 states and 324 transitions. [2024-11-19 01:13:42,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:13:42,956 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-19 01:13:42,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:13:42,958 INFO L225 Difference]: With dead ends: 240 [2024-11-19 01:13:42,958 INFO L226 Difference]: Without dead ends: 138 [2024-11-19 01:13:42,959 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=66, Invalid=354, Unknown=0, NotChecked=0, Total=420 [2024-11-19 01:13:42,959 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 181 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:13:42,960 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.6s Time] [2024-11-19 01:13:42,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-11-19 01:13:42,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 103. [2024-11-19 01:13:42,968 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-19 01:13:42,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 139 transitions. [2024-11-19 01:13:42,969 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 139 transitions. Word has length 135 [2024-11-19 01:13:42,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:13:42,969 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 139 transitions. [2024-11-19 01:13:42,970 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-19 01:13:42,970 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 139 transitions. [2024-11-19 01:13:42,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2024-11-19 01:13:42,971 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:13:42,971 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-19 01:13:42,988 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-19 01:13:43,184 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2024-11-19 01:13:43,372 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-19 01:13:43,372 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:13:43,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:13:43,373 INFO L85 PathProgramCache]: Analyzing trace with hash -733443842, now seen corresponding path program 1 times [2024-11-19 01:13:43,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:13:43,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1143226780] [2024-11-19 01:13:43,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:43,374 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-19 01:13:43,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:13:43,375 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-19 01:13:43,376 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-19 01:13:44,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:44,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-19 01:13:44,047 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:13:44,053 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:44,054 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:44,055 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:44,056 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 01:13:44,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:44,057 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:44,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:44,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:44,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:44,060 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:44,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:44,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:44,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:44,063 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:44,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:44,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:44,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:44,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:44,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:44,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:44,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:44,075 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-19 01:13:44,266 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:13:44,267 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-19 01:13:44,346 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-19 01:13:44,456 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-19 01:13:44,640 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:13:44,641 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-19 01:13:44,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:13:44,864 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-19 01:13:45,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:13:45,038 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-19 01:13:45,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:13:45,262 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-19 01:13:45,455 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-19 01:13:45,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:13:45,542 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-19 01:13:45,578 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-19 01:13:45,578 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:13:45,790 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:13:45,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1143226780] [2024-11-19 01:13:45,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1143226780] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:13:45,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1234317119] [2024-11-19 01:13:45,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:45,790 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-19 01:13:45,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-19 01:13:45,791 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-19 01:13:45,793 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-19 01:13:47,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:47,527 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-19 01:13:47,533 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:13:47,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:47,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:47,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:47,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:47,544 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 01:13:47,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:47,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:47,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:47,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:47,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:47,550 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:47,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:47,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:47,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:47,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:47,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:47,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:47,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:47,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:47,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:47,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:47,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:47,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:47,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:47,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:47,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:47,567 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:47,568 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:13:47,574 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-19 01:13:47,737 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:13:47,738 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-19 01:13:47,870 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-19 01:13:48,074 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-19 01:13:48,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:13:48,233 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-19 01:13:48,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:13:48,439 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-19 01:13:48,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:13:48,625 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-19 01:13:48,909 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:13:48,909 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-19 01:13:49,105 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-19 01:13:49,207 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-19 01:13:49,296 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-19 01:13:49,296 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:13:49,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1234317119] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:13:49,538 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 01:13:49,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2024-11-19 01:13:49,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299653351] [2024-11-19 01:13:49,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 01:13:49,540 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-19 01:13:49,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:13:49,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-19 01:13:49,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=713, Unknown=0, NotChecked=0, Total=870 [2024-11-19 01:13:49,542 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-19 01:13:55,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:13:55,827 INFO L93 Difference]: Finished difference Result 348 states and 461 transitions. [2024-11-19 01:13:55,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 01:13:55,828 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-19 01:13:55,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:13:55,830 INFO L225 Difference]: With dead ends: 348 [2024-11-19 01:13:55,830 INFO L226 Difference]: Without dead ends: 248 [2024-11-19 01:13:55,831 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 301 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=330, Invalid=1310, Unknown=0, NotChecked=0, Total=1640 [2024-11-19 01:13:55,831 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 584 mSDsluCounter, 675 mSDsCounter, 0 mSdLazyCounter, 1206 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s 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, 5.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:13:55,832 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [585 Valid, 753 Invalid, 1309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 1206 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-11-19 01:13:55,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 248 states. [2024-11-19 01:13:55,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 248 to 239. [2024-11-19 01:13:55,853 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-19 01:13:55,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 239 states to 239 states and 316 transitions. [2024-11-19 01:13:55,854 INFO L78 Accepts]: Start accepts. Automaton has 239 states and 316 transitions. Word has length 137 [2024-11-19 01:13:55,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:13:55,855 INFO L471 AbstractCegarLoop]: Abstraction has 239 states and 316 transitions. [2024-11-19 01:13:55,855 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-19 01:13:55,855 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 316 transitions. [2024-11-19 01:13:55,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2024-11-19 01:13:55,857 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:13:55,857 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-19 01:13:55,874 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 (9)] Ended with exit code 0 [2024-11-19 01:13:56,074 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-19 01:13:56,258 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-19 01:13:56,258 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:13:56,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:13:56,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1997671237, now seen corresponding path program 1 times [2024-11-19 01:13:56,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:13:56,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330012658] [2024-11-19 01:13:56,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:56,259 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-19 01:13:56,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:13:56,260 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-19 01:13:56,261 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