./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-35.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d 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-35.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 57a4c1dd1a0e1e63afb50ba676ccfd7082f02bfe1ee31d7489d2556da0377f27 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:01:59,637 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:01:59,717 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-09 02:01:59,722 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:01:59,722 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:01:59,766 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:01:59,766 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:01:59,767 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:01:59,767 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:01:59,769 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:01:59,769 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:01:59,769 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:01:59,770 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:01:59,770 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:01:59,770 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:01:59,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:01:59,771 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:01:59,771 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:01:59,772 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 02:01:59,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:01:59,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:01:59,774 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:01:59,774 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:01:59,774 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:01:59,775 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:01:59,775 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:01:59,775 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:01:59,775 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:01:59,776 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:01:59,776 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:01:59,776 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:01:59,776 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:01:59,777 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:01:59,777 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:01:59,777 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:01:59,778 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:01:59,778 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 02:01:59,778 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 02:01:59,778 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:01:59,779 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:01:59,779 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:01:59,779 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:01:59,779 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 -> 57a4c1dd1a0e1e63afb50ba676ccfd7082f02bfe1ee31d7489d2556da0377f27 [2024-11-09 02:02:00,013 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:02:00,039 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:02:00,042 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:02:00,043 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:02:00,043 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:02:00,044 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-35.i [2024-11-09 02:02:01,568 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:02:01,774 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:02:01,774 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-35.i [2024-11-09 02:02:01,784 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09ecc8f9c/0dcbb255ba2d4c5689c01a134b9d74af/FLAGf7c1bc9fc [2024-11-09 02:02:01,799 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09ecc8f9c/0dcbb255ba2d4c5689c01a134b9d74af [2024-11-09 02:02:01,801 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:02:01,802 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:02:01,803 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:02:01,804 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:02:01,810 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:02:01,811 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:02:01" (1/1) ... [2024-11-09 02:02:01,812 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26257ace and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:01, skipping insertion in model container [2024-11-09 02:02:01,812 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:02:01" (1/1) ... [2024-11-09 02:02:01,842 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:02:01,999 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-35.i[916,929] [2024-11-09 02:02:02,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:02:02,096 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:02:02,107 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-35.i[916,929] [2024-11-09 02:02:02,145 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:02:02,170 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:02:02,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:02 WrapperNode [2024-11-09 02:02:02,171 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:02:02,172 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:02:02,172 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:02:02,172 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:02:02,178 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:02" (1/1) ... [2024-11-09 02:02:02,191 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:02" (1/1) ... [2024-11-09 02:02:02,227 INFO L138 Inliner]: procedures = 30, calls = 148, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 413 [2024-11-09 02:02:02,227 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:02:02,228 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:02:02,228 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:02:02,228 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:02:02,237 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:02" (1/1) ... [2024-11-09 02:02:02,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:02" (1/1) ... [2024-11-09 02:02:02,243 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:02" (1/1) ... [2024-11-09 02:02:02,251 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-09 02:02:02,251 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:02" (1/1) ... [2024-11-09 02:02:02,255 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:02" (1/1) ... [2024-11-09 02:02:02,282 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:02" (1/1) ... [2024-11-09 02:02:02,288 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:02" (1/1) ... [2024-11-09 02:02:02,294 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:02" (1/1) ... [2024-11-09 02:02:02,297 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:02" (1/1) ... [2024-11-09 02:02:02,304 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:02:02,305 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:02:02,306 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:02:02,306 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:02:02,307 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:02" (1/1) ... [2024-11-09 02:02:02,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:02:02,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:02:02,345 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-09 02:02:02,353 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-09 02:02:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:02:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2024-11-09 02:02:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~real [2024-11-09 02:02:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-09 02:02:02,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~real [2024-11-09 02:02:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure write~real [2024-11-09 02:02:02,403 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2024-11-09 02:02:02,404 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:02:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:02:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2024-11-09 02:02:02,405 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:02:02,405 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:02:02,525 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:02:02,527 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:02:03,079 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2024-11-09 02:02:03,079 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:02:03,100 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:02:03,103 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:02:03,104 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:02:03 BoogieIcfgContainer [2024-11-09 02:02:03,105 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:02:03,107 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:02:03,108 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:02:03,112 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:02:03,112 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:02:01" (1/3) ... [2024-11-09 02:02:03,113 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50fcea79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:02:03, skipping insertion in model container [2024-11-09 02:02:03,113 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:02" (2/3) ... [2024-11-09 02:02:03,114 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@50fcea79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:02:03, skipping insertion in model container [2024-11-09 02:02:03,114 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:02:03" (3/3) ... [2024-11-09 02:02:03,115 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-35.i [2024-11-09 02:02:03,132 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:02:03,133 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:02:03,204 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:02:03,210 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7c222f94, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:02:03,212 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:02:03,217 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 80 states have (on average 1.375) internal successors, (110), 81 states have internal predecessors, (110), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 02:02:03,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 02:02:03,237 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:03,238 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:02:03,239 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:03,244 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:03,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1594498760, now seen corresponding path program 1 times [2024-11-09 02:02:03,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:02:03,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829916567] [2024-11-09 02:02:03,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:03,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:02:03,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:03,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-11-09 02:02:03,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:03,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-09 02:02:03,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:03,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 02:02:03,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:03,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-09 02:02:03,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:03,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-09 02:02:03,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:03,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-09 02:02:03,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:03,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-09 02:02:03,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:03,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-09 02:02:03,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:03,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-09 02:02:03,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:03,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-09 02:02:03,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:03,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-09 02:02:03,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:03,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-09 02:02:03,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:03,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-09 02:02:03,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:03,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-09 02:02:03,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:03,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-09 02:02:03,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:03,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-09 02:02:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:03,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2024-11-09 02:02:03,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:03,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2024-11-09 02:02:03,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:03,847 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2024-11-09 02:02:03,847 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 02:02:03,848 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829916567] [2024-11-09 02:02:03,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829916567] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:02:03,849 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:02:03,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:02:03,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87420679] [2024-11-09 02:02:03,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:02:03,857 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:02:03,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 02:02:03,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:02:03,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:02:03,883 INFO L87 Difference]: Start difference. First operand has 101 states, 80 states have (on average 1.375) internal successors, (110), 81 states have internal predecessors, (110), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 02:02:03,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:02:03,912 INFO L93 Difference]: Finished difference Result 195 states and 304 transitions. [2024-11-09 02:02:03,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:02:03,915 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) Word has length 143 [2024-11-09 02:02:03,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:02:03,925 INFO L225 Difference]: With dead ends: 195 [2024-11-09 02:02:03,926 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 02:02:03,930 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 56 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-09 02:02:03,935 INFO L432 NwaCegarLoop]: 138 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, 138 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-09 02:02:03,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:02:03,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 02:02:03,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-09 02:02:03,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 02:02:03,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 138 transitions. [2024-11-09 02:02:03,986 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 138 transitions. Word has length 143 [2024-11-09 02:02:03,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:02:03,987 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 138 transitions. [2024-11-09 02:02:03,988 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 28.0) internal successors, (56), 2 states have internal predecessors, (56), 2 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 1 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 02:02:03,988 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2024-11-09 02:02:03,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 02:02:03,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:03,993 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:02:03,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 02:02:03,994 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:03,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:03,995 INFO L85 PathProgramCache]: Analyzing trace with hash -1876003112, now seen corresponding path program 1 times [2024-11-09 02:02:03,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 02:02:03,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1745055331] [2024-11-09 02:02:03,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:03,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 02:02:04,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:02:04,297 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 02:02:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 02:02:04,490 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 02:02:04,492 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 02:02:04,494 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-09 02:02:04,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 02:02:04,499 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-09 02:02:04,585 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 02:02:04,592 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 02:02:04 BoogieIcfgContainer [2024-11-09 02:02:04,593 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 02:02:04,593 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 02:02:04,594 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 02:02:04,594 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 02:02:04,595 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:02:03" (3/4) ... [2024-11-09 02:02:04,597 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 02:02:04,598 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 02:02:04,599 INFO L158 Benchmark]: Toolchain (without parser) took 2796.58ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 117.4MB in the beginning and 122.4MB in the end (delta: -5.1MB). Peak memory consumption was 78.8MB. Max. memory is 16.1GB. [2024-11-09 02:02:04,601 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 176.2MB. Free memory is still 139.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:02:04,601 INFO L158 Benchmark]: CACSL2BoogieTranslator took 368.01ms. Allocated memory is still 176.2MB. Free memory was 117.4MB in the beginning and 99.2MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-09 02:02:04,602 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.46ms. Allocated memory is still 176.2MB. Free memory was 99.2MB in the beginning and 95.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 02:02:04,602 INFO L158 Benchmark]: Boogie Preprocessor took 76.54ms. Allocated memory is still 176.2MB. Free memory was 95.0MB in the beginning and 91.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 02:02:04,602 INFO L158 Benchmark]: RCFGBuilder took 799.30ms. Allocated memory is still 176.2MB. Free memory was 91.5MB in the beginning and 60.8MB in the end (delta: 30.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-09 02:02:04,603 INFO L158 Benchmark]: TraceAbstraction took 1486.25ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 60.0MB in the beginning and 122.4MB in the end (delta: -62.4MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2024-11-09 02:02:04,603 INFO L158 Benchmark]: Witness Printer took 4.92ms. Allocated memory is still 255.9MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 02:02:04,608 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.20ms. Allocated memory is still 176.2MB. Free memory is still 139.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 368.01ms. Allocated memory is still 176.2MB. Free memory was 117.4MB in the beginning and 99.2MB in the end (delta: 18.2MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.46ms. Allocated memory is still 176.2MB. Free memory was 99.2MB in the beginning and 95.0MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 76.54ms. Allocated memory is still 176.2MB. Free memory was 95.0MB in the beginning and 91.5MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 799.30ms. Allocated memory is still 176.2MB. Free memory was 91.5MB in the beginning and 60.8MB in the end (delta: 30.7MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 1486.25ms. Allocated memory was 176.2MB in the beginning and 255.9MB in the end (delta: 79.7MB). Free memory was 60.0MB in the beginning and 122.4MB in the end (delta: -62.4MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * Witness Printer took 4.92ms. Allocated memory is still 255.9MB. Free memory is still 122.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 123, overapproximation of someUnaryDOUBLEoperation at line 43, overapproximation of someBinaryArithmeticFLOAToperation at line 63. Possible FailurePath: [L39] unsigned char isInitial = 0; [L40-L56] struct WrapperStruct00 WrapperStruct00 = { 4.8, 255.1, -0.6, -10, 1, -2, 10, 5, -1, 1, 0, 1, 5, 64, 5 }; [L57] unsigned char last_1_WrapperStruct00_var_1_18 = 5; VAL [WrapperStruct00={4:0}, isInitial=0, last_1_WrapperStruct00_var_1_18=5] [L127] isInitial = 1 [L128] FCALL initially() [L129] COND TRUE 1 [L130] CALL updateLastVariables() [L120] EXPR WrapperStruct00.var_1_18 [L120] last_1_WrapperStruct00_var_1_18 = WrapperStruct00.var_1_18 [L130] RET updateLastVariables() [L131] CALL updateVariables() [L90] WrapperStruct00.var_1_4 = __VERIFIER_nondet_float() [L91] EXPR WrapperStruct00.var_1_4 [L91] EXPR WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F [L91] EXPR WrapperStruct00.var_1_4 [L91] EXPR WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L91] EXPR (WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L91] CALL assume_abort_if_not((WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L91] RET assume_abort_if_not((WrapperStruct00.var_1_4 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_4 <= -1.0e-20F) || (WrapperStruct00.var_1_4 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_4 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L92] WrapperStruct00.var_1_5 = __VERIFIER_nondet_float() [L93] EXPR WrapperStruct00.var_1_5 [L93] EXPR WrapperStruct00.var_1_5 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F [L93] EXPR WrapperStruct00.var_1_5 [L93] EXPR WrapperStruct00.var_1_5 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L93] EXPR (WrapperStruct00.var_1_5 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F ) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L93] CALL assume_abort_if_not((WrapperStruct00.var_1_5 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L20] COND FALSE !(!cond) VAL [WrapperStruct00={4:0}, \old(cond)=1, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L93] RET assume_abort_if_not((WrapperStruct00.var_1_5 >= -461168.6018427382800e+13F && WrapperStruct00.var_1_5 <= -1.0e-20F) || (WrapperStruct00.var_1_5 <= 4611686.018427382800e+12F && WrapperStruct00.var_1_5 >= 1.0e-20F )) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L94] WrapperStruct00.var_1_8 = __VERIFIER_nondet_uchar() [L95] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L95] CALL assume_abort_if_not(WrapperStruct00.var_1_8 >= 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] [L95] RET assume_abort_if_not(WrapperStruct00.var_1_8 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L96] EXPR WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L96] CALL assume_abort_if_not(WrapperStruct00.var_1_8 <= 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] [L96] RET assume_abort_if_not(WrapperStruct00.var_1_8 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L97] WrapperStruct00.var_1_12 = __VERIFIER_nondet_char() [L98] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L98] CALL assume_abort_if_not(WrapperStruct00.var_1_12 >= -31) 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] [L98] RET assume_abort_if_not(WrapperStruct00.var_1_12 >= -31) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L99] EXPR WrapperStruct00.var_1_12 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L99] CALL assume_abort_if_not(WrapperStruct00.var_1_12 <= 32) 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_12 <= 32) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L100] WrapperStruct00.var_1_13 = __VERIFIER_nondet_char() [L101] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L101] CALL assume_abort_if_not(WrapperStruct00.var_1_13 >= -31) 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_13 >= -31) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L102] EXPR WrapperStruct00.var_1_13 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L102] CALL assume_abort_if_not(WrapperStruct00.var_1_13 <= 31) 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] [L102] RET assume_abort_if_not(WrapperStruct00.var_1_13 <= 31) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L103] WrapperStruct00.var_1_14 = __VERIFIER_nondet_char() [L104] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L104] CALL assume_abort_if_not(WrapperStruct00.var_1_14 >= -63) 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] [L104] RET assume_abort_if_not(WrapperStruct00.var_1_14 >= -63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L105] EXPR WrapperStruct00.var_1_14 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L105] CALL assume_abort_if_not(WrapperStruct00.var_1_14 <= 63) 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_14 <= 63) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L106] WrapperStruct00.var_1_16 = __VERIFIER_nondet_uchar() [L107] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L107] CALL assume_abort_if_not(WrapperStruct00.var_1_16 >= 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_16 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L108] EXPR WrapperStruct00.var_1_16 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L108] CALL assume_abort_if_not(WrapperStruct00.var_1_16 <= 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] [L108] RET assume_abort_if_not(WrapperStruct00.var_1_16 <= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L109] WrapperStruct00.var_1_17 = __VERIFIER_nondet_uchar() [L110] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L110] CALL assume_abort_if_not(WrapperStruct00.var_1_17 >= 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_17 >= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L111] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L111] CALL assume_abort_if_not(WrapperStruct00.var_1_17 <= 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_17 <= 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L112] WrapperStruct00.var_1_19 = __VERIFIER_nondet_uchar() [L113] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L113] CALL assume_abort_if_not(WrapperStruct00.var_1_19 >= 32) 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_19 >= 32) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L114] EXPR WrapperStruct00.var_1_19 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L114] CALL assume_abort_if_not(WrapperStruct00.var_1_19 <= 64) 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_19 <= 64) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L115] WrapperStruct00.var_1_20 = __VERIFIER_nondet_uchar() [L116] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L116] 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] [L116] RET assume_abort_if_not(WrapperStruct00.var_1_20 >= 0) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L117] EXPR WrapperStruct00.var_1_20 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L117] CALL assume_abort_if_not(WrapperStruct00.var_1_20 <= 32) 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_20 <= 32) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L131] RET updateVariables() [L132] CALL step() [L61] signed long int stepLocal_0 = ~ last_1_WrapperStruct00_var_1_18; VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5, stepLocal_0=-6] [L62] COND TRUE last_1_WrapperStruct00_var_1_18 >= stepLocal_0 [L63] EXPR WrapperStruct00.var_1_4 [L63] EXPR WrapperStruct00.var_1_5 [L63] WrapperStruct00.var_1_1 = (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5) [L65] EXPR WrapperStruct00.var_1_1 [L65] EXPR WrapperStruct00.var_1_5 [L65] EXPR WrapperStruct00.var_1_4 [L65] unsigned char stepLocal_1 = (WrapperStruct00.var_1_1 * WrapperStruct00.var_1_5) >= WrapperStruct00.var_1_4; [L66] EXPR WrapperStruct00.var_1_17 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5, stepLocal_1=1] [L66] COND TRUE WrapperStruct00.var_1_17 && stepLocal_1 [L67] EXPR WrapperStruct00.var_1_19 [L67] EXPR WrapperStruct00.var_1_20 [L67] WrapperStruct00.var_1_18 = (2 + ((WrapperStruct00.var_1_19 - WrapperStruct00.var_1_20) + 32)) [L71] WrapperStruct00.var_1_8 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L71] COND FALSE !(WrapperStruct00.var_1_8) [L74] EXPR WrapperStruct00.var_1_17 [L74] WrapperStruct00.var_1_15 = (! WrapperStruct00.var_1_17) [L76] WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L76] COND FALSE !(WrapperStruct00.var_1_15) [L79] WrapperStruct00.var_1_15 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L79] COND FALSE !(WrapperStruct00.var_1_15) [L86] EXPR WrapperStruct00.var_1_11 [L86] WrapperStruct00.var_1_6 = WrapperStruct00.var_1_11 [L132] RET step() [L133] CALL, EXPR property() [L123] EXPR (last_1_WrapperStruct00_var_1_18 >= (~ last_1_WrapperStruct00_var_1_18)) ? (WrapperStruct00.var_1_1 == ((float) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1 [L123] EXPR WrapperStruct00.var_1_1 [L123] EXPR WrapperStruct00.var_1_4 [L123] EXPR WrapperStruct00.var_1_5 [L123] EXPR (last_1_WrapperStruct00_var_1_18 >= (~ last_1_WrapperStruct00_var_1_18)) ? (WrapperStruct00.var_1_1 == ((float) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1 VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L123] EXPR ((last_1_WrapperStruct00_var_1_18 >= (~ last_1_WrapperStruct00_var_1_18)) ? (WrapperStruct00.var_1_1 == ((float) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1) && (WrapperStruct00.var_1_15 ? (WrapperStruct00.var_1_15 ? (WrapperStruct00.var_1_6 == ((signed short int) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_6 == ((signed short int) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_11)))) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_11))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L123] EXPR (((last_1_WrapperStruct00_var_1_18 >= (~ last_1_WrapperStruct00_var_1_18)) ? (WrapperStruct00.var_1_1 == ((float) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1) && (WrapperStruct00.var_1_15 ? (WrapperStruct00.var_1_15 ? (WrapperStruct00.var_1_6 == ((signed short int) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_6 == ((signed short int) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_11)))) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_11)))) && (WrapperStruct00.var_1_15 ? (WrapperStruct00.var_1_11 == ((signed char) ((WrapperStruct00.var_1_12 + ((((10) < (WrapperStruct00.var_1_13)) ? (10) : (WrapperStruct00.var_1_13)))) + WrapperStruct00.var_1_14))) : 1) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L123] EXPR ((((last_1_WrapperStruct00_var_1_18 >= (~ last_1_WrapperStruct00_var_1_18)) ? (WrapperStruct00.var_1_1 == ((float) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1) && (WrapperStruct00.var_1_15 ? (WrapperStruct00.var_1_15 ? (WrapperStruct00.var_1_6 == ((signed short int) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_6 == ((signed short int) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_11)))) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_11)))) && (WrapperStruct00.var_1_15 ? (WrapperStruct00.var_1_11 == ((signed char) ((WrapperStruct00.var_1_12 + ((((10) < (WrapperStruct00.var_1_13)) ? (10) : (WrapperStruct00.var_1_13)))) + WrapperStruct00.var_1_14))) : 1)) && (WrapperStruct00.var_1_8 ? (WrapperStruct00.var_1_15 == ((unsigned char) (! WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_15 == ((unsigned char) (! WrapperStruct00.var_1_17)))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L123] EXPR (((((last_1_WrapperStruct00_var_1_18 >= (~ last_1_WrapperStruct00_var_1_18)) ? (WrapperStruct00.var_1_1 == ((float) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1) && (WrapperStruct00.var_1_15 ? (WrapperStruct00.var_1_15 ? (WrapperStruct00.var_1_6 == ((signed short int) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_6 == ((signed short int) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_11)))) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_11)))) && (WrapperStruct00.var_1_15 ? (WrapperStruct00.var_1_11 == ((signed char) ((WrapperStruct00.var_1_12 + ((((10) < (WrapperStruct00.var_1_13)) ? (10) : (WrapperStruct00.var_1_13)))) + WrapperStruct00.var_1_14))) : 1)) && (WrapperStruct00.var_1_8 ? (WrapperStruct00.var_1_15 == ((unsigned char) (! WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_15 == ((unsigned char) (! WrapperStruct00.var_1_17))))) && ((WrapperStruct00.var_1_17 && ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_5) >= WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_18 == ((unsigned char) (2 + ((WrapperStruct00.var_1_19 - WrapperStruct00.var_1_20) + 32)))) : (WrapperStruct00.var_1_18 == ((unsigned char) WrapperStruct00.var_1_19))) VAL [WrapperStruct00={4:0}, isInitial=1, last_1_WrapperStruct00_var_1_18=5] [L123-L124] return (((((last_1_WrapperStruct00_var_1_18 >= (~ last_1_WrapperStruct00_var_1_18)) ? (WrapperStruct00.var_1_1 == ((float) (WrapperStruct00.var_1_4 + WrapperStruct00.var_1_5))) : 1) && (WrapperStruct00.var_1_15 ? (WrapperStruct00.var_1_15 ? (WrapperStruct00.var_1_6 == ((signed short int) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_11))) : (WrapperStruct00.var_1_6 == ((signed short int) (WrapperStruct00.var_1_11 + WrapperStruct00.var_1_11)))) : (WrapperStruct00.var_1_6 == ((signed short int) WrapperStruct00.var_1_11)))) && (WrapperStruct00.var_1_15 ? (WrapperStruct00.var_1_11 == ((signed char) ((WrapperStruct00.var_1_12 + ((((10) < (WrapperStruct00.var_1_13)) ? (10) : (WrapperStruct00.var_1_13)))) + WrapperStruct00.var_1_14))) : 1)) && (WrapperStruct00.var_1_8 ? (WrapperStruct00.var_1_15 == ((unsigned char) (! WrapperStruct00.var_1_16))) : (WrapperStruct00.var_1_15 == ((unsigned char) (! WrapperStruct00.var_1_17))))) && ((WrapperStruct00.var_1_17 && ((WrapperStruct00.var_1_1 * WrapperStruct00.var_1_5) >= WrapperStruct00.var_1_4)) ? (WrapperStruct00.var_1_18 == ((unsigned char) (2 + ((WrapperStruct00.var_1_19 - WrapperStruct00.var_1_20) + 32)))) : (WrapperStruct00.var_1_18 == ((unsigned char) WrapperStruct00.var_1_19))) ; [L133] RET, EXPR property() [L133] 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, 101 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.3s, OverallIterations: 2, TraceHistogramMax: 18, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 138 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 138 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 56 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=101occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 286 NumberOfCodeBlocks, 286 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 142 ConstructedInterpolants, 0 QuantifiedInterpolants, 142 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 1 InterpolantComputations, 1 PerfectInterpolantSequences, 612/612 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-09 02:02:04,642 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-35.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 57a4c1dd1a0e1e63afb50ba676ccfd7082f02bfe1ee31d7489d2556da0377f27 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 02:02:06,973 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 02:02:07,057 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-09 02:02:07,062 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 02:02:07,064 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 02:02:07,097 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 02:02:07,100 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 02:02:07,100 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 02:02:07,101 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 02:02:07,101 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 02:02:07,102 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 02:02:07,102 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 02:02:07,103 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 02:02:07,104 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 02:02:07,104 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 02:02:07,106 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 02:02:07,106 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-09 02:02:07,106 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 02:02:07,106 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 02:02:07,107 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 02:02:07,107 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-09 02:02:07,111 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 02:02:07,111 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-09 02:02:07,111 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 02:02:07,111 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 02:02:07,112 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 02:02:07,112 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 02:02:07,112 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 02:02:07,112 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-09 02:02:07,113 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 02:02:07,114 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 02:02:07,114 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 02:02:07,114 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 02:02:07,115 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 02:02:07,115 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:02:07,115 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 02:02:07,116 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 02:02:07,116 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-09 02:02:07,116 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 02:02:07,117 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 02:02:07,117 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 02:02:07,117 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 02:02:07,117 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 02:02:07,117 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 02:02:07,118 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 -> 57a4c1dd1a0e1e63afb50ba676ccfd7082f02bfe1ee31d7489d2556da0377f27 [2024-11-09 02:02:07,457 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 02:02:07,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 02:02:07,485 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 02:02:07,486 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 02:02:07,487 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 02:02:07,489 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-35.i [2024-11-09 02:02:08,971 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 02:02:09,193 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 02:02:09,194 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_wrapper-s_file-35.i [2024-11-09 02:02:09,206 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6690197df/a8dbecf40da646d788424dac8d4938a7/FLAG38c290f5f [2024-11-09 02:02:09,548 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6690197df/a8dbecf40da646d788424dac8d4938a7 [2024-11-09 02:02:09,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 02:02:09,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 02:02:09,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 02:02:09,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 02:02:09,560 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 02:02:09,561 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:02:09" (1/1) ... [2024-11-09 02:02:09,561 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22dedbcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:09, skipping insertion in model container [2024-11-09 02:02:09,562 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 02:02:09" (1/1) ... [2024-11-09 02:02:09,588 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 02:02:09,793 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-35.i[916,929] [2024-11-09 02:02:09,861 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:02:09,879 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 02:02:09,891 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-35.i[916,929] [2024-11-09 02:02:09,945 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 02:02:09,973 INFO L204 MainTranslator]: Completed translation [2024-11-09 02:02:09,973 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:09 WrapperNode [2024-11-09 02:02:09,974 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 02:02:09,975 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 02:02:09,975 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 02:02:09,975 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 02:02:09,982 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:09" (1/1) ... [2024-11-09 02:02:10,007 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:09" (1/1) ... [2024-11-09 02:02:10,055 INFO L138 Inliner]: procedures = 34, calls = 148, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 409 [2024-11-09 02:02:10,055 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 02:02:10,056 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 02:02:10,056 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 02:02:10,056 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 02:02:10,068 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:09" (1/1) ... [2024-11-09 02:02:10,069 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:09" (1/1) ... [2024-11-09 02:02:10,081 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:09" (1/1) ... [2024-11-09 02:02:10,111 INFO L175 MemorySlicer]: Split 119 memory accesses to 2 slices as follows [2, 117]. 98 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 35 writes are split as follows [0, 35]. [2024-11-09 02:02:10,118 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:09" (1/1) ... [2024-11-09 02:02:10,119 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:09" (1/1) ... [2024-11-09 02:02:10,156 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:09" (1/1) ... [2024-11-09 02:02:10,160 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:09" (1/1) ... [2024-11-09 02:02:10,163 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:09" (1/1) ... [2024-11-09 02:02:10,165 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:09" (1/1) ... [2024-11-09 02:02:10,172 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 02:02:10,173 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 02:02:10,173 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 02:02:10,173 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 02:02:10,174 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:09" (1/1) ... [2024-11-09 02:02:10,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 02:02:10,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 02:02:10,216 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-09 02:02:10,226 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-09 02:02:10,269 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 02:02:10,269 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#0 [2024-11-09 02:02:10,270 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1#1 [2024-11-09 02:02:10,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 02:02:10,270 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 02:02:10,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#0 [2024-11-09 02:02:10,271 INFO L130 BoogieDeclarations]: Found specification of procedure read~intFLOATTYPE4#1 [2024-11-09 02:02:10,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#0 [2024-11-09 02:02:10,272 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE2#1 [2024-11-09 02:02:10,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#0 [2024-11-09 02:02:10,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~intFLOATTYPE4#1 [2024-11-09 02:02:10,272 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#0 [2024-11-09 02:02:10,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE2#1 [2024-11-09 02:02:10,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#0 [2024-11-09 02:02:10,273 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1#1 [2024-11-09 02:02:10,273 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 02:02:10,274 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 02:02:10,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#0 [2024-11-09 02:02:10,274 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intFLOATTYPE4#1 [2024-11-09 02:02:10,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 02:02:10,275 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 02:02:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#0 [2024-11-09 02:02:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE1#1 [2024-11-09 02:02:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#0 [2024-11-09 02:02:10,275 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE2#1 [2024-11-09 02:02:10,428 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 02:02:10,430 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 02:02:11,514 INFO L? ?]: Removed 83 outVars from TransFormulas that were not future-live. [2024-11-09 02:02:11,515 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 02:02:11,532 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 02:02:11,532 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-09 02:02:11,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:02:11 BoogieIcfgContainer [2024-11-09 02:02:11,533 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 02:02:11,536 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 02:02:11,537 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 02:02:11,540 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 02:02:11,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 02:02:09" (1/3) ... [2024-11-09 02:02:11,541 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0b98d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:02:11, skipping insertion in model container [2024-11-09 02:02:11,541 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 02:02:09" (2/3) ... [2024-11-09 02:02:11,542 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b0b98d6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 02:02:11, skipping insertion in model container [2024-11-09 02:02:11,542 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 02:02:11" (3/3) ... [2024-11-09 02:02:11,544 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_wrapper-s_file-35.i [2024-11-09 02:02:11,560 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 02:02:11,560 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-09 02:02:11,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 02:02:11,620 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;@38ac159b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 02:02:11,621 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-09 02:02:11,625 INFO L276 IsEmpty]: Start isEmpty. Operand has 101 states, 80 states have (on average 1.375) internal successors, (110), 81 states have internal predecessors, (110), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 02:02:11,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 02:02:11,641 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:11,642 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:02:11,642 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:11,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:11,647 INFO L85 PathProgramCache]: Analyzing trace with hash 82601040, now seen corresponding path program 1 times [2024-11-09 02:02:11,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:02:11,658 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [751461047] [2024-11-09 02:02:11,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:11,659 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-09 02:02:11,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:02:11,660 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-09 02:02:11,662 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-09 02:02:12,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:12,065 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 02:02:12,074 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:02:12,115 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 314 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-09 02:02:12,115 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 02:02:12,115 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:02:12,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [751461047] [2024-11-09 02:02:12,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [751461047] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 02:02:12,116 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 02:02:12,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 02:02:12,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1447915647] [2024-11-09 02:02:12,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 02:02:12,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 02:02:12,128 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:02:12,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 02:02:12,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 02:02:12,149 INFO L87 Difference]: Start difference. First operand has 101 states, 80 states have (on average 1.375) internal successors, (110), 81 states have internal predecessors, (110), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 02:02:12,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:02:12,178 INFO L93 Difference]: Finished difference Result 195 states and 304 transitions. [2024-11-09 02:02:12,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 02:02:12,181 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 143 [2024-11-09 02:02:12,182 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:02:12,188 INFO L225 Difference]: With dead ends: 195 [2024-11-09 02:02:12,188 INFO L226 Difference]: Without dead ends: 97 [2024-11-09 02:02:12,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 142 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-09 02:02:12,194 INFO L432 NwaCegarLoop]: 138 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, 138 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-09 02:02:12,195 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 02:02:12,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-11-09 02:02:12,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2024-11-09 02:02:12,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 77 states have (on average 1.3246753246753247) internal successors, (102), 77 states have internal predecessors, (102), 18 states have call successors, (18), 1 states have call predecessors, (18), 1 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2024-11-09 02:02:12,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 138 transitions. [2024-11-09 02:02:12,248 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 138 transitions. Word has length 143 [2024-11-09 02:02:12,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:02:12,250 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 138 transitions. [2024-11-09 02:02:12,250 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 30.0) internal successors, (60), 2 states have internal predecessors, (60), 2 states have call successors, (18), 2 states have call predecessors, (18), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2024-11-09 02:02:12,251 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 138 transitions. [2024-11-09 02:02:12,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 02:02:12,257 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:12,257 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:02:12,268 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-09 02:02:12,458 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-09 02:02:12,459 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:12,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:12,460 INFO L85 PathProgramCache]: Analyzing trace with hash -198903312, now seen corresponding path program 1 times [2024-11-09 02:02:12,461 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:02:12,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1621794716] [2024-11-09 02:02:12,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:12,461 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-09 02:02:12,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:02:12,465 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-09 02:02:12,466 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-09 02:02:13,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:13,030 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 02:02:13,045 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:02:13,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 02:02:13,216 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-09 02:02:13,287 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 26 treesize of output 25 [2024-11-09 02:02:13,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:02:13,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 28 [2024-11-09 02:02:13,685 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:02:13,686 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 28 [2024-11-09 02:02:13,724 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:02:13,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 39 [2024-11-09 02:02:13,826 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 97 treesize of output 73 [2024-11-09 02:02:13,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 02:02:13,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:02:13,842 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 73 treesize of output 107 [2024-11-09 02:02:13,924 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 45 [2024-11-09 02:02:14,020 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:02:14,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 58 treesize of output 22 [2024-11-09 02:02:14,051 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 335 proven. 18 refuted. 0 times theorem prover too weak. 259 trivial. 0 not checked. [2024-11-09 02:02:14,052 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:02:14,455 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 33 proven. 18 refuted. 0 times theorem prover too weak. 561 trivial. 0 not checked. [2024-11-09 02:02:14,456 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:02:14,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1621794716] [2024-11-09 02:02:14,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1621794716] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 02:02:14,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 02:02:14,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2024-11-09 02:02:14,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298398977] [2024-11-09 02:02:14,457 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 02:02:14,463 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-09 02:02:14,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 02:02:14,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-09 02:02:14,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-09 02:02:14,466 INFO L87 Difference]: Start difference. First operand 97 states and 138 transitions. Second operand has 15 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 15 states have internal predecessors, (82), 5 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (25), 3 states have call predecessors, (25), 5 states have call successors, (25) [2024-11-09 02:02:19,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 02:02:19,892 INFO L93 Difference]: Finished difference Result 461 states and 642 transitions. [2024-11-09 02:02:19,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2024-11-09 02:02:19,893 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 15 states have internal predecessors, (82), 5 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (25), 3 states have call predecessors, (25), 5 states have call successors, (25) Word has length 143 [2024-11-09 02:02:19,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 02:02:19,898 INFO L225 Difference]: With dead ends: 461 [2024-11-09 02:02:19,901 INFO L226 Difference]: Without dead ends: 367 [2024-11-09 02:02:19,903 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 272 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 430 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=396, Invalid=1410, Unknown=0, NotChecked=0, Total=1806 [2024-11-09 02:02:19,905 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 600 mSDsluCounter, 695 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 632 SdHoareTripleChecker+Valid, 823 SdHoareTripleChecker+Invalid, 1729 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-11-09 02:02:19,906 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [632 Valid, 823 Invalid, 1729 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 1474 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-11-09 02:02:19,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 367 states. [2024-11-09 02:02:19,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 367 to 180. [2024-11-09 02:02:19,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 147 states have (on average 1.3265306122448979) internal successors, (195), 148 states have internal predecessors, (195), 28 states have call successors, (28), 4 states have call predecessors, (28), 4 states have return successors, (28), 27 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-09 02:02:19,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 251 transitions. [2024-11-09 02:02:19,979 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 251 transitions. Word has length 143 [2024-11-09 02:02:19,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 02:02:19,980 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 251 transitions. [2024-11-09 02:02:19,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 6.3076923076923075) internal successors, (82), 15 states have internal predecessors, (82), 5 states have call successors, (25), 3 states have call predecessors, (25), 5 states have return successors, (25), 3 states have call predecessors, (25), 5 states have call successors, (25) [2024-11-09 02:02:19,980 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 251 transitions. [2024-11-09 02:02:19,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2024-11-09 02:02:19,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 02:02:19,983 INFO L215 NwaCegarLoop]: trace histogram [18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-09 02:02:19,998 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-09 02:02:20,184 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-09 02:02:20,184 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-09 02:02:20,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 02:02:20,185 INFO L85 PathProgramCache]: Analyzing trace with hash -1887847054, now seen corresponding path program 1 times [2024-11-09 02:02:20,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 02:02:20,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [983039664] [2024-11-09 02:02:20,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:02:20,186 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-09 02:02:20,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 02:02:20,189 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-09 02:02:20,191 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-09 02:02:20,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:02:20,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 58 conjuncts are in the unsatisfiable core [2024-11-09 02:02:20,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:02:20,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-09 02:02:21,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 34 [2024-11-09 02:02:21,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:02:21,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 140 treesize of output 67 [2024-11-09 02:02:22,198 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:02:22,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 77 [2024-11-09 02:02:22,757 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:02:22,758 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 150 treesize of output 80 [2024-11-09 02:02:23,169 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:02:23,169 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 145 treesize of output 90 [2024-11-09 02:02:23,823 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:02:23,824 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 155 treesize of output 103 [2024-11-09 02:02:24,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 15 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 106 [2024-11-09 02:02:26,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:02:26,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 187 treesize of output 135 [2024-11-09 02:02:27,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:02:27,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 21 case distinctions, treesize of input 197 treesize of output 148 [2024-11-09 02:02:28,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 02:02:28,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 280 treesize of output 187 [2024-11-09 02:02:36,252 INFO L134 CoverageAnalysis]: Checked inductivity of 612 backedges. 534 proven. 24 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-09 02:02:36,252 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 02:02:52,121 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#1| |c_~#WrapperStruct00~0.base|))) (let ((.cse4 (let ((.cse6 (select .cse0 (bvadd (_ bv4 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse6) ((_ extract 30 23) .cse6) ((_ extract 22 0) .cse6)))) (.cse3 (let ((.cse5 (select .cse0 (bvadd (_ bv8 32) |c_~#WrapperStruct00~0.offset|)))) (fp ((_ extract 31 31) .cse5) ((_ extract 30 23) .cse5) ((_ extract 22 0) .cse5))))) (let ((.cse1 (fp.add c_currentRoundingMode .cse4 .cse3))) (and (or (not (= (_ bv0 8) ((_ extract 7 0) (select .cse0 (bvadd (_ bv21 32) |c_~#WrapperStruct00~0.offset|))))) (forall ((|v_skolemized_q#valueAsBitvector_26| (_ BitVec 32))) (not (= .cse1 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_26|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_26|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_26|)))))) (forall ((|v_skolemized_q#valueAsBitvector_26| (_ BitVec 32))) (let ((.cse2 (fp ((_ extract 31 31) |v_skolemized_q#valueAsBitvector_26|) ((_ extract 30 23) |v_skolemized_q#valueAsBitvector_26|) ((_ extract 22 0) |v_skolemized_q#valueAsBitvector_26|)))) (or (not (= .cse1 .cse2)) (fp.geq (fp.mul c_currentRoundingMode .cse2 .cse3) .cse4)))))))) is different from false [2024-11-09 02:03:04,410 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 02:03:04,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [983039664] [2024-11-09 02:03:04,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [983039664] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 02:03:04,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [8271757] [2024-11-09 02:03:04,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 02:03:04,411 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-09 02:03:04,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-09 02:03:04,413 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-09 02:03:04,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-09 02:03:05,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 02:03:05,888 INFO L255 TraceCheckSpWp]: Trace formula consists of 281 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-09 02:03:05,903 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 02:03:11,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1