./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-67.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-67.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 ee5b2604646ffb9ff87f0762b50222025e67813be823e7481511910f1c3c8636 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:08:32,529 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:08:32,606 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 11:08:32,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:08:32,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:08:32,648 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:08:32,648 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:08:32,649 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:08:32,650 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:08:32,653 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:08:32,654 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:08:32,654 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:08:32,654 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:08:32,655 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:08:32,655 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:08:32,655 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:08:32,656 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:08:32,657 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:08:32,658 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 11:08:32,658 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:08:32,658 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:08:32,659 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:08:32,659 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:08:32,659 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:08:32,660 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:08:32,660 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:08:32,660 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:08:32,660 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:08:32,661 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:08:32,661 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:08:32,661 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:08:32,661 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:08:32,662 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:08:32,662 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:08:32,662 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:08:32,663 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:08:32,663 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 11:08:32,663 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 11:08:32,664 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:08:32,664 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:08:32,664 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:08:32,665 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:08:32,665 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 -> ee5b2604646ffb9ff87f0762b50222025e67813be823e7481511910f1c3c8636 [2024-10-24 11:08:32,931 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:08:32,963 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:08:32,967 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:08:32,968 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:08:32,969 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:08:32,970 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-67.i [2024-10-24 11:08:34,449 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:08:34,695 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:08:34,696 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-67.i [2024-10-24 11:08:34,709 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35119e76e/0ba626eb49f042f7a5e5e7957cb7c231/FLAG981c80828 [2024-10-24 11:08:34,727 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/35119e76e/0ba626eb49f042f7a5e5e7957cb7c231 [2024-10-24 11:08:34,731 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:08:34,733 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:08:34,736 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:08:34,737 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:08:34,742 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:08:34,743 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:08:34" (1/1) ... [2024-10-24 11:08:34,744 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@552e507c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:34, skipping insertion in model container [2024-10-24 11:08:34,744 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:08:34" (1/1) ... [2024-10-24 11:08:34,775 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:08:34,980 WARN L248 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_normal_file-67.i[913,926] [2024-10-24 11:08:35,042 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:08:35,052 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:08:35,063 WARN L248 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_normal_file-67.i[913,926] [2024-10-24 11:08:35,083 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:08:35,103 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:08:35,103 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:35 WrapperNode [2024-10-24 11:08:35,104 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:08:35,105 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:08:35,105 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:08:35,105 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:08:35,113 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:35" (1/1) ... [2024-10-24 11:08:35,122 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:35" (1/1) ... [2024-10-24 11:08:35,153 INFO L138 Inliner]: procedures = 26, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 122 [2024-10-24 11:08:35,154 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:08:35,158 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:08:35,158 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:08:35,158 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:08:35,171 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:35" (1/1) ... [2024-10-24 11:08:35,171 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:35" (1/1) ... [2024-10-24 11:08:35,174 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:35" (1/1) ... [2024-10-24 11:08:35,188 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 11:08:35,188 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:35" (1/1) ... [2024-10-24 11:08:35,188 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:35" (1/1) ... [2024-10-24 11:08:35,194 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:35" (1/1) ... [2024-10-24 11:08:35,197 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:35" (1/1) ... [2024-10-24 11:08:35,199 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:35" (1/1) ... [2024-10-24 11:08:35,201 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:35" (1/1) ... [2024-10-24 11:08:35,203 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:08:35,204 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:08:35,205 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:08:35,205 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:08:35,206 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:35" (1/1) ... [2024-10-24 11:08:35,217 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:08:35,238 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:08:35,257 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-10-24 11:08:35,261 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-10-24 11:08:35,313 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:08:35,313 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:08:35,315 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:08:35,315 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 11:08:35,315 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:08:35,315 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:08:35,399 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:08:35,401 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:08:35,695 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-24 11:08:35,695 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:08:35,739 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:08:35,740 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:08:35,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:08:35 BoogieIcfgContainer [2024-10-24 11:08:35,740 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:08:35,743 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:08:35,743 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:08:35,747 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:08:35,747 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:08:34" (1/3) ... [2024-10-24 11:08:35,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6bc24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:08:35, skipping insertion in model container [2024-10-24 11:08:35,748 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:35" (2/3) ... [2024-10-24 11:08:35,748 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4d6bc24d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:08:35, skipping insertion in model container [2024-10-24 11:08:35,749 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:08:35" (3/3) ... [2024-10-24 11:08:35,750 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-67.i [2024-10-24 11:08:35,765 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:08:35,765 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:08:35,832 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:08:35,838 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;@7e4faa67, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:08:35,839 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:08:35,843 INFO L276 IsEmpty]: Start isEmpty. Operand has 45 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:08:35,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 11:08:35,855 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:08:35,856 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:08:35,857 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:08:35,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:08:35,862 INFO L85 PathProgramCache]: Analyzing trace with hash 254863958, now seen corresponding path program 1 times [2024-10-24 11:08:35,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:08:35,872 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853619287] [2024-10-24 11:08:35,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:08:35,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:08:36,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:36,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:08:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:36,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:08:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:36,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:08:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:36,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:08:36,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:36,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:08:36,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:36,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:08:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:36,209 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:08:36,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:36,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:08:36,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:36,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 11:08:36,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:36,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:08:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:36,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:08:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:36,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:08:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:36,263 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:08:36,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:08:36,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853619287] [2024-10-24 11:08:36,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1853619287] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:08:36,266 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:08:36,266 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:08:36,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933440645] [2024-10-24 11:08:36,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:08:36,274 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:08:36,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:08:36,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:08:36,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:08:36,304 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.4333333333333333) internal successors, (43), 31 states have internal predecessors, (43), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:08:36,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:08:36,339 INFO L93 Difference]: Finished difference Result 87 states and 144 transitions. [2024-10-24 11:08:36,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:08:36,342 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2024-10-24 11:08:36,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:08:36,359 INFO L225 Difference]: With dead ends: 87 [2024-10-24 11:08:36,360 INFO L226 Difference]: Without dead ends: 43 [2024-10-24 11:08:36,364 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 38 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-10-24 11:08:36,368 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 11:08:36,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 11:08:36,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2024-10-24 11:08:36,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2024-10-24 11:08:36,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 states have internal predecessors, (38), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:08:36,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 62 transitions. [2024-10-24 11:08:36,454 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 62 transitions. Word has length 79 [2024-10-24 11:08:36,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:08:36,455 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 62 transitions. [2024-10-24 11:08:36,455 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:08:36,455 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 62 transitions. [2024-10-24 11:08:36,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2024-10-24 11:08:36,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:08:36,462 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:08:36,462 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 11:08:36,463 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:08:36,463 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:08:36,463 INFO L85 PathProgramCache]: Analyzing trace with hash -988983142, now seen corresponding path program 1 times [2024-10-24 11:08:36,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:08:36,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868366248] [2024-10-24 11:08:36,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:08:36,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:08:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:36,940 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 11:08:36,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:36,948 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 11:08:36,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:36,951 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 11:08:36,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:36,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-24 11:08:36,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:36,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 11:08:36,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:36,968 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-24 11:08:36,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:36,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 11:08:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:36,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-24 11:08:36,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:36,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-24 11:08:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:36,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-24 11:08:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:36,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-10-24 11:08:36,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:37,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-24 11:08:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:37,007 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2024-10-24 11:08:37,008 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 11:08:37,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868366248] [2024-10-24 11:08:37,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868366248] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:08:37,010 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:08:37,010 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 11:08:37,010 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513853972] [2024-10-24 11:08:37,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:08:37,013 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 11:08:37,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 11:08:37,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 11:08:37,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 11:08:37,015 INFO L87 Difference]: Start difference. First operand 43 states and 62 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:08:37,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:08:37,139 INFO L93 Difference]: Finished difference Result 86 states and 124 transitions. [2024-10-24 11:08:37,139 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 11:08:37,140 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) Word has length 79 [2024-10-24 11:08:37,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:08:37,141 INFO L225 Difference]: With dead ends: 86 [2024-10-24 11:08:37,142 INFO L226 Difference]: Without dead ends: 44 [2024-10-24 11:08:37,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 11:08:37,144 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 19 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 11:08:37,144 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 118 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 11:08:37,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-24 11:08:37,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 43. [2024-10-24 11:08:37,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:08:37,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 61 transitions. [2024-10-24 11:08:37,153 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 61 transitions. Word has length 79 [2024-10-24 11:08:37,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:08:37,155 INFO L471 AbstractCegarLoop]: Abstraction has 43 states and 61 transitions. [2024-10-24 11:08:37,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 1 states have call predecessors, (12), 1 states have call successors, (12) [2024-10-24 11:08:37,156 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 61 transitions. [2024-10-24 11:08:37,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2024-10-24 11:08:37,158 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:08:37,158 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:08:37,159 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 11:08:37,159 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:08:37,159 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:08:37,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1573410593, now seen corresponding path program 1 times [2024-10-24 11:08:37,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 11:08:37,160 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [642720218] [2024-10-24 11:08:37,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:08:37,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 11:08:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 11:08:37,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1158669263] [2024-10-24 11:08:37,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:08:37,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:08:37,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:08:37,301 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 11:08:37,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 11:08:37,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:08:37,437 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 11:08:37,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 11:08:37,531 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 11:08:37,531 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 11:08:37,532 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 11:08:37,553 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-24 11:08:37,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 11:08:37,738 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-24 11:08:37,821 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 11:08:37,824 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 11:08:37 BoogieIcfgContainer [2024-10-24 11:08:37,824 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 11:08:37,825 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 11:08:37,825 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 11:08:37,826 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 11:08:37,826 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:08:35" (3/4) ... [2024-10-24 11:08:37,828 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 11:08:37,829 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 11:08:37,830 INFO L158 Benchmark]: Toolchain (without parser) took 3097.40ms. Allocated memory was 146.8MB in the beginning and 209.7MB in the end (delta: 62.9MB). Free memory was 75.6MB in the beginning and 81.5MB in the end (delta: -5.9MB). Peak memory consumption was 56.8MB. Max. memory is 16.1GB. [2024-10-24 11:08:37,830 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 146.8MB. Free memory is still 95.9MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:08:37,831 INFO L158 Benchmark]: CACSL2BoogieTranslator took 367.94ms. Allocated memory was 146.8MB in the beginning and 209.7MB in the end (delta: 62.9MB). Free memory was 75.3MB in the beginning and 179.3MB in the end (delta: -104.0MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. [2024-10-24 11:08:37,831 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.23ms. Allocated memory is still 209.7MB. Free memory was 179.3MB in the beginning and 177.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-24 11:08:37,832 INFO L158 Benchmark]: Boogie Preprocessor took 45.72ms. Allocated memory is still 209.7MB. Free memory was 177.2MB in the beginning and 174.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-24 11:08:37,832 INFO L158 Benchmark]: RCFGBuilder took 536.10ms. Allocated memory is still 209.7MB. Free memory was 174.0MB in the beginning and 154.1MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 11:08:37,833 INFO L158 Benchmark]: TraceAbstraction took 2081.76ms. Allocated memory is still 209.7MB. Free memory was 153.1MB in the beginning and 82.6MB in the end (delta: 70.5MB). Peak memory consumption was 68.4MB. Max. memory is 16.1GB. [2024-10-24 11:08:37,833 INFO L158 Benchmark]: Witness Printer took 4.06ms. Allocated memory is still 209.7MB. Free memory was 82.6MB in the beginning and 81.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 11:08:37,836 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.17ms. Allocated memory is still 146.8MB. Free memory is still 95.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 367.94ms. Allocated memory was 146.8MB in the beginning and 209.7MB in the end (delta: 62.9MB). Free memory was 75.3MB in the beginning and 179.3MB in the end (delta: -104.0MB). Peak memory consumption was 14.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.23ms. Allocated memory is still 209.7MB. Free memory was 179.3MB in the beginning and 177.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.72ms. Allocated memory is still 209.7MB. Free memory was 177.2MB in the beginning and 174.0MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 536.10ms. Allocated memory is still 209.7MB. Free memory was 174.0MB in the beginning and 154.1MB in the end (delta: 19.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 2081.76ms. Allocated memory is still 209.7MB. Free memory was 153.1MB in the beginning and 82.6MB in the end (delta: 70.5MB). Peak memory consumption was 68.4MB. Max. memory is 16.1GB. * Witness Printer took 4.06ms. Allocated memory is still 209.7MB. Free memory was 82.6MB in the beginning and 81.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryDOUBLEComparisonOperation at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 2; [L23] signed short int var_1_4 = -64; [L24] signed short int var_1_5 = 256; [L25] unsigned short int var_1_6 = 128; [L26] unsigned short int var_1_7 = 256; [L27] signed long int var_1_8 = 50; [L28] unsigned char var_1_9 = 0; [L29] signed long int var_1_10 = -4; [L30] float var_1_11 = 15.125; [L31] float var_1_12 = 0.9; [L32] double var_1_13 = 25.875; [L33] unsigned short int var_1_14 = 50; [L34] signed short int last_1_var_1_1 = 2; [L35] unsigned short int last_1_var_1_6 = 128; [L36] signed long int last_1_var_1_8 = 50; [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] CALL updateLastVariables() [L89] last_1_var_1_1 = var_1_1 [L90] last_1_var_1_6 = var_1_6 [L91] last_1_var_1_8 = var_1_8 [L101] RET updateLastVariables() [L102] CALL updateVariables() [L69] var_1_4 = __VERIFIER_nondet_short() [L70] CALL assume_abort_if_not(var_1_4 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L70] RET assume_abort_if_not(var_1_4 >= -16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L71] CALL assume_abort_if_not(var_1_4 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L71] RET assume_abort_if_not(var_1_4 <= 16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=256, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L72] var_1_5 = __VERIFIER_nondet_short() [L73] CALL assume_abort_if_not(var_1_5 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L73] RET assume_abort_if_not(var_1_5 >= -16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L74] CALL assume_abort_if_not(var_1_5 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L74] RET assume_abort_if_not(var_1_5 <= 16383) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=256, var_1_8=50, var_1_9=0] [L75] var_1_7 = __VERIFIER_nondet_ushort() [L76] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_8=50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_8=50, var_1_9=0] [L76] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_8=50, var_1_9=0] [L77] CALL assume_abort_if_not(var_1_7 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=32767, var_1_8=50, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=32767, var_1_8=50, var_1_9=0] [L77] RET assume_abort_if_not(var_1_7 <= 32767) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=32767, var_1_8=50, var_1_9=0] [L78] var_1_9 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=32767, var_1_8=50] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=32767, var_1_8=50] [L79] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=32767, var_1_8=50] [L80] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=32767, var_1_8=50, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=32767, var_1_8=50, var_1_9=1] [L80] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=-4, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=32767, var_1_8=50, var_1_9=1] [L81] var_1_10 = __VERIFIER_nondet_long() [L82] CALL assume_abort_if_not(var_1_10 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=32767, var_1_8=50, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=32767, var_1_8=50, var_1_9=1] [L82] RET assume_abort_if_not(var_1_10 >= -2147483648) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=32767, var_1_8=50, var_1_9=1] [L83] CALL assume_abort_if_not(var_1_10 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=32767, var_1_8=50, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=32767, var_1_8=50, var_1_9=1] [L83] RET assume_abort_if_not(var_1_10 <= 2147483647) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=32767, var_1_8=50, var_1_9=1] [L84] CALL assume_abort_if_not(var_1_10 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=32767, var_1_8=50, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=32767, var_1_8=50, var_1_9=1] [L84] RET assume_abort_if_not(var_1_10 != 0) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_12=9/10, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=32767, var_1_8=50, var_1_9=1] [L85] var_1_12 = __VERIFIER_nondet_float() [L86] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=32767, var_1_8=50, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=32767, var_1_8=50, var_1_9=1] [L86] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=2, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=32767, var_1_8=50, var_1_9=1] [L102] RET updateVariables() [L103] CALL step() [L40] COND TRUE ! (last_1_var_1_6 <= last_1_var_1_1) [L41] var_1_1 = (var_1_4 + var_1_5) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=32767, var_1_8=50, var_1_9=1] [L43] signed long int stepLocal_0 = 1 * var_1_4; VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, stepLocal_0=-1, var_1_10=2, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=32767, var_1_8=50, var_1_9=1] [L44] EXPR var_1_1 >> var_1_5 VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, stepLocal_0=-1, var_1_10=2, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=128, var_1_7=32767, var_1_8=50, var_1_9=1] [L44] COND TRUE (var_1_1 >> var_1_5) > stepLocal_0 [L45] var_1_6 = (((((42286 - var_1_7)) > (0)) ? ((42286 - var_1_7)) : (0))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=121/8, var_1_13=207/8, var_1_14=50, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=9519, var_1_7=32767, var_1_8=50, var_1_9=1] [L49] var_1_11 = var_1_12 [L50] var_1_13 = var_1_12 [L51] var_1_14 = var_1_7 [L52] signed long int stepLocal_2 = var_1_4 / var_1_10; [L53] unsigned short int stepLocal_1 = var_1_7; VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, stepLocal_1=32767, stepLocal_2=0, var_1_10=2, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=32767, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=9519, var_1_7=32767, var_1_8=50, var_1_9=1] [L54] COND TRUE \read(var_1_9) [L55] var_1_8 = ((((var_1_6) < (last_1_var_1_8)) ? (var_1_6) : (last_1_var_1_8))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, stepLocal_1=32767, stepLocal_2=0, var_1_10=2, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=32767, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=9519, var_1_7=32767, var_1_8=50, var_1_9=1] [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR ((! (last_1_var_1_6 <= last_1_var_1_1)) ? (var_1_1 == ((signed short int) (var_1_4 + var_1_5))) : 1) && (((var_1_1 >> var_1_5) > (1 * var_1_4)) ? (var_1_6 == ((unsigned short int) (((((42286 - var_1_7)) > (0)) ? ((42286 - var_1_7)) : (0))))) : (var_1_6 == ((unsigned short int) var_1_7))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=32767, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=9519, var_1_7=32767, var_1_8=50, var_1_9=1] [L94] EXPR var_1_1 >> var_1_5 VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=32767, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=9519, var_1_7=32767, var_1_8=50, var_1_9=1] [L94] EXPR ((! (last_1_var_1_6 <= last_1_var_1_1)) ? (var_1_1 == ((signed short int) (var_1_4 + var_1_5))) : 1) && (((var_1_1 >> var_1_5) > (1 * var_1_4)) ? (var_1_6 == ((unsigned short int) (((((42286 - var_1_7)) > (0)) ? ((42286 - var_1_7)) : (0))))) : (var_1_6 == ((unsigned short int) var_1_7))) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=32767, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=9519, var_1_7=32767, var_1_8=50, var_1_9=1] [L94-L95] return ((((((! (last_1_var_1_6 <= last_1_var_1_1)) ? (var_1_1 == ((signed short int) (var_1_4 + var_1_5))) : 1) && (((var_1_1 >> var_1_5) > (1 * var_1_4)) ? (var_1_6 == ((unsigned short int) (((((42286 - var_1_7)) > (0)) ? ((42286 - var_1_7)) : (0))))) : (var_1_6 == ((unsigned short int) var_1_7)))) && (var_1_9 ? (var_1_8 == ((signed long int) ((((var_1_6) < (last_1_var_1_8)) ? (var_1_6) : (last_1_var_1_8))))) : ((var_1_14 > (var_1_4 / var_1_10)) ? ((var_1_7 > var_1_6) ? (var_1_8 == ((signed long int) ((((var_1_4) < (100)) ? (var_1_4) : (100))))) : (var_1_8 == ((signed long int) (last_1_var_1_8 - var_1_7)))) : (var_1_8 == ((signed long int) (var_1_6 + var_1_5)))))) && (var_1_11 == ((float) var_1_12))) && (var_1_13 == ((double) var_1_12))) && (var_1_14 == ((unsigned short int) var_1_7)) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=32767, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=9519, var_1_7=32767, var_1_8=50, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_1=2, last_1_var_1_6=128, last_1_var_1_8=50, var_1_10=2, var_1_11=2, var_1_12=2, var_1_13=2, var_1_14=32767, var_1_1=0, var_1_4=-1, var_1_5=1, var_1_6=9519, var_1_7=32767, var_1_8=50, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 45 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 3, TraceHistogramMax: 12, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 19 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 19 mSDsluCounter, 177 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 73 mSDsCounter, 1 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 44 IncrementalHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1 mSolverCounterUnsat, 104 mSDtfsCounter, 44 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 67 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=45occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 320 NumberOfCodeBlocks, 320 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 156 ConstructedInterpolants, 0 QuantifiedInterpolants, 396 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 528/528 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-10-24 11:08:37,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-67.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 ee5b2604646ffb9ff87f0762b50222025e67813be823e7481511910f1c3c8636 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 11:08:40,215 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 11:08:40,303 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 11:08:40,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 11:08:40,313 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 11:08:40,344 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 11:08:40,348 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 11:08:40,349 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 11:08:40,350 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 11:08:40,351 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 11:08:40,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 11:08:40,352 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 11:08:40,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 11:08:40,353 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 11:08:40,355 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 11:08:40,355 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 11:08:40,355 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 11:08:40,356 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 11:08:40,356 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 11:08:40,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 11:08:40,357 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 11:08:40,360 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 11:08:40,360 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 11:08:40,360 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 11:08:40,361 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 11:08:40,361 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 11:08:40,361 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 11:08:40,361 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 11:08:40,362 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 11:08:40,362 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 11:08:40,362 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 11:08:40,362 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 11:08:40,363 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 11:08:40,363 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 11:08:40,365 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:08:40,366 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 11:08:40,366 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 11:08:40,366 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 11:08:40,367 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 11:08:40,367 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 11:08:40,367 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 11:08:40,368 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 11:08:40,368 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 11:08:40,368 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 11:08:40,369 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 11:08:40,369 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 -> ee5b2604646ffb9ff87f0762b50222025e67813be823e7481511910f1c3c8636 [2024-10-24 11:08:40,717 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 11:08:40,743 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 11:08:40,747 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 11:08:40,748 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 11:08:40,748 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 11:08:40,750 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-67.i [2024-10-24 11:08:42,299 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 11:08:42,506 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 11:08:42,507 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-67.i [2024-10-24 11:08:42,514 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7666644e3/9d86792e99834a64ae31923de5131153/FLAG443710f89 [2024-10-24 11:08:42,527 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7666644e3/9d86792e99834a64ae31923de5131153 [2024-10-24 11:08:42,531 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 11:08:42,533 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 11:08:42,536 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 11:08:42,536 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 11:08:42,542 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 11:08:42,543 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:08:42" (1/1) ... [2024-10-24 11:08:42,544 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@700f8116 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:42, skipping insertion in model container [2024-10-24 11:08:42,544 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 11:08:42" (1/1) ... [2024-10-24 11:08:42,568 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 11:08:42,761 WARN L248 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_normal_file-67.i[913,926] [2024-10-24 11:08:42,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:08:42,855 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 11:08:42,867 WARN L248 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_normal_file-67.i[913,926] [2024-10-24 11:08:42,896 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 11:08:42,929 INFO L204 MainTranslator]: Completed translation [2024-10-24 11:08:42,930 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:42 WrapperNode [2024-10-24 11:08:42,930 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 11:08:42,931 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 11:08:42,931 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 11:08:42,931 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 11:08:42,938 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:42" (1/1) ... [2024-10-24 11:08:42,955 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:42" (1/1) ... [2024-10-24 11:08:42,985 INFO L138 Inliner]: procedures = 27, calls = 25, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 100 [2024-10-24 11:08:42,986 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 11:08:42,987 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 11:08:42,987 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 11:08:42,987 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 11:08:42,998 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:42" (1/1) ... [2024-10-24 11:08:42,999 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:42" (1/1) ... [2024-10-24 11:08:43,003 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:42" (1/1) ... [2024-10-24 11:08:43,023 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 11:08:43,023 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:42" (1/1) ... [2024-10-24 11:08:43,024 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:42" (1/1) ... [2024-10-24 11:08:43,032 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:42" (1/1) ... [2024-10-24 11:08:43,041 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:42" (1/1) ... [2024-10-24 11:08:43,043 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:42" (1/1) ... [2024-10-24 11:08:43,048 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:42" (1/1) ... [2024-10-24 11:08:43,051 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 11:08:43,056 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 11:08:43,056 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 11:08:43,056 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 11:08:43,057 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:42" (1/1) ... [2024-10-24 11:08:43,064 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 11:08:43,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 11:08:43,096 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-10-24 11:08:43,100 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-10-24 11:08:43,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 11:08:43,149 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 11:08:43,149 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 11:08:43,149 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 11:08:43,150 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 11:08:43,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 11:08:43,237 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 11:08:43,239 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 11:08:43,775 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-24 11:08:43,776 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 11:08:43,867 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 11:08:43,868 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 11:08:43,869 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:08:43 BoogieIcfgContainer [2024-10-24 11:08:43,869 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 11:08:43,871 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 11:08:43,872 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 11:08:43,875 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 11:08:43,876 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 11:08:42" (1/3) ... [2024-10-24 11:08:43,876 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4352e3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:08:43, skipping insertion in model container [2024-10-24 11:08:43,877 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 11:08:42" (2/3) ... [2024-10-24 11:08:43,878 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4352e3cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 11:08:43, skipping insertion in model container [2024-10-24 11:08:43,878 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 11:08:43" (3/3) ... [2024-10-24 11:08:43,880 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-67.i [2024-10-24 11:08:43,898 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 11:08:43,899 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 11:08:43,972 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 11:08:43,984 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;@43b6de0f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 11:08:43,984 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 11:08:43,989 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:08:43,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 11:08:43,999 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:08:44,000 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:08:44,001 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:08:44,007 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:08:44,007 INFO L85 PathProgramCache]: Analyzing trace with hash -311353150, now seen corresponding path program 1 times [2024-10-24 11:08:44,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:08:44,023 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1203861761] [2024-10-24 11:08:44,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:08:44,024 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-10-24 11:08:44,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:08:44,048 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-10-24 11:08:44,050 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-10-24 11:08:44,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:44,283 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 11:08:44,292 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 11:08:44,337 INFO L134 CoverageAnalysis]: Checked inductivity of 264 backedges. 62 proven. 0 refuted. 0 times theorem prover too weak. 202 trivial. 0 not checked. [2024-10-24 11:08:44,339 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 11:08:44,340 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 11:08:44,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1203861761] [2024-10-24 11:08:44,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1203861761] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 11:08:44,341 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 11:08:44,341 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 11:08:44,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1735649183] [2024-10-24 11:08:44,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 11:08:44,349 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 11:08:44,349 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 11:08:44,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 11:08:44,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 11:08:44,379 INFO L87 Difference]: Start difference. First operand has 38 states, 23 states have (on average 1.434782608695652) internal successors, (33), 24 states have internal predecessors, (33), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:08:44,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 11:08:44,603 INFO L93 Difference]: Finished difference Result 73 states and 124 transitions. [2024-10-24 11:08:44,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 11:08:44,617 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 76 [2024-10-24 11:08:44,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 11:08:44,625 INFO L225 Difference]: With dead ends: 73 [2024-10-24 11:08:44,625 INFO L226 Difference]: Without dead ends: 36 [2024-10-24 11:08:44,628 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 75 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-10-24 11:08:44,632 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 11:08:44,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 11:08:44,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-10-24 11:08:44,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-10-24 11:08:44,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 22 states have internal predecessors, (28), 12 states have call successors, (12), 1 states have call predecessors, (12), 1 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2024-10-24 11:08:44,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 52 transitions. [2024-10-24 11:08:44,668 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 52 transitions. Word has length 76 [2024-10-24 11:08:44,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 11:08:44,668 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 52 transitions. [2024-10-24 11:08:44,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2024-10-24 11:08:44,669 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 52 transitions. [2024-10-24 11:08:44,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-24 11:08:44,673 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 11:08:44,674 INFO L215 NwaCegarLoop]: trace histogram [12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-10-24 11:08:44,682 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-10-24 11:08:44,878 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-10-24 11:08:44,879 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 11:08:44,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 11:08:44,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1413742846, now seen corresponding path program 1 times [2024-10-24 11:08:44,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 11:08:44,881 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1658870791] [2024-10-24 11:08:44,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 11:08:44,881 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-10-24 11:08:44,882 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 11:08:44,885 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-10-24 11:08:44,886 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-10-24 11:08:45,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 11:08:45,067 INFO L255 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-24 11:08:45,079 INFO L278 TraceCheckSpWp]: Computing forward predicates...