./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-50.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-50.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 fdfa367d5acc1e28d753248ee606b85b63b852039707b0bdcc3c0a793b19387f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:07:55,535 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:07:55,603 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-19 01:07:55,609 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:07:55,611 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:07:55,638 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:07:55,639 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:07:55,639 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:07:55,640 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:07:55,641 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:07:55,642 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:07:55,642 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:07:55,643 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:07:55,645 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:07:55,646 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:07:55,646 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:07:55,647 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:07:55,647 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:07:55,647 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 01:07:55,647 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:07:55,648 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:07:55,648 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:07:55,649 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:07:55,649 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:07:55,649 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:07:55,650 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:07:55,650 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:07:55,654 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:07:55,655 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:07:55,655 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:07:55,655 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:07:55,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:07:55,656 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:07:55,656 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:07:55,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:07:55,656 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:07:55,657 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 01:07:55,657 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 01:07:55,657 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:07:55,657 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:07:55,658 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:07:55,658 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:07:55,659 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 -> fdfa367d5acc1e28d753248ee606b85b63b852039707b0bdcc3c0a793b19387f [2024-11-19 01:07:55,928 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:07:55,970 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:07:55,975 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:07:55,976 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:07:55,977 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:07:55,978 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-50.i [2024-11-19 01:07:57,442 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:07:57,655 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:07:57,656 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-50.i [2024-11-19 01:07:57,669 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d083a9820/722d2fa47a0c47c38d84e44f6e971f04/FLAGe647faca2 [2024-11-19 01:07:58,022 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d083a9820/722d2fa47a0c47c38d84e44f6e971f04 [2024-11-19 01:07:58,025 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:07:58,026 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:07:58,028 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:07:58,028 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:07:58,034 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:07:58,037 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:07:58" (1/1) ... [2024-11-19 01:07:58,038 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78580b91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:58, skipping insertion in model container [2024-11-19 01:07:58,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:07:58" (1/1) ... [2024-11-19 01:07:58,072 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:07:58,259 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-50.i[916,929] [2024-11-19 01:07:58,350 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:07:58,367 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:07:58,382 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-50.i[916,929] [2024-11-19 01:07:58,449 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:07:58,474 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:07:58,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:58 WrapperNode [2024-11-19 01:07:58,475 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:07:58,477 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:07:58,478 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:07:58,478 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:07:58,486 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:07:58" (1/1) ... [2024-11-19 01:07:58,500 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:07:58" (1/1) ... [2024-11-19 01:07:58,547 INFO L138 Inliner]: procedures = 30, calls = 208, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 594 [2024-11-19 01:07:58,547 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:07:58,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:07:58,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:07:58,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:07:58,565 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:58" (1/1) ... [2024-11-19 01:07:58,565 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:58" (1/1) ... [2024-11-19 01:07:58,573 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:58" (1/1) ... [2024-11-19 01:07:58,589 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-19 01:07:58,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:58" (1/1) ... [2024-11-19 01:07:58,590 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:58" (1/1) ... [2024-11-19 01:07:58,614 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:58" (1/1) ... [2024-11-19 01:07:58,623 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:58" (1/1) ... [2024-11-19 01:07:58,626 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:58" (1/1) ... [2024-11-19 01:07:58,629 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:58" (1/1) ... [2024-11-19 01:07:58,635 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:07:58,636 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:07:58,637 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:07:58,637 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:07:58,638 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:58" (1/1) ... [2024-11-19 01:07:58,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:07:58,669 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:07:58,692 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:07:58,699 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:07:58,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:07:58,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-19 01:07:58,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-19 01:07:58,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-19 01:07:58,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-19 01:07:58,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-19 01:07:58,751 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-19 01:07:58,751 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:07:58,751 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:07:58,751 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-19 01:07:58,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:07:58,752 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:07:58,897 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:07:58,899 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:07:59,677 INFO L? ?]: Removed 152 outVars from TransFormulas that were not future-live. [2024-11-19 01:07:59,678 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:07:59,703 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:07:59,705 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:07:59,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:07:59 BoogieIcfgContainer [2024-11-19 01:07:59,707 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:07:59,709 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:07:59,710 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:07:59,713 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:07:59,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:07:58" (1/3) ... [2024-11-19 01:07:59,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe64fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:07:59, skipping insertion in model container [2024-11-19 01:07:59,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:07:58" (2/3) ... [2024-11-19 01:07:59,716 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe64fda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:07:59, skipping insertion in model container [2024-11-19 01:07:59,716 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:07:59" (3/3) ... [2024-11-19 01:07:59,718 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-50.i [2024-11-19 01:07:59,739 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:07:59,740 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:07:59,801 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:07:59,810 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;@7aa0f98a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:07:59,810 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:07:59,816 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 101 states have (on average 1.386138613861386) internal successors, (140), 102 states have internal predecessors, (140), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 01:07:59,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-19 01:07:59,840 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:07:59,841 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:07:59,842 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:07:59,847 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:07:59,848 INFO L85 PathProgramCache]: Analyzing trace with hash 487484050, now seen corresponding path program 1 times [2024-11-19 01:07:59,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:07:59,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542117593] [2024-11-19 01:07:59,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:07:59,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:08:00,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:00,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 50 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2024-11-19 01:08:00,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:08:00,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542117593] [2024-11-19 01:08:00,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1542117593] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 01:08:00,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1739059210] [2024-11-19 01:08:00,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:00,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 01:08:00,397 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:08:00,399 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:08:00,400 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:08:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:00,754 INFO L255 TraceCheckSpWp]: Trace formula consists of 698 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:08:00,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:00,806 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 50 proven. 0 refuted. 0 times theorem prover too weak. 1250 trivial. 0 not checked. [2024-11-19 01:08:00,807 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:08:00,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1739059210] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:00,808 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:08:00,808 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-19 01:08:00,811 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458167911] [2024-11-19 01:08:00,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:00,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:08:00,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:08:00,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:08:00,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:08:00,851 INFO L87 Difference]: Start difference. First operand has 130 states, 101 states have (on average 1.386138613861386) internal successors, (140), 102 states have internal predecessors, (140), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-19 01:08:00,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:00,887 INFO L93 Difference]: Finished difference Result 253 states and 404 transitions. [2024-11-19 01:08:00,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:08:00,890 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 195 [2024-11-19 01:08:00,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:00,902 INFO L225 Difference]: With dead ends: 253 [2024-11-19 01:08:00,902 INFO L226 Difference]: Without dead ends: 126 [2024-11-19 01:08:00,909 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 196 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:08:00,913 INFO L432 NwaCegarLoop]: 185 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, 185 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:08:00,916 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:08:00,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-19 01:08:00,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-19 01:08:00,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 98 states have internal predecessors, (133), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 01:08:00,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 185 transitions. [2024-11-19 01:08:00,989 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 185 transitions. Word has length 195 [2024-11-19 01:08:00,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:00,990 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 185 transitions. [2024-11-19 01:08:00,991 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 35.0) internal successors, (70), 2 states have internal predecessors, (70), 2 states have call successors, (26), 2 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-19 01:08:00,991 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 185 transitions. [2024-11-19 01:08:00,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-19 01:08:00,995 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:00,996 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:01,010 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 01:08:01,197 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:08:01,197 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:01,198 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:01,198 INFO L85 PathProgramCache]: Analyzing trace with hash 323752422, now seen corresponding path program 1 times [2024-11-19 01:08:01,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:08:01,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317621910] [2024-11-19 01:08:01,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:01,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:08:01,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:01,631 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-19 01:08:01,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:08:01,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317621910] [2024-11-19 01:08:01,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317621910] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:01,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:01,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:08:01,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397016301] [2024-11-19 01:08:01,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:01,633 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 01:08:01,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:08:01,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 01:08:01,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 01:08:01,637 INFO L87 Difference]: Start difference. First operand 126 states and 185 transitions. Second operand has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-19 01:08:01,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:01,705 INFO L93 Difference]: Finished difference Result 251 states and 370 transitions. [2024-11-19 01:08:01,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 01:08:01,708 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 195 [2024-11-19 01:08:01,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:01,711 INFO L225 Difference]: With dead ends: 251 [2024-11-19 01:08:01,711 INFO L226 Difference]: Without dead ends: 128 [2024-11-19 01:08:01,714 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:08:01,715 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 0 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 538 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:08:01,717 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 538 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:08:01,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-11-19 01:08:01,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2024-11-19 01:08:01,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 100 states have (on average 1.35) internal successors, (135), 100 states have internal predecessors, (135), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 01:08:01,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 187 transitions. [2024-11-19 01:08:01,735 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 187 transitions. Word has length 195 [2024-11-19 01:08:01,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:01,736 INFO L471 AbstractCegarLoop]: Abstraction has 128 states and 187 transitions. [2024-11-19 01:08:01,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 17.0) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-19 01:08:01,737 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 187 transitions. [2024-11-19 01:08:01,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-19 01:08:01,740 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:01,740 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:01,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 01:08:01,741 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:01,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:01,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1692213032, now seen corresponding path program 1 times [2024-11-19 01:08:01,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:08:01,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610043801] [2024-11-19 01:08:01,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:01,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:08:02,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:04,942 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-19 01:08:04,943 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 01:08:04,943 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610043801] [2024-11-19 01:08:04,943 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610043801] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:04,944 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:04,944 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 01:08:04,944 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411969220] [2024-11-19 01:08:04,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:04,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:08:04,945 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 01:08:04,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:08:04,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:08:04,946 INFO L87 Difference]: Start difference. First operand 128 states and 187 transitions. Second operand has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-19 01:08:05,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:05,786 INFO L93 Difference]: Finished difference Result 328 states and 478 transitions. [2024-11-19 01:08:05,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 01:08:05,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) Word has length 195 [2024-11-19 01:08:05,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:05,790 INFO L225 Difference]: With dead ends: 328 [2024-11-19 01:08:05,790 INFO L226 Difference]: Without dead ends: 203 [2024-11-19 01:08:05,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-11-19 01:08:05,795 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 95 mSDsluCounter, 642 mSDsCounter, 0 mSdLazyCounter, 375 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 857 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:05,796 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 857 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 375 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-19 01:08:05,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-11-19 01:08:05,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 200. [2024-11-19 01:08:05,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 163 states have (on average 1.3680981595092025) internal successors, (223), 164 states have internal predecessors, (223), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 33 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-19 01:08:05,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 291 transitions. [2024-11-19 01:08:05,828 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 291 transitions. Word has length 195 [2024-11-19 01:08:05,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:05,829 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 291 transitions. [2024-11-19 01:08:05,829 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 13.6) internal successors, (68), 6 states have internal predecessors, (68), 2 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-19 01:08:05,829 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 291 transitions. [2024-11-19 01:08:05,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-19 01:08:05,836 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:05,836 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:05,837 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 01:08:05,837 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:05,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:05,838 INFO L85 PathProgramCache]: Analyzing trace with hash 1516711458, now seen corresponding path program 1 times [2024-11-19 01:08:05,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 01:08:05,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802200625] [2024-11-19 01:08:05,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:05,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 01:08:06,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:08:06,080 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 01:08:06,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 01:08:06,294 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 01:08:06,295 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 01:08:06,297 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-19 01:08:06,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 01:08:06,303 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-19 01:08:06,392 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 01:08:06,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 01:08:06 BoogieIcfgContainer [2024-11-19 01:08:06,400 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 01:08:06,402 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 01:08:06,402 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 01:08:06,402 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 01:08:06,403 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:07:59" (3/4) ... [2024-11-19 01:08:06,406 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 01:08:06,407 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 01:08:06,409 INFO L158 Benchmark]: Toolchain (without parser) took 8381.86ms. Allocated memory was 151.0MB in the beginning and 293.6MB in the end (delta: 142.6MB). Free memory was 98.9MB in the beginning and 114.1MB in the end (delta: -15.2MB). Peak memory consumption was 128.5MB. Max. memory is 16.1GB. [2024-11-19 01:08:06,409 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 151.0MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:08:06,409 INFO L158 Benchmark]: CACSL2BoogieTranslator took 448.13ms. Allocated memory is still 151.0MB. Free memory was 98.9MB in the beginning and 78.3MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-11-19 01:08:06,411 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.37ms. Allocated memory is still 151.0MB. Free memory was 78.3MB in the beginning and 73.7MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:08:06,411 INFO L158 Benchmark]: Boogie Preprocessor took 87.42ms. Allocated memory is still 151.0MB. Free memory was 73.7MB in the beginning and 69.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 01:08:06,411 INFO L158 Benchmark]: RCFGBuilder took 1070.76ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 69.2MB in the beginning and 141.5MB in the end (delta: -72.3MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. [2024-11-19 01:08:06,412 INFO L158 Benchmark]: TraceAbstraction took 6690.75ms. Allocated memory was 192.9MB in the beginning and 293.6MB in the end (delta: 100.7MB). Free memory was 140.4MB in the beginning and 114.1MB in the end (delta: 26.3MB). Peak memory consumption was 125.9MB. Max. memory is 16.1GB. [2024-11-19 01:08:06,412 INFO L158 Benchmark]: Witness Printer took 6.01ms. Allocated memory is still 293.6MB. Free memory is still 114.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 01:08:06,414 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.27ms. Allocated memory is still 151.0MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 448.13ms. Allocated memory is still 151.0MB. Free memory was 98.9MB in the beginning and 78.3MB in the end (delta: 20.6MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.37ms. Allocated memory is still 151.0MB. Free memory was 78.3MB in the beginning and 73.7MB in the end (delta: 4.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.42ms. Allocated memory is still 151.0MB. Free memory was 73.7MB in the beginning and 69.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1070.76ms. Allocated memory was 151.0MB in the beginning and 192.9MB in the end (delta: 41.9MB). Free memory was 69.2MB in the beginning and 141.5MB in the end (delta: -72.3MB). Peak memory consumption was 36.1MB. Max. memory is 16.1GB. * TraceAbstraction took 6690.75ms. Allocated memory was 192.9MB in the beginning and 293.6MB in the end (delta: 100.7MB). Free memory was 140.4MB in the beginning and 114.1MB in the end (delta: 26.3MB). Peak memory consumption was 125.9MB. Max. memory is 16.1GB. * Witness Printer took 6.01ms. Allocated memory is still 293.6MB. Free memory is still 114.1MB. 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 144, overapproximation of someBinaryArithmeticDOUBLEoperation at line 144. Possible FailurePath: [L42] unsigned char isInitial = 0; [L43-L62] struct WrapperStruct00 WrapperStruct00 = { 1, 8.875, 63.5, 16.6, 127.8, 1, 0, 0, -2, 64, 2, 4, 26204, 5, -5, 100, 0, 128 }; [L63] signed long int last_1_WrapperStruct00_var_1_18 = -5; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_18=-5] [L148] isInitial = 1 [L149] FCALL initially() [L150] COND TRUE 1 [L151] CALL updateLastVariables() [L141] EXPR WrapperStruct00.var_1_18 [L141] last_1_WrapperStruct00_var_1_18 = WrapperStruct00.var_1_18 [L151] RET updateLastVariables() [L152] CALL updateVariables() [L98] WrapperStruct00.var_1_2 = __VERIFIER_nondet_double() [L99] EXPR WrapperStruct00.var_1_2 [L99] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F [L99] EXPR WrapperStruct00.var_1_2 [L99] EXPR WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L99] EXPR (WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L99] CALL assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L99] RET assume_abort_if_not((WrapperStruct00.var_1_2 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_2 <= -1.0e-20F) || (WrapperStruct00.var_1_2 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_2 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L100] WrapperStruct00.var_1_3 = __VERIFIER_nondet_double() [L101] EXPR WrapperStruct00.var_1_3 [L101] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F [L101] EXPR WrapperStruct00.var_1_3 [L101] EXPR WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L101] EXPR (WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L101] CALL assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L101] RET assume_abort_if_not((WrapperStruct00.var_1_3 >= -922337.2036854776000e+13F && WrapperStruct00.var_1_3 <= -1.0e-20F) || (WrapperStruct00.var_1_3 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_3 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L102] WrapperStruct00.var_1_4 = __VERIFIER_nondet_double() [L103] EXPR WrapperStruct00.var_1_4 [L103] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F [L103] EXPR WrapperStruct00.var_1_4 [L103] EXPR WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L103] EXPR (WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L103] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L103] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= 0.0F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L104] WrapperStruct00.var_1_5 = __VERIFIER_nondet_double() [L105] EXPR WrapperStruct00.var_1_5 [L105] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F [L105] EXPR WrapperStruct00.var_1_5 [L105] EXPR WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L105] EXPR (WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L105] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L105] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= 0.0F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 9223372.036854776000e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L106] WrapperStruct00.var_1_9 = __VERIFIER_nondet_uchar() [L107] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L107] RET assume_abort_if_not(WrapperStruct00.var_1_9 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L108] EXPR WrapperStruct00.var_1_9 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_9 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L109] WrapperStruct00.var_1_10 = __VERIFIER_nondet_uchar() [L110] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L110] RET assume_abort_if_not(WrapperStruct00.var_1_10 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L111] EXPR WrapperStruct00.var_1_10 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L111] RET assume_abort_if_not(WrapperStruct00.var_1_10 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L112] WrapperStruct00.var_1_11 = __VERIFIER_nondet_uchar() [L113] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L113] RET assume_abort_if_not(WrapperStruct00.var_1_11 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L114] EXPR WrapperStruct00.var_1_11 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_11 <= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L114] RET assume_abort_if_not(WrapperStruct00.var_1_11 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L115] WrapperStruct00.var_1_13 = __VERIFIER_nondet_short() [L116] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L116] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= -32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_13 >= -32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L117] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L117] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L118] WrapperStruct00.var_1_14 = __VERIFIER_nondet_short() [L119] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L119] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= -32767) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L119] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= -32767) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L120] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L120] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L120] RET assume_abort_if_not(WrapperStruct00.var_1_14 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L121] WrapperStruct00.var_1_15 = __VERIFIER_nondet_short() [L122] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L122] CALL assume_abort_if_not(WrapperStruct00.var_1_15 >= -1) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L122] RET assume_abort_if_not(WrapperStruct00.var_1_15 >= -1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L123] EXPR WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L123] CALL assume_abort_if_not(WrapperStruct00.var_1_15 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L123] RET assume_abort_if_not(WrapperStruct00.var_1_15 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L124] WrapperStruct00.var_1_16 = __VERIFIER_nondet_short() [L125] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L125] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L125] RET assume_abort_if_not(WrapperStruct00.var_1_16 >= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L126] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L126] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 32766) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L126] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 32766) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L127] WrapperStruct00.var_1_17 = __VERIFIER_nondet_short() [L128] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L128] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L128] RET assume_abort_if_not(WrapperStruct00.var_1_17 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L129] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L129] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 16383) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L129] RET assume_abort_if_not(WrapperStruct00.var_1_17 <= 16383) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L130] WrapperStruct00.var_1_19 = __VERIFIER_nondet_long() [L131] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L131] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L131] RET assume_abort_if_not(WrapperStruct00.var_1_19 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L132] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L132] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 2147483647) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L132] RET assume_abort_if_not(WrapperStruct00.var_1_19 <= 2147483647) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L133] WrapperStruct00.var_1_20 = __VERIFIER_nondet_long() [L134] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L134] CALL assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L134] RET assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L135] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L135] CALL assume_abort_if_not(WrapperStruct00.var_1_20 <= 536870911) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L135] RET assume_abort_if_not(WrapperStruct00.var_1_20 <= 536870911) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L136] WrapperStruct00.var_1_21 = __VERIFIER_nondet_long() [L137] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L137] CALL assume_abort_if_not(WrapperStruct00.var_1_21 >= 0) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L137] RET assume_abort_if_not(WrapperStruct00.var_1_21 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L138] EXPR WrapperStruct00.var_1_21 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L138] CALL assume_abort_if_not(WrapperStruct00.var_1_21 <= 2147483646) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L138] RET assume_abort_if_not(WrapperStruct00.var_1_21 <= 2147483646) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L152] RET updateVariables() [L153] CALL step() [L67] signed long int stepLocal_1 = last_1_WrapperStruct00_var_1_18; VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5, stepLocal_1=-5] [L68] COND FALSE !(stepLocal_1 >= 0) [L71] EXPR WrapperStruct00.var_1_13 [L71] EXPR WrapperStruct00.var_1_15 [L71] EXPR WrapperStruct00.var_1_16 [L71] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L71] EXPR ((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17))) [L71] EXPR WrapperStruct00.var_1_13 [L71] EXPR ((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L71] WrapperStruct00.var_1_12 = ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17))))) [L73] EXPR WrapperStruct00.var_1_15 [L73] EXPR WrapperStruct00.var_1_19 [L73] signed long int stepLocal_3 = WrapperStruct00.var_1_15 - WrapperStruct00.var_1_19; [L74] EXPR WrapperStruct00.var_1_12 [L74] signed short int stepLocal_2 = WrapperStruct00.var_1_12; [L75] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5, stepLocal_2=32757, stepLocal_3=32757] [L75] COND FALSE !(WrapperStruct00.var_1_12 > stepLocal_3) [L80] EXPR WrapperStruct00.var_1_14 [L80] WrapperStruct00.var_1_18 = WrapperStruct00.var_1_14 [L82] EXPR WrapperStruct00.var_1_12 [L82] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5, stepLocal_2=32757] [L82] EXPR ((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18) [L82] EXPR WrapperStruct00.var_1_12 [L82] EXPR ((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5, stepLocal_2=32757] [L82] signed long int stepLocal_0 = (((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18)); [L83] EXPR WrapperStruct00.var_1_2 [L83] EXPR WrapperStruct00.var_1_3 [L83] EXPR WrapperStruct00.var_1_4 [L83] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5, stepLocal_0=32757, stepLocal_2=32757] [L83] EXPR (((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) [L83] EXPR WrapperStruct00.var_1_2 [L83] EXPR WrapperStruct00.var_1_3 [L83] EXPR (((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5, stepLocal_0=32757, stepLocal_2=32757] [L83] COND TRUE (((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) != 31.9 [L84] EXPR WrapperStruct00.var_1_18 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5, stepLocal_0=32757, stepLocal_2=32757] [L84] COND FALSE !(stepLocal_0 < WrapperStruct00.var_1_18) [L91] EXPR WrapperStruct00.var_1_10 [L91] WrapperStruct00.var_1_1 = WrapperStruct00.var_1_10 [L153] RET step() [L154] CALL, EXPR property() [L144] EXPR WrapperStruct00.var_1_2 [L144] EXPR WrapperStruct00.var_1_3 [L144] EXPR WrapperStruct00.var_1_4 [L144] EXPR WrapperStruct00.var_1_5 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L144] EXPR (((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) [L144] EXPR WrapperStruct00.var_1_2 [L144] EXPR WrapperStruct00.var_1_3 [L144] EXPR (((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L144] EXPR ((((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) != 31.9) ? ((((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18))) < WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_11)) [L144] EXPR WrapperStruct00.var_1_1 [L144] EXPR WrapperStruct00.var_1_11 [L144] EXPR ((((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) != 31.9) ? ((((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18))) < WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_11)) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L144] EXPR (((((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) != 31.9) ? ((((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18))) < WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_11))) && ((last_1_WrapperStruct00_var_1_18 >= 0) ? (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))))))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L144] EXPR ((((((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) != 31.9) ? ((((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18))) < WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_11))) && ((last_1_WrapperStruct00_var_1_18 >= 0) ? (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17))))))))) && ((WrapperStruct00.var_1_12 > (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_19)) ? ((WrapperStruct00.var_1_13 < WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_18 == ((signed long int) ((WrapperStruct00.var_1_17 + (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_20)) - WrapperStruct00.var_1_21))) : 1) : (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_14))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L144-L145] return ((((((((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) < ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5))) ? ((WrapperStruct00.var_1_2 + WrapperStruct00.var_1_3)) : ((WrapperStruct00.var_1_4 - WrapperStruct00.var_1_5)))) != 31.9) ? ((((((WrapperStruct00.var_1_12) > (WrapperStruct00.var_1_18)) ? (WrapperStruct00.var_1_12) : (WrapperStruct00.var_1_18))) < WrapperStruct00.var_1_18) ? (WrapperStruct00.var_1_9 ? (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10)) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_10))) : (WrapperStruct00.var_1_1 == ((unsigned char) WrapperStruct00.var_1_11))) && ((last_1_WrapperStruct00_var_1_18 >= 0) ? (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > (WrapperStruct00.var_1_14)) ? (WrapperStruct00.var_1_13) : (WrapperStruct00.var_1_14))))) : (WrapperStruct00.var_1_12 == ((signed short int) ((((WrapperStruct00.var_1_13) > ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17)))) ? (WrapperStruct00.var_1_13) : ((WrapperStruct00.var_1_15 - (WrapperStruct00.var_1_16 - WrapperStruct00.var_1_17))))))))) && ((WrapperStruct00.var_1_12 > (WrapperStruct00.var_1_15 - WrapperStruct00.var_1_19)) ? ((WrapperStruct00.var_1_13 < WrapperStruct00.var_1_12) ? (WrapperStruct00.var_1_18 == ((signed long int) ((WrapperStruct00.var_1_17 + (WrapperStruct00.var_1_16 + WrapperStruct00.var_1_20)) - WrapperStruct00.var_1_21))) : 1) : (WrapperStruct00.var_1_18 == ((signed long int) WrapperStruct00.var_1_14))) ; [L154] RET, EXPR property() [L154] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] [L19] reach_error() VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=-5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 130 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.5s, OverallIterations: 4, TraceHistogramMax: 26, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 96 SdHoareTripleChecker+Valid, 0.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 95 mSDsluCounter, 1580 SdHoareTripleChecker+Invalid, 0.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 997 mSDsCounter, 6 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 391 IncrementalHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 6 mSolverCounterUnsat, 583 mSDtfsCounter, 391 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 221 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=3, InterpolantAutomatonStates: 12, 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, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 3.6s InterpolantComputationTime, 976 NumberOfCodeBlocks, 976 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 776 ConstructedInterpolants, 0 QuantifiedInterpolants, 927 SizeOfPredicates, 0 NumberOfNonLiveVariables, 698 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 4 InterpolantComputations, 3 PerfectInterpolantSequences, 5150/5200 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:08:06,453 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-50.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 fdfa367d5acc1e28d753248ee606b85b63b852039707b0bdcc3c0a793b19387f --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 01:08:08,820 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 01:08:08,901 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-19 01:08:08,908 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 01:08:08,909 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 01:08:08,941 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 01:08:08,942 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 01:08:08,943 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 01:08:08,944 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 01:08:08,944 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 01:08:08,944 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 01:08:08,945 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 01:08:08,946 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 01:08:08,946 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 01:08:08,946 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 01:08:08,947 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 01:08:08,947 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-19 01:08:08,947 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 01:08:08,948 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 01:08:08,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 01:08:08,948 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-19 01:08:08,953 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 01:08:08,953 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-19 01:08:08,953 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 01:08:08,954 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 01:08:08,954 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 01:08:08,954 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 01:08:08,954 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 01:08:08,954 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-19 01:08:08,955 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 01:08:08,955 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 01:08:08,955 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 01:08:08,956 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 01:08:08,956 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 01:08:08,956 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:08:08,956 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 01:08:08,957 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 01:08:08,957 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-19 01:08:08,957 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 01:08:08,957 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 01:08:08,957 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 01:08:08,958 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 01:08:08,959 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 01:08:08,959 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 01:08:08,959 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 -> fdfa367d5acc1e28d753248ee606b85b63b852039707b0bdcc3c0a793b19387f [2024-11-19 01:08:09,341 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 01:08:09,369 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 01:08:09,372 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 01:08:09,373 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 01:08:09,374 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 01:08:09,375 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-50.i [2024-11-19 01:08:10,999 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 01:08:11,240 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 01:08:11,241 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-50.i [2024-11-19 01:08:11,251 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b563d8d8/ab9068395244409f9a729b267104498a/FLAG0c77841e4 [2024-11-19 01:08:11,263 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2b563d8d8/ab9068395244409f9a729b267104498a [2024-11-19 01:08:11,266 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 01:08:11,267 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 01:08:11,268 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 01:08:11,269 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 01:08:11,274 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 01:08:11,275 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:08:11" (1/1) ... [2024-11-19 01:08:11,276 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@149924f6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:11, skipping insertion in model container [2024-11-19 01:08:11,276 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 01:08:11" (1/1) ... [2024-11-19 01:08:11,312 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 01:08:11,528 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-50.i[916,929] [2024-11-19 01:08:11,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:08:11,656 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 01:08:11,670 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-50.i[916,929] [2024-11-19 01:08:11,735 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 01:08:11,766 INFO L204 MainTranslator]: Completed translation [2024-11-19 01:08:11,766 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:11 WrapperNode [2024-11-19 01:08:11,766 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 01:08:11,768 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 01:08:11,768 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 01:08:11,768 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 01:08:11,776 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:08:11" (1/1) ... [2024-11-19 01:08:11,805 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:08:11" (1/1) ... [2024-11-19 01:08:11,863 INFO L138 Inliner]: procedures = 37, calls = 208, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 585 [2024-11-19 01:08:11,866 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 01:08:11,867 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 01:08:11,867 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 01:08:11,867 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 01:08:11,879 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:11" (1/1) ... [2024-11-19 01:08:11,879 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:11" (1/1) ... [2024-11-19 01:08:11,889 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:11" (1/1) ... [2024-11-19 01:08:11,917 INFO L175 MemorySlicer]: Split 171 memory accesses to 2 slices as follows [2, 169]. 99 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 42 writes are split as follows [0, 42]. [2024-11-19 01:08:11,921 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:11" (1/1) ... [2024-11-19 01:08:11,921 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:11" (1/1) ... [2024-11-19 01:08:11,955 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:11" (1/1) ... [2024-11-19 01:08:11,968 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:11" (1/1) ... [2024-11-19 01:08:11,974 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:11" (1/1) ... [2024-11-19 01:08:11,978 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:11" (1/1) ... [2024-11-19 01:08:11,988 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 01:08:11,989 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 01:08:11,990 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 01:08:11,993 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 01:08:11,994 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:11" (1/1) ... [2024-11-19 01:08:12,000 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 01:08:12,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 01:08:12,029 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:08:12,032 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:08:12,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 01:08:12,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#0 [2024-11-19 01:08:12,070 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE8#1 [2024-11-19 01:08:12,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#0 [2024-11-19 01:08:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE8#1 [2024-11-19 01:08:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#0 [2024-11-19 01:08:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE8#1 [2024-11-19 01:08:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-19 01:08:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-19 01:08:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 01:08:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 01:08:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 01:08:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 01:08:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-19 01:08:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-19 01:08:12,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#0 [2024-11-19 01:08:12,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE4#1 [2024-11-19 01:08:12,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-19 01:08:12,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-19 01:08:12,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-19 01:08:12,072 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-19 01:08:12,072 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-19 01:08:12,073 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-19 01:08:12,073 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 01:08:12,073 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 01:08:12,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-19 01:08:12,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-19 01:08:12,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-19 01:08:12,073 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-19 01:08:12,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 01:08:12,074 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 01:08:12,211 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 01:08:12,213 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 01:08:19,973 INFO L? ?]: Removed 162 outVars from TransFormulas that were not future-live. [2024-11-19 01:08:19,973 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 01:08:19,989 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 01:08:19,992 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-19 01:08:19,992 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:08:19 BoogieIcfgContainer [2024-11-19 01:08:19,995 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 01:08:19,997 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 01:08:19,998 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 01:08:20,001 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 01:08:20,001 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 01:08:11" (1/3) ... [2024-11-19 01:08:20,001 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b920b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:08:20, skipping insertion in model container [2024-11-19 01:08:20,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 01:08:11" (2/3) ... [2024-11-19 01:08:20,002 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b920b09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 01:08:20, skipping insertion in model container [2024-11-19 01:08:20,002 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 01:08:19" (3/3) ... [2024-11-19 01:08:20,004 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-50.i [2024-11-19 01:08:20,021 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 01:08:20,021 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-19 01:08:20,084 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 01:08:20,093 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;@2cfa2aeb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 01:08:20,094 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-19 01:08:20,099 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 101 states have (on average 1.386138613861386) internal successors, (140), 102 states have internal predecessors, (140), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 01:08:20,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-19 01:08:20,122 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:20,123 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:20,124 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:20,129 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:20,133 INFO L85 PathProgramCache]: Analyzing trace with hash 617764793, now seen corresponding path program 1 times [2024-11-19 01:08:20,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:08:20,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2028218978] [2024-11-19 01:08:20,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:20,148 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:08:20,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:08:20,152 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:08:20,153 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:08:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:20,938 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-19 01:08:20,950 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:21,001 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 506 proven. 0 refuted. 0 times theorem prover too weak. 794 trivial. 0 not checked. [2024-11-19 01:08:21,002 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:08:21,002 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:08:21,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2028218978] [2024-11-19 01:08:21,006 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2028218978] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:21,006 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:21,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 01:08:21,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226180020] [2024-11-19 01:08:21,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:21,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 01:08:21,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:08:21,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 01:08:21,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 01:08:21,044 INFO L87 Difference]: Start difference. First operand has 130 states, 101 states have (on average 1.386138613861386) internal successors, (140), 102 states have internal predecessors, (140), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-19 01:08:21,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:21,080 INFO L93 Difference]: Finished difference Result 253 states and 404 transitions. [2024-11-19 01:08:21,081 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 01:08:21,082 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 195 [2024-11-19 01:08:21,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:21,090 INFO L225 Difference]: With dead ends: 253 [2024-11-19 01:08:21,090 INFO L226 Difference]: Without dead ends: 126 [2024-11-19 01:08:21,094 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 194 GetRequests, 194 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:08:21,099 INFO L432 NwaCegarLoop]: 185 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, 185 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:08:21,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 01:08:21,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-19 01:08:21,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-19 01:08:21,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 98 states have (on average 1.3571428571428572) internal successors, (133), 98 states have internal predecessors, (133), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 01:08:21,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 185 transitions. [2024-11-19 01:08:21,159 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 185 transitions. Word has length 195 [2024-11-19 01:08:21,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:21,159 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 185 transitions. [2024-11-19 01:08:21,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 36.0) internal successors, (72), 2 states have internal predecessors, (72), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-19 01:08:21,160 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 185 transitions. [2024-11-19 01:08:21,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2024-11-19 01:08:21,164 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:21,164 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:21,184 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:08:21,365 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:08:21,365 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:21,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:21,366 INFO L85 PathProgramCache]: Analyzing trace with hash 454033165, now seen corresponding path program 1 times [2024-11-19 01:08:21,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:08:21,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1811574869] [2024-11-19 01:08:21,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:21,368 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:08:21,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:08:21,369 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:08:21,397 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:08:22,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:22,152 INFO L255 TraceCheckSpWp]: Trace formula consists of 401 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:08:22,176 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:22,618 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:22,619 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:08:22,770 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 192 proven. 0 refuted. 0 times theorem prover too weak. 1108 trivial. 0 not checked. [2024-11-19 01:08:22,770 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:08:22,771 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:08:22,771 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1811574869] [2024-11-19 01:08:22,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1811574869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:22,771 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:22,771 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:08:22,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694144230] [2024-11-19 01:08:22,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:22,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:08:22,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:08:22,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:08:22,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:08:22,776 INFO L87 Difference]: Start difference. First operand 126 states and 185 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-19 01:08:25,655 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:27,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:28,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:30,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:30,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:30,440 INFO L93 Difference]: Finished difference Result 250 states and 368 transitions. [2024-11-19 01:08:30,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:08:30,442 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 195 [2024-11-19 01:08:30,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:30,445 INFO L225 Difference]: With dead ends: 250 [2024-11-19 01:08:30,445 INFO L226 Difference]: Without dead ends: 127 [2024-11-19 01:08:30,446 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 190 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:08:30,447 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 164 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 220 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 220 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:30,447 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 514 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 220 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2024-11-19 01:08:30,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-19 01:08:30,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2024-11-19 01:08:30,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 98 states have (on average 1.346938775510204) internal successors, (132), 98 states have internal predecessors, (132), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 01:08:30,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 184 transitions. [2024-11-19 01:08:30,464 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 184 transitions. Word has length 195 [2024-11-19 01:08:30,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:30,466 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 184 transitions. [2024-11-19 01:08:30,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 5 states have internal predecessors, (71), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-19 01:08:30,466 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 184 transitions. [2024-11-19 01:08:30,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-19 01:08:30,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:30,470 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:30,495 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:08:30,673 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:08:30,674 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:30,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:30,675 INFO L85 PathProgramCache]: Analyzing trace with hash 722940295, now seen corresponding path program 1 times [2024-11-19 01:08:30,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:08:30,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [421706403] [2024-11-19 01:08:30,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:30,676 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:08:30,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:08:30,679 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:08:30,680 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:08:31,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:31,323 INFO L255 TraceCheckSpWp]: Trace formula consists of 407 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 01:08:31,329 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:31,593 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:31,594 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:08:31,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 276 proven. 0 refuted. 0 times theorem prover too weak. 1024 trivial. 0 not checked. [2024-11-19 01:08:31,674 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:08:31,674 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:08:31,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [421706403] [2024-11-19 01:08:31,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [421706403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:31,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:31,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 01:08:31,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [126668074] [2024-11-19 01:08:31,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:31,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 01:08:31,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:08:31,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 01:08:31,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 01:08:31,676 INFO L87 Difference]: Start difference. First operand 126 states and 184 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-19 01:08:35,190 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:36,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:38,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:40,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:40,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:40,429 INFO L93 Difference]: Finished difference Result 250 states and 366 transitions. [2024-11-19 01:08:40,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 01:08:40,430 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 197 [2024-11-19 01:08:40,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:40,432 INFO L225 Difference]: With dead ends: 250 [2024-11-19 01:08:40,432 INFO L226 Difference]: Without dead ends: 127 [2024-11-19 01:08:40,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 01:08:40,434 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 156 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.6s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:40,434 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 508 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 8.6s Time] [2024-11-19 01:08:40,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-19 01:08:40,442 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2024-11-19 01:08:40,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 98 states have (on average 1.336734693877551) internal successors, (131), 98 states have internal predecessors, (131), 26 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2024-11-19 01:08:40,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 183 transitions. [2024-11-19 01:08:40,444 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 183 transitions. Word has length 197 [2024-11-19 01:08:40,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:40,445 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 183 transitions. [2024-11-19 01:08:40,445 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 5 states have internal predecessors, (73), 2 states have call successors, (26), 2 states have call predecessors, (26), 2 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2024-11-19 01:08:40,446 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 183 transitions. [2024-11-19 01:08:40,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-19 01:08:40,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:40,448 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:40,477 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:08:40,649 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:08:40,649 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:40,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:40,650 INFO L85 PathProgramCache]: Analyzing trace with hash 628263501, now seen corresponding path program 1 times [2024-11-19 01:08:40,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:08:40,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [399966187] [2024-11-19 01:08:40,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:40,651 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:08:40,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:08:40,652 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:08:40,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 01:08:41,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:41,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 01:08:41,864 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:41,896 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,905 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,927 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,934 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,937 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,959 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,966 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,970 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,973 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,985 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,992 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:41,996 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:42,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:42,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:42,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:42,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:42,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:42,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:42,022 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:42,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:42,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:42,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:42,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:42,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:42,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 01:08:42,049 INFO L224 Elim1Store]: Index analysis took 157 ms [2024-11-19 01:08:42,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 45 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 100 [2024-11-19 01:08:43,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-19 01:08:43,681 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 01:08:43,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:08:43,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [399966187] [2024-11-19 01:08:43,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [399966187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 01:08:43,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 01:08:43,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 01:08:43,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662557262] [2024-11-19 01:08:43,683 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:43,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:08:43,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:08:43,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:08:43,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 01:08:43,685 INFO L87 Difference]: Start difference. First operand 126 states and 183 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-19 01:08:46,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:48,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:50,087 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:52,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:08:52,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:08:52,668 INFO L93 Difference]: Finished difference Result 373 states and 541 transitions. [2024-11-19 01:08:52,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:08:52,669 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 199 [2024-11-19 01:08:52,670 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:08:52,672 INFO L225 Difference]: With dead ends: 373 [2024-11-19 01:08:52,673 INFO L226 Difference]: Without dead ends: 250 [2024-11-19 01:08:52,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 01:08:52,674 INFO L432 NwaCegarLoop]: 162 mSDtfsCounter, 109 mSDsluCounter, 430 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2024-11-19 01:08:52,675 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 592 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2024-11-19 01:08:52,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-19 01:08:52,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 234. [2024-11-19 01:08:52,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 178 states have (on average 1.3202247191011236) internal successors, (235), 178 states have internal predecessors, (235), 52 states have call successors, (52), 3 states have call predecessors, (52), 3 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2024-11-19 01:08:52,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 339 transitions. [2024-11-19 01:08:52,703 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 339 transitions. Word has length 199 [2024-11-19 01:08:52,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:08:52,704 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 339 transitions. [2024-11-19 01:08:52,705 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 4 states have internal predecessors, (72), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-19 01:08:52,705 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 339 transitions. [2024-11-19 01:08:52,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-19 01:08:52,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:08:52,707 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:08:52,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 01:08:52,908 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:08:52,908 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:08:52,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:08:52,909 INFO L85 PathProgramCache]: Analyzing trace with hash -159308554, now seen corresponding path program 1 times [2024-11-19 01:08:52,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:08:52,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1967696317] [2024-11-19 01:08:52,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:08:52,910 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:08:52,910 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:08:52,913 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:08:52,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 01:08:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:08:54,195 INFO L255 TraceCheckSpWp]: Trace formula consists of 415 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-19 01:08:54,203 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:08:54,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 01:08:54,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-19 01:08:54,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-19 01:08:54,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-19 01:08:54,480 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-19 01:08:54,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-19 01:08:54,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-19 01:08:54,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-19 01:08:54,783 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 15 [2024-11-19 01:08:54,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 26 [2024-11-19 01:08:55,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:55,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 49 [2024-11-19 01:08:55,174 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:55,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 59 treesize of output 61 [2024-11-19 01:08:55,375 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:08:55,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 99 treesize of output 45 [2024-11-19 01:08:55,479 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 619 proven. 48 refuted. 0 times theorem prover too weak. 633 trivial. 0 not checked. [2024-11-19 01:08:55,480 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 01:08:55,922 INFO L134 CoverageAnalysis]: Checked inductivity of 1300 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1300 trivial. 0 not checked. [2024-11-19 01:08:55,922 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 01:08:55,922 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1967696317] [2024-11-19 01:08:55,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1967696317] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-19 01:08:55,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 01:08:55,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11] total 13 [2024-11-19 01:08:55,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939617803] [2024-11-19 01:08:55,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 01:08:55,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 01:08:55,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 01:08:55,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 01:08:55,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-19 01:08:55,925 INFO L87 Difference]: Start difference. First operand 234 states and 339 transitions. Second operand has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-19 01:08:58,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:09:00,772 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:09:02,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:09:05,750 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:09:08,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:09:10,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 01:09:11,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 01:09:11,405 INFO L93 Difference]: Finished difference Result 444 states and 643 transitions. [2024-11-19 01:09:11,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 01:09:11,405 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) Word has length 199 [2024-11-19 01:09:11,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 01:09:11,408 INFO L225 Difference]: With dead ends: 444 [2024-11-19 01:09:11,408 INFO L226 Difference]: Without dead ends: 321 [2024-11-19 01:09:11,409 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 385 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-11-19 01:09:11,410 INFO L432 NwaCegarLoop]: 212 mSDtfsCounter, 93 mSDsluCounter, 507 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 719 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.4s IncrementalHoareTripleChecker+Time [2024-11-19 01:09:11,410 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 719 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 15.4s Time] [2024-11-19 01:09:11,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2024-11-19 01:09:11,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 318. [2024-11-19 01:09:11,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 253 states have (on average 1.3399209486166008) internal successors, (339), 254 states have internal predecessors, (339), 60 states have call successors, (60), 4 states have call predecessors, (60), 4 states have return successors, (60), 59 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-19 01:09:11,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 459 transitions. [2024-11-19 01:09:11,455 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 459 transitions. Word has length 199 [2024-11-19 01:09:11,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 01:09:11,456 INFO L471 AbstractCegarLoop]: Abstraction has 318 states and 459 transitions. [2024-11-19 01:09:11,456 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.4) internal successors, (72), 5 states have internal predecessors, (72), 1 states have call successors, (26), 1 states have call predecessors, (26), 1 states have return successors, (26), 1 states have call predecessors, (26), 1 states have call successors, (26) [2024-11-19 01:09:11,457 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 459 transitions. [2024-11-19 01:09:11,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-19 01:09:11,458 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 01:09:11,459 INFO L215 NwaCegarLoop]: trace histogram [26, 26, 26, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:09:11,492 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 01:09:11,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 01:09:11,660 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-19 01:09:11,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 01:09:11,660 INFO L85 PathProgramCache]: Analyzing trace with hash -45882852, now seen corresponding path program 1 times [2024-11-19 01:09:11,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 01:09:11,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946892145] [2024-11-19 01:09:11,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 01:09:11,661 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:09:11,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 01:09:11,662 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 01:09:11,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 01:09:14,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 01:09:14,121 INFO L255 TraceCheckSpWp]: Trace formula consists of 417 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-11-19 01:09:14,132 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 01:09:14,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 01:09:14,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 133 treesize of output 79 [2024-11-19 01:09:16,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:09:16,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 270 treesize of output 135 [2024-11-19 01:09:21,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 01:09:21,853 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 275 treesize of output 158