./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-98.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-98.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 1ba7c929f0e6efd0a397d94adaa69f0d7bd63f2d787023196b790a71b229b8df --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:13:16,385 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:13:16,477 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:16,481 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:13:16,482 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:13:16,512 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:13:16,513 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:13:16,513 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:13:16,514 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:13:16,515 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:13:16,515 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:13:16,515 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:13:16,516 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:13:16,519 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:13:16,519 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:13:16,519 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:13:16,520 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:13:16,520 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:13:16,520 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:13:16,520 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:13:16,521 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:13:16,525 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:13:16,525 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:13:16,525 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:13:16,526 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:13:16,526 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:13:16,526 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:13:16,526 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:13:16,527 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:13:16,527 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:13:16,527 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:13:16,527 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:13:16,527 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:13:16,528 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:13:16,528 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:13:16,528 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:13:16,528 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:13:16,529 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:13:16,529 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:13:16,529 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:13:16,529 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:13:16,530 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:13:16,531 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 -> 1ba7c929f0e6efd0a397d94adaa69f0d7bd63f2d787023196b790a71b229b8df [2024-11-19 01:13:16,827 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:13:16,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:13:16,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:13:16,854 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:13:16,854 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:13:16,855 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-98.i [2024-11-19 01:13:18,350 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:13:18,554 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:13:18,555 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-98.i [2024-11-19 01:13:18,573 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/697129470/30e85fc6da004bf08d27929c9c2a6f43/FLAG20143ecbe [2024-11-19 01:13:18,592 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/697129470/30e85fc6da004bf08d27929c9c2a6f43 [2024-11-19 01:13:18,595 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:13:18,597 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:13:18,599 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:13:18,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:13:18,607 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:13:18,608 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:13:18" (1/1) ... [2024-11-19 01:13:18,611 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71e62982 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:18, skipping insertion in model container [2024-11-19 01:13:18,611 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:13:18" (1/1) ... [2024-11-19 01:13:18,644 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:13:18,846 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-98.i[916,929] [2024-11-19 01:13:18,922 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:13:18,936 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:13:18,948 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-98.i[916,929] [2024-11-19 01:13:19,028 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:13:19,088 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:13:19,091 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:19 WrapperNode [2024-11-19 01:13:19,092 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:13:19,094 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:13:19,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:13:19,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:13:19,107 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:19" (1/1) ... [2024-11-19 01:13:19,122 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:19" (1/1) ... [2024-11-19 01:13:19,170 INFO L138 Inliner]: procedures = 30, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 514 [2024-11-19 01:13:19,171 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:13:19,171 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:13:19,172 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:13:19,172 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:13:19,187 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:19" (1/1) ... [2024-11-19 01:13:19,188 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:19" (1/1) ... [2024-11-19 01:13:19,193 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:19" (1/1) ... [2024-11-19 01:13:19,207 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-19 01:13:19,208 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:19" (1/1) ... [2024-11-19 01:13:19,208 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:19" (1/1) ... [2024-11-19 01:13:19,245 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:19" (1/1) ... [2024-11-19 01:13:19,254 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:19" (1/1) ... [2024-11-19 01:13:19,260 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:19" (1/1) ... [2024-11-19 01:13:19,263 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:19" (1/1) ... [2024-11-19 01:13:19,276 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:13:19,277 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:13:19,277 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:13:19,277 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:13:19,282 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:19" (1/1) ... [2024-11-19 01:13:19,297 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:13:19,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:13:19,331 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:19,334 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:19,378 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:13:19,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-19 01:13:19,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-19 01:13:19,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 01:13:19,379 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-19 01:13:19,379 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-19 01:13:19,380 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 01:13:19,380 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:13:19,380 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:13:19,380 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 01:13:19,380 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:13:19,381 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:13:19,516 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:13:19,519 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:13:20,284 INFO L? ?]: Removed 133 outVars from TransFormulas that were not future-live. [2024-11-19 01:13:20,285 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:13:20,304 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:13:20,305 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:13:20,305 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:13:20 BoogieIcfgContainer [2024-11-19 01:13:20,306 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:13:20,308 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:13:20,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:13:20,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:13:20,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:13:18" (1/3) ... [2024-11-19 01:13:20,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70d17059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:13:20, skipping insertion in model container [2024-11-19 01:13:20,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:19" (2/3) ... [2024-11-19 01:13:20,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70d17059 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:13:20, skipping insertion in model container [2024-11-19 01:13:20,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:13:20" (3/3) ... [2024-11-19 01:13:20,315 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-98.i [2024-11-19 01:13:20,333 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:13:20,333 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:13:20,386 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:13:20,395 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;@2e3e416, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:13:20,395 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:13:20,400 INFO L276 IsEmpty]: Start isEmpty. Operand has 123 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 01:13:20,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-19 01:13:20,419 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:13:20,420 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:20,421 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:13:20,426 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:13:20,427 INFO L85 PathProgramCache]: Analyzing trace with hash -137568608, now seen corresponding path program 1 times [2024-11-19 01:13:20,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:13:20,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599987327] [2024-11-19 01:13:20,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:20,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:13:20,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:20,910 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2024-11-19 01:13:20,911 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:13:20,912 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599987327] [2024-11-19 01:13:20,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599987327] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:13:20,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1017171262] [2024-11-19 01:13:20,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:20,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:13:20,914 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:13:20,916 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:20,918 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:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:21,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 496 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:13:21,249 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:13:21,285 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 512 trivial. 0 not checked. [2024-11-19 01:13:21,285 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:13:21,285 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1017171262] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:13:21,286 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:13:21,286 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 01:13:21,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882752256] [2024-11-19 01:13:21,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:13:21,299 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:13:21,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:13:21,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:13:21,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:13:21,330 INFO L87 Difference]: Start difference. First operand has 123 states, 103 states have (on average 1.4271844660194175) internal successors, (147), 104 states have internal predecessors, (147), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-19 01:13:21,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:13:21,377 INFO L93 Difference]: Finished difference Result 239 states and 373 transitions. [2024-11-19 01:13:21,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:13:21,380 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2024-11-19 01:13:21,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:13:21,390 INFO L225 Difference]: With dead ends: 239 [2024-11-19 01:13:21,391 INFO L226 Difference]: Without dead ends: 119 [2024-11-19 01:13:21,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 144 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:21,402 INFO L432 NwaCegarLoop]: 174 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, 174 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:21,404 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 174 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:21,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-19 01:13:21,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-11-19 01:13:21,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 100 states have (on average 1.4) internal successors, (140), 100 states have internal predecessors, (140), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 01:13:21,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 174 transitions. [2024-11-19 01:13:21,461 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 174 transitions. Word has length 143 [2024-11-19 01:13:21,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:13:21,462 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 174 transitions. [2024-11-19 01:13:21,462 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-19 01:13:21,462 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 174 transitions. [2024-11-19 01:13:21,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-19 01:13:21,465 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:13:21,466 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:21,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-19 01:13:21,666 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:21,667 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:13:21,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:13:21,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1966018294, now seen corresponding path program 1 times [2024-11-19 01:13:21,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:13:21,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [416414787] [2024-11-19 01:13:21,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:21,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:13:21,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:22,077 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:13:22,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:13:22,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [416414787] [2024-11-19 01:13:22,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [416414787] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:13:22,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:13:22,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:13:22,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120684577] [2024-11-19 01:13:22,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:13:22,079 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:13:22,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:13:22,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:13:22,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:13:22,084 INFO L87 Difference]: Start difference. First operand 119 states and 174 transitions. Second operand has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-19 01:13:22,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:13:22,152 INFO L93 Difference]: Finished difference Result 237 states and 348 transitions. [2024-11-19 01:13:22,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:13:22,154 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2024-11-19 01:13:22,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:13:22,156 INFO L225 Difference]: With dead ends: 237 [2024-11-19 01:13:22,156 INFO L226 Difference]: Without dead ends: 121 [2024-11-19 01:13:22,157 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:22,160 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 0 mSDsluCounter, 333 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 505 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:22,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 505 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:22,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-19 01:13:22,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-19 01:13:22,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 102 states have (on average 1.392156862745098) internal successors, (142), 102 states have internal predecessors, (142), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 01:13:22,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 176 transitions. [2024-11-19 01:13:22,177 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 176 transitions. Word has length 143 [2024-11-19 01:13:22,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:13:22,179 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 176 transitions. [2024-11-19 01:13:22,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 15.25) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-19 01:13:22,180 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 176 transitions. [2024-11-19 01:13:22,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-19 01:13:22,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:13:22,184 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:22,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:13:22,185 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:13:22,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:13:22,185 INFO L85 PathProgramCache]: Analyzing trace with hash -908180216, now seen corresponding path program 1 times [2024-11-19 01:13:22,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:13:22,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482838879] [2024-11-19 01:13:22,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:22,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:13:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 01:13:22,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1739849075] [2024-11-19 01:13:22,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:22,488 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:13:22,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:13:22,491 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:22,496 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:23,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:13:23,391 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:13:23,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:13:24,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:13:24,149 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:13:24,151 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 01:13:24,175 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:24,359 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-19 01:13:24,363 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-11-19 01:13:24,435 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:13:24,438 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:13:24 BoogieIcfgContainer [2024-11-19 01:13:24,438 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:13:24,439 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:13:24,439 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:13:24,439 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:13:24,440 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:20" (3/4) ... [2024-11-19 01:13:24,444 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 01:13:24,445 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:13:24,446 INFO L158 Benchmark]: Toolchain (without parser) took 5848.96ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 96.4MB in the beginning and 176.4MB in the end (delta: -80.1MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:13:24,449 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 109.1MB. Free memory is still 71.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:13:24,449 INFO L158 Benchmark]: CACSL2BoogieTranslator took 492.97ms. Allocated memory is still 163.6MB. Free memory was 96.2MB in the beginning and 134.6MB in the end (delta: -38.4MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. [2024-11-19 01:13:24,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 76.61ms. Allocated memory is still 163.6MB. Free memory was 134.6MB in the beginning and 131.0MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 01:13:24,450 INFO L158 Benchmark]: Boogie Preprocessor took 104.81ms. Allocated memory is still 163.6MB. Free memory was 131.0MB in the beginning and 126.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:13:24,450 INFO L158 Benchmark]: RCFGBuilder took 1028.90ms. Allocated memory is still 163.6MB. Free memory was 126.8MB in the beginning and 91.2MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-11-19 01:13:24,450 INFO L158 Benchmark]: TraceAbstraction took 4130.73ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 90.5MB in the beginning and 176.4MB in the end (delta: -85.9MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. [2024-11-19 01:13:24,451 INFO L158 Benchmark]: Witness Printer took 6.68ms. Allocated memory is still 222.3MB. Free memory is still 176.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:13:24,454 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.09ms. Allocated memory is still 109.1MB. Free memory is still 71.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 492.97ms. Allocated memory is still 163.6MB. Free memory was 96.2MB in the beginning and 134.6MB in the end (delta: -38.4MB). Peak memory consumption was 20.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 76.61ms. Allocated memory is still 163.6MB. Free memory was 134.6MB in the beginning and 131.0MB in the end (delta: 3.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 104.81ms. Allocated memory is still 163.6MB. Free memory was 131.0MB in the beginning and 126.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1028.90ms. Allocated memory is still 163.6MB. Free memory was 126.8MB in the beginning and 91.2MB in the end (delta: 35.7MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4130.73ms. Allocated memory was 163.6MB in the beginning and 222.3MB in the end (delta: 58.7MB). Free memory was 90.5MB in the beginning and 176.4MB in the end (delta: -85.9MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. * Witness Printer took 6.68ms. Allocated memory is still 222.3MB. Free memory is still 176.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 117, overapproximation of someBinaryArithmeticDOUBLEoperation at line 61. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 4.8, 63.5, 9999999.5, 0.6, 10, -1, 4.4, 7.25, 7.5, 2.3, 128, 0, 4078799264, 500, 25 }; [L57] unsigned long int last_1_WrapperStruct00_var_1_15 = 500; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_15=500] [L121] isInitial = 1 [L122] FCALL initially() [L123] COND TRUE 1 [L124] CALL updateLastVariables() [L114] EXPR WrapperStruct00.var_1_15 [L114] last_1_WrapperStruct00_var_1_15 = WrapperStruct00.var_1_15 [L124] RET updateLastVariables() [L125] CALL updateVariables() [L84] WrapperStruct00.var_1_2 = __VERIFIER_nondet_double() [L85] EXPR WrapperStruct00.var_1_2 [L85] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F [L85] EXPR WrapperStruct00.var_1_2 [L85] EXPR WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L85] EXPR (WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L85] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L85] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= 0.0F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L86] WrapperStruct00.var_1_3 = __VERIFIER_nondet_double() [L87] EXPR WrapperStruct00.var_1_3 [L87] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F [L87] EXPR WrapperStruct00.var_1_3 [L87] EXPR WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L87] EXPR (WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L87] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L87] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= 0.0F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854765600e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L88] WrapperStruct00.var_1_6 = __VERIFIER_nondet_short() [L89] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L89] CALL assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L89] RET assume_abort_if_not(WrapperStruct00.var_1_6 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L90] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L90] CALL assume_abort_if_not(WrapperStruct00.var_1_6 <= 32) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L90] RET assume_abort_if_not(WrapperStruct00.var_1_6 <= 32) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L91] WrapperStruct00.var_1_7 = __VERIFIER_nondet_long() [L92] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L92] CALL assume_abort_if_not(WrapperStruct00.var_1_7 >= -2147483648) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L92] RET assume_abort_if_not(WrapperStruct00.var_1_7 >= -2147483648) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L93] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L93] CALL assume_abort_if_not(WrapperStruct00.var_1_7 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L93] RET assume_abort_if_not(WrapperStruct00.var_1_7 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L94] EXPR WrapperStruct00.var_1_7 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L94] CALL assume_abort_if_not(WrapperStruct00.var_1_7 != 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L94] RET assume_abort_if_not(WrapperStruct00.var_1_7 != 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L95] WrapperStruct00.var_1_8 = __VERIFIER_nondet_double() [L96] EXPR WrapperStruct00.var_1_8 [L96] EXPR WrapperStruct00.var_1_8 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F [L96] EXPR WrapperStruct00.var_1_8 [L96] EXPR WrapperStruct00.var_1_8 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L96] EXPR (WrapperStruct00.var_1_8 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L96] CALL assume_abort_if_not((WrapperStruct00.var_1_8 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L96] RET assume_abort_if_not((WrapperStruct00.var_1_8 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_8 <= -1.0e-20F) || (WrapperStruct00.var_1_8 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_8 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L97] WrapperStruct00.var_1_9 = __VERIFIER_nondet_double() [L98] EXPR WrapperStruct00.var_1_9 [L98] EXPR WrapperStruct00.var_1_9 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F [L98] EXPR WrapperStruct00.var_1_9 [L98] EXPR WrapperStruct00.var_1_9 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L98] EXPR (WrapperStruct00.var_1_9 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L98] CALL assume_abort_if_not((WrapperStruct00.var_1_9 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L98] RET assume_abort_if_not((WrapperStruct00.var_1_9 >= -115292.1504606845700e+13F && WrapperStruct00.var_1_9 <= -1.0e-20F) || (WrapperStruct00.var_1_9 <= 1152921.504606845700e+12F && WrapperStruct00.var_1_9 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L99] WrapperStruct00.var_1_10 = __VERIFIER_nondet_double() [L100] EXPR WrapperStruct00.var_1_10 [L100] EXPR WrapperStruct00.var_1_10 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F [L100] EXPR WrapperStruct00.var_1_10 [L100] EXPR WrapperStruct00.var_1_10 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L100] EXPR (WrapperStruct00.var_1_10 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L100] CALL assume_abort_if_not((WrapperStruct00.var_1_10 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L100] RET assume_abort_if_not((WrapperStruct00.var_1_10 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_10 <= -1.0e-20F) || (WrapperStruct00.var_1_10 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_10 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L101] WrapperStruct00.var_1_11 = __VERIFIER_nondet_double() [L102] EXPR WrapperStruct00.var_1_11 [L102] EXPR WrapperStruct00.var_1_11 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F [L102] EXPR WrapperStruct00.var_1_11 [L102] EXPR WrapperStruct00.var_1_11 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L102] EXPR (WrapperStruct00.var_1_11 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L102] CALL assume_abort_if_not((WrapperStruct00.var_1_11 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L102] RET assume_abort_if_not((WrapperStruct00.var_1_11 >= -230584.3009213691390e+13F && WrapperStruct00.var_1_11 <= -1.0e-20F) || (WrapperStruct00.var_1_11 <= 2305843.009213691390e+12F && WrapperStruct00.var_1_11 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L103] WrapperStruct00.var_1_13 = __VERIFIER_nondet_ulong() [L104] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L105] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L105] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L106] WrapperStruct00.var_1_14 = __VERIFIER_nondet_ulong() [L107] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L108] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967294) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 4294967294) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L109] WrapperStruct00.var_1_16 = __VERIFIER_nondet_ulong() [L110] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L111] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L125] RET updateVariables() [L126] CALL step() [L61] EXPR WrapperStruct00.var_1_2 [L61] EXPR WrapperStruct00.var_1_3 [L61] WrapperStruct00.var_1_1 = (WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3) [L62] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L62] COND FALSE !(((((-128) < (last_1_WrapperStruct00_var_1_15)) ? (-128) : (last_1_WrapperStruct00_var_1_15))) < WrapperStruct00.var_1_13) [L69] EXPR WrapperStruct00.var_1_16 [L69] WrapperStruct00.var_1_15 = WrapperStruct00.var_1_16 [L71] EXPR WrapperStruct00.var_1_15 [L71] EXPR WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L71] EXPR WrapperStruct00.var_1_15 >> WrapperStruct00.var_1_6 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L71] EXPR WrapperStruct00.var_1_7 [L71] unsigned long int stepLocal_0 = (WrapperStruct00.var_1_15 >> WrapperStruct00.var_1_6) / WrapperStruct00.var_1_7; [L72] COND FALSE !(8 < stepLocal_0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L75] EXPR WrapperStruct00.var_1_2 [L75] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L75] COND FALSE !(WrapperStruct00.var_1_2 < WrapperStruct00.var_1_8) [L126] RET step() [L127] CALL, EXPR property() [L117] EXPR WrapperStruct00.var_1_1 [L117] EXPR WrapperStruct00.var_1_2 [L117] EXPR WrapperStruct00.var_1_3 [L117] EXPR (WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3))) && ((8 < ((WrapperStruct00.var_1_15 >> WrapperStruct00.var_1_6) / WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_4 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + ((((WrapperStruct00.var_1_10) < (1.9)) ? (WrapperStruct00.var_1_10) : (1.9)))) + (99.125 + WrapperStruct00.var_1_11)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L117] EXPR ((WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3))) && ((8 < ((WrapperStruct00.var_1_15 >> WrapperStruct00.var_1_6) / WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_4 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + ((((WrapperStruct00.var_1_10) < (1.9)) ? (WrapperStruct00.var_1_10) : (1.9)))) + (99.125 + WrapperStruct00.var_1_11)))) : 1)) && ((WrapperStruct00.var_1_2 < WrapperStruct00.var_1_8) ? ((((- WrapperStruct00.var_1_15) <= WrapperStruct00.var_1_6) || (WrapperStruct00.var_1_4 < WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_12 == ((unsigned long int) ((((WrapperStruct00.var_1_6) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_12 == ((unsigned long int) (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_6)))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L117] EXPR (((WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3))) && ((8 < ((WrapperStruct00.var_1_15 >> WrapperStruct00.var_1_6) / WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_4 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + ((((WrapperStruct00.var_1_10) < (1.9)) ? (WrapperStruct00.var_1_10) : (1.9)))) + (99.125 + WrapperStruct00.var_1_11)))) : 1)) && ((WrapperStruct00.var_1_2 < WrapperStruct00.var_1_8) ? ((((- WrapperStruct00.var_1_15) <= WrapperStruct00.var_1_6) || (WrapperStruct00.var_1_4 < WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_12 == ((unsigned long int) ((((WrapperStruct00.var_1_6) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_12 == ((unsigned long int) (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_6)))) : 1)) && ((((((-128) < (last_1_WrapperStruct00_var_1_15)) ? (-128) : (last_1_WrapperStruct00_var_1_15))) < WrapperStruct00.var_1_13) ? ((last_1_WrapperStruct00_var_1_15 > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_15 == ((unsigned long int) (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_15 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_15 == ((unsigned long int) WrapperStruct00.var_1_16))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L117-L118] return (((WrapperStruct00.var_1_1 == ((double) (WrapperStruct00.var_1_2 - WrapperStruct00.var_1_3))) && ((8 < ((WrapperStruct00.var_1_15 >> WrapperStruct00.var_1_6) / WrapperStruct00.var_1_7)) ? (WrapperStruct00.var_1_4 == ((double) (((WrapperStruct00.var_1_8 + WrapperStruct00.var_1_9) + ((((WrapperStruct00.var_1_10) < (1.9)) ? (WrapperStruct00.var_1_10) : (1.9)))) + (99.125 + WrapperStruct00.var_1_11)))) : 1)) && ((WrapperStruct00.var_1_2 < WrapperStruct00.var_1_8) ? ((((- WrapperStruct00.var_1_15) <= WrapperStruct00.var_1_6) || (WrapperStruct00.var_1_4 < WrapperStruct00.var_1_10)) ? (WrapperStruct00.var_1_12 == ((unsigned long int) ((((WrapperStruct00.var_1_6) < (WrapperStruct00.var_1_13)) ? (WrapperStruct00.var_1_6) : (WrapperStruct00.var_1_13))))) : (WrapperStruct00.var_1_12 == ((unsigned long int) (WrapperStruct00.var_1_14 - WrapperStruct00.var_1_6)))) : 1)) && ((((((-128) < (last_1_WrapperStruct00_var_1_15)) ? (-128) : (last_1_WrapperStruct00_var_1_15))) < WrapperStruct00.var_1_13) ? ((last_1_WrapperStruct00_var_1_15 > WrapperStruct00.var_1_7) ? (WrapperStruct00.var_1_15 == ((unsigned long int) (WrapperStruct00.var_1_6 + WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_15 == ((unsigned long int) WrapperStruct00.var_1_14))) : (WrapperStruct00.var_1_15 == ((unsigned long int) WrapperStruct00.var_1_16))) ; [L127] RET, EXPR property() [L127] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_15=500] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 123 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 3, TraceHistogramMax: 17, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 679 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 333 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16 IncrementalHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 346 mSDtfsCounter, 16 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 148 GetRequests, 146 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=123occurred in iteration=0, InterpolantAutomatonStates: 6, 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, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 715 NumberOfCodeBlocks, 715 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 426 ConstructedInterpolants, 0 QuantifiedInterpolants, 428 SizeOfPredicates, 0 NumberOfNonLiveVariables, 496 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 3 InterpolantComputations, 2 PerfectInterpolantSequences, 1600/1632 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:24,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-98.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 1ba7c929f0e6efd0a397d94adaa69f0d7bd63f2d787023196b790a71b229b8df --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:13:26,931 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:13:27,017 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:27,023 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:13:27,025 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:13:27,059 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:13:27,062 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:13:27,063 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:13:27,063 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:13:27,064 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:13:27,064 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:13:27,064 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:13:27,065 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:13:27,065 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:13:27,066 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:13:27,066 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:13:27,066 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:13:27,069 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:13:27,072 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:13:27,073 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:13:27,073 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:13:27,073 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:13:27,074 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:13:27,074 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 01:13:27,074 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 01:13:27,074 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:13:27,074 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 01:13:27,075 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:13:27,087 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:13:27,087 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:13:27,087 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:13:27,088 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:13:27,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:13:27,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:13:27,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:13:27,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:13:27,089 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:13:27,089 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:13:27,089 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 01:13:27,089 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 01:13:27,090 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:13:27,091 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:13:27,091 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:13:27,091 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:13:27,091 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 -> 1ba7c929f0e6efd0a397d94adaa69f0d7bd63f2d787023196b790a71b229b8df [2024-11-19 01:13:27,449 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:13:27,477 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:13:27,480 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:13:27,481 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:13:27,482 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:13:27,483 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-98.i [2024-11-19 01:13:29,083 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:13:29,309 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:13:29,311 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-98.i [2024-11-19 01:13:29,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdd60e53e/eb9239c8517647e3b85a3454fe66e0f7/FLAG986ca7e9c [2024-11-19 01:13:29,343 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fdd60e53e/eb9239c8517647e3b85a3454fe66e0f7 [2024-11-19 01:13:29,346 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:13:29,348 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:13:29,351 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:13:29,351 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:13:29,356 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:13:29,357 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:13:29" (1/1) ... [2024-11-19 01:13:29,359 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@a32a3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:29, skipping insertion in model container [2024-11-19 01:13:29,360 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:13:29" (1/1) ... [2024-11-19 01:13:29,390 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:13:29,602 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-98.i[916,929] [2024-11-19 01:13:29,682 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:13:29,699 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:13:29,712 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-98.i[916,929] [2024-11-19 01:13:29,769 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:13:29,805 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:13:29,806 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:29 WrapperNode [2024-11-19 01:13:29,806 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:13:29,807 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:13:29,807 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:13:29,807 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:13:29,814 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:29" (1/1) ... [2024-11-19 01:13:29,831 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:29" (1/1) ... [2024-11-19 01:13:29,886 INFO L138 Inliner]: procedures = 36, calls = 163, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 498 [2024-11-19 01:13:29,886 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:13:29,887 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:13:29,887 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:13:29,887 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:13:29,897 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:29" (1/1) ... [2024-11-19 01:13:29,898 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:29" (1/1) ... [2024-11-19 01:13:29,909 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:29" (1/1) ... [2024-11-19 01:13:29,951 INFO L175 MemorySlicer]: Split 135 memory accesses to 2 slices as follows [2, 133]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 34 writes are split as follows [0, 34]. [2024-11-19 01:13:29,951 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:29" (1/1) ... [2024-11-19 01:13:29,955 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:29" (1/1) ... [2024-11-19 01:13:30,000 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:29" (1/1) ... [2024-11-19 01:13:30,008 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:29" (1/1) ... [2024-11-19 01:13:30,015 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:29" (1/1) ... [2024-11-19 01:13:30,022 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:29" (1/1) ... [2024-11-19 01:13:30,036 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:13:30,037 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:13:30,037 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:13:30,037 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:13:30,040 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:29" (1/1) ... [2024-11-19 01:13:30,048 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:13:30,060 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:13:30,079 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:30,082 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:30,121 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:13:30,121 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 01:13:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 01:13:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-19 01:13:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-19 01:13:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 01:13:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 01:13:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 01:13:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 01:13:30,122 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 01:13:30,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 01:13:30,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 01:13:30,123 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 01:13:30,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-19 01:13:30,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-19 01:13:30,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-19 01:13:30,123 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-19 01:13:30,124 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:13:30,124 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:13:30,124 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:13:30,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:13:30,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 01:13:30,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 01:13:30,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 01:13:30,124 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 01:13:30,294 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:13:30,296 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:13:42,305 INFO L? ?]: Removed 124 outVars from TransFormulas that were not future-live. [2024-11-19 01:13:42,306 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:13:42,326 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:13:42,326 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:13:42,326 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:13:42 BoogieIcfgContainer [2024-11-19 01:13:42,326 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:13:42,335 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:13:42,335 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:13:42,338 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:13:42,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:13:29" (1/3) ... [2024-11-19 01:13:42,339 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd91ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:13:42, skipping insertion in model container [2024-11-19 01:13:42,339 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:13:29" (2/3) ... [2024-11-19 01:13:42,340 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1fd91ff5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:13:42, skipping insertion in model container [2024-11-19 01:13:42,340 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:13:42" (3/3) ... [2024-11-19 01:13:42,341 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-98.i [2024-11-19 01:13:42,357 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:13:42,358 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:13:42,423 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:13:42,430 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;@4a536536, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:13:42,431 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:13:42,436 INFO L276 IsEmpty]: Start isEmpty. Operand has 117 states, 97 states have (on average 1.4329896907216495) internal successors, (139), 98 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 01:13:42,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-19 01:13:42,453 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:13:42,454 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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,454 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:13:42,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:13:42,461 INFO L85 PathProgramCache]: Analyzing trace with hash -1083896104, now seen corresponding path program 1 times [2024-11-19 01:13:42,474 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:13:42,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [930592872] [2024-11-19 01:13:42,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:42,475 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:42,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:13:42,479 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:42,503 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:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:43,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:13:43,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:13:43,126 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 144 proven. 0 refuted. 0 times theorem prover too weak. 400 trivial. 0 not checked. [2024-11-19 01:13:43,127 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:13:43,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:13:43,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [930592872] [2024-11-19 01:13:43,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [930592872] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:13:43,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:13:43,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:13:43,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2016349378] [2024-11-19 01:13:43,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:13:43,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:13:43,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:13:43,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:13:43,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:13:43,161 INFO L87 Difference]: Start difference. First operand has 117 states, 97 states have (on average 1.4329896907216495) internal successors, (139), 98 states have internal predecessors, (139), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-19 01:13:43,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:13:43,191 INFO L93 Difference]: Finished difference Result 227 states and 357 transitions. [2024-11-19 01:13:43,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:13:43,194 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 141 [2024-11-19 01:13:43,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:13:43,202 INFO L225 Difference]: With dead ends: 227 [2024-11-19 01:13:43,202 INFO L226 Difference]: Without dead ends: 113 [2024-11-19 01:13:43,206 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 140 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:43,209 INFO L432 NwaCegarLoop]: 166 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, 166 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:43,210 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 166 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:43,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2024-11-19 01:13:43,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2024-11-19 01:13:43,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.4042553191489362) internal successors, (132), 94 states have internal predecessors, (132), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 01:13:43,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 166 transitions. [2024-11-19 01:13:43,250 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 166 transitions. Word has length 141 [2024-11-19 01:13:43,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:13:43,251 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 166 transitions. [2024-11-19 01:13:43,251 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 31.5) internal successors, (63), 2 states have internal predecessors, (63), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-19 01:13:43,252 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 166 transitions. [2024-11-19 01:13:43,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2024-11-19 01:13:43,256 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:13:43,256 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:43,271 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:43,457 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:43,458 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:13:43,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:13:43,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1572949054, now seen corresponding path program 1 times [2024-11-19 01:13:43,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:13:43,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [603424546] [2024-11-19 01:13:43,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:43,460 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,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:13:43,464 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:43,465 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:44,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:44,050 INFO L255 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:13:44,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:13:44,371 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:13:44,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 173 treesize of output 65 [2024-11-19 01:13:44,564 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2024-11-19 01:13:44,564 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:13:44,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:13:44,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [603424546] [2024-11-19 01:13:44,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [603424546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:13:44,565 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:13:44,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:13:44,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1805484053] [2024-11-19 01:13:44,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:13:44,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:13:44,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:13:44,569 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:13:44,569 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:13:44,569 INFO L87 Difference]: Start difference. First operand 113 states and 166 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 5 states have internal predecessors, (59), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:13:48,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:13:52,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:13:57,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:13:58,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:13:59,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:13:59,045 INFO L93 Difference]: Finished difference Result 224 states and 330 transitions. [2024-11-19 01:13:59,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:13:59,047 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), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) Word has length 141 [2024-11-19 01:13:59,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:13:59,049 INFO L225 Difference]: With dead ends: 224 [2024-11-19 01:13:59,049 INFO L226 Difference]: Without dead ends: 114 [2024-11-19 01:13:59,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 136 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:13:59,051 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 161 mSDsluCounter, 317 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.3s IncrementalHoareTripleChecker+Time [2024-11-19 01:13:59,051 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [161 Valid, 448 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 209 Invalid, 1 Unknown, 0 Unchecked, 14.3s Time] [2024-11-19 01:13:59,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-19 01:13:59,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-19 01:13:59,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.3936170212765957) internal successors, (131), 94 states have internal predecessors, (131), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 01:13:59,071 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 165 transitions. [2024-11-19 01:13:59,071 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 165 transitions. Word has length 141 [2024-11-19 01:13:59,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:13:59,072 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 165 transitions. [2024-11-19 01:13:59,072 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), 1 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 1 states have call predecessors, (17), 1 states have call successors, (17) [2024-11-19 01:13:59,072 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 165 transitions. [2024-11-19 01:13:59,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-19 01:13:59,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:13:59,075 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:59,092 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 01:13:59,275 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:59,276 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:13:59,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:13:59,277 INFO L85 PathProgramCache]: Analyzing trace with hash 117868476, now seen corresponding path program 1 times [2024-11-19 01:13:59,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:13:59,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1641321476] [2024-11-19 01:13:59,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:13:59,278 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:59,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:13:59,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:59,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:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:13:59,759 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:13:59,770 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:14:00,037 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:14:00,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 173 treesize of output 65 [2024-11-19 01:14:00,141 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 64 proven. 0 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2024-11-19 01:14:00,143 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:14:00,144 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:14:00,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1641321476] [2024-11-19 01:14:00,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1641321476] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:14:00,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:14:00,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:14:00,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260174172] [2024-11-19 01:14:00,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:14:00,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:14:00,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:14:00,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:14:00,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:14:00,147 INFO L87 Difference]: Start difference. First operand 113 states and 165 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-19 01:14:02,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:14:07,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.74s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:14:12,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:14:13,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:14:13,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:14:13,886 INFO L93 Difference]: Finished difference Result 224 states and 328 transitions. [2024-11-19 01:14:13,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:14:13,888 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 143 [2024-11-19 01:14:13,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:14:13,889 INFO L225 Difference]: With dead ends: 224 [2024-11-19 01:14:13,889 INFO L226 Difference]: Without dead ends: 114 [2024-11-19 01:14:13,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:14:13,891 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 148 mSDsluCounter, 312 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 442 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:14:13,892 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 442 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 211 Invalid, 1 Unknown, 0 Unchecked, 13.6s Time] [2024-11-19 01:14:13,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2024-11-19 01:14:13,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 113. [2024-11-19 01:14:13,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 94 states have (on average 1.3829787234042554) internal successors, (130), 94 states have internal predecessors, (130), 17 states have call successors, (17), 1 states have call predecessors, (17), 1 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2024-11-19 01:14:13,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 164 transitions. [2024-11-19 01:14:13,901 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 164 transitions. Word has length 143 [2024-11-19 01:14:13,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:14:13,902 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 164 transitions. [2024-11-19 01:14:13,902 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2024-11-19 01:14:13,903 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 164 transitions. [2024-11-19 01:14:13,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-11-19 01:14:13,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:14:13,905 INFO L215 NwaCegarLoop]: trace histogram [17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:14:13,928 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:14:14,105 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:14:14,106 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:14:14,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:14:14,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1814018, now seen corresponding path program 1 times [2024-11-19 01:14:14,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:14:14,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1137144376] [2024-11-19 01:14:14,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:14:14,108 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:14:14,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:14:14,112 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:14:14,113 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