./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 803cd42f 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 ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.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 09f9b90ef6a2b1ab3909a18c4c3a547168931d170a359c3773d165496438e210 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 12:22:40,390 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 12:22:40,467 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-22 12:22:40,472 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 12:22:40,473 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 12:22:40,506 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 12:22:40,507 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 12:22:40,507 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 12:22:40,508 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 12:22:40,510 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 12:22:40,510 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 12:22:40,511 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 12:22:40,511 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 12:22:40,512 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 12:22:40,513 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 12:22:40,514 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 12:22:40,514 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 12:22:40,514 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 12:22:40,514 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 12:22:40,515 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 12:22:40,515 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 12:22:40,516 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 12:22:40,517 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 12:22:40,517 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 12:22:40,517 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 12:22:40,519 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 12:22:40,519 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 12:22:40,519 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 12:22:40,520 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 12:22:40,520 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 12:22:40,520 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 12:22:40,521 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 12:22:40,521 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:22:40,521 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 12:22:40,521 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 12:22:40,521 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 12:22:40,522 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 12:22:40,522 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 12:22:40,522 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 12:22:40,522 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 12:22:40,522 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 12:22:40,523 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 12:22:40,523 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 -> 09f9b90ef6a2b1ab3909a18c4c3a547168931d170a359c3773d165496438e210 [2024-11-22 12:22:40,792 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 12:22:40,815 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 12:22:40,819 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 12:22:40,821 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 12:22:40,821 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 12:22:40,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i [2024-11-22 12:22:42,271 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 12:22:42,476 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 12:22:42,476 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i [2024-11-22 12:22:42,485 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4866118dd/4e766b5d08fc420d909ff00c7502c0fc/FLAG74e46d632 [2024-11-22 12:22:42,500 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4866118dd/4e766b5d08fc420d909ff00c7502c0fc [2024-11-22 12:22:42,502 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 12:22:42,503 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 12:22:42,505 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 12:22:42,505 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 12:22:42,511 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 12:22:42,512 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:22:42" (1/1) ... [2024-11-22 12:22:42,513 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27765687 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:42, skipping insertion in model container [2024-11-22 12:22:42,513 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:22:42" (1/1) ... [2024-11-22 12:22:42,538 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 12:22:42,698 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i[913,926] [2024-11-22 12:22:42,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:22:42,745 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 12:22:42,761 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i[913,926] [2024-11-22 12:22:42,779 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:22:42,795 INFO L204 MainTranslator]: Completed translation [2024-11-22 12:22:42,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:42 WrapperNode [2024-11-22 12:22:42,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 12:22:42,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 12:22:42,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 12:22:42,796 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 12:22:42,803 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:42" (1/1) ... [2024-11-22 12:22:42,810 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:42" (1/1) ... [2024-11-22 12:22:42,843 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2024-11-22 12:22:42,844 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 12:22:42,845 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 12:22:42,845 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 12:22:42,845 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 12:22:42,856 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:42" (1/1) ... [2024-11-22 12:22:42,857 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:42" (1/1) ... [2024-11-22 12:22:42,859 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:42" (1/1) ... [2024-11-22 12:22:42,873 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-11-22 12:22:42,874 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:42" (1/1) ... [2024-11-22 12:22:42,874 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:42" (1/1) ... [2024-11-22 12:22:42,880 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:42" (1/1) ... [2024-11-22 12:22:42,887 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:42" (1/1) ... [2024-11-22 12:22:42,889 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:42" (1/1) ... [2024-11-22 12:22:42,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:42" (1/1) ... [2024-11-22 12:22:42,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 12:22:42,896 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 12:22:42,896 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 12:22:42,896 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 12:22:42,897 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:42" (1/1) ... [2024-11-22 12:22:42,907 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:22:42,924 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:22:42,943 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 12:22:42,946 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 12:22:42,994 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 12:22:42,995 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 12:22:42,996 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 12:22:42,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 12:22:42,996 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 12:22:42,996 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 12:22:43,067 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 12:22:43,070 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 12:22:43,334 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-22 12:22:43,334 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 12:22:43,346 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 12:22:43,346 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 12:22:43,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:22:43 BoogieIcfgContainer [2024-11-22 12:22:43,347 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 12:22:43,365 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 12:22:43,365 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 12:22:43,369 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 12:22:43,370 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:22:42" (1/3) ... [2024-11-22 12:22:43,372 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd23e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:22:43, skipping insertion in model container [2024-11-22 12:22:43,373 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:42" (2/3) ... [2024-11-22 12:22:43,374 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fd23e2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:22:43, skipping insertion in model container [2024-11-22 12:22:43,374 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:22:43" (3/3) ... [2024-11-22 12:22:43,378 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-42.i [2024-11-22 12:22:43,404 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 12:22:43,404 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 12:22:43,480 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 12:22:43,486 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;@307fd9f6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 12:22:43,487 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 12:22:43,497 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 12:22:43,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-22 12:22:43,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:22:43,510 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:22:43,510 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:22:43,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:22:43,517 INFO L85 PathProgramCache]: Analyzing trace with hash -827587499, now seen corresponding path program 1 times [2024-11-22 12:22:43,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:22:43,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796306177] [2024-11-22 12:22:43,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:22:43,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:22:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:22:43,731 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-22 12:22:43,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 12:22:43,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796306177] [2024-11-22 12:22:43,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796306177] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 12:22:43,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [922459982] [2024-11-22 12:22:43,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:22:43,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 12:22:43,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:22:43,736 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 12:22:43,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 12:22:43,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:22:43,839 INFO L255 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 12:22:43,846 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:22:43,868 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-11-22 12:22:43,869 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:22:43,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [922459982] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:22:43,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:22:43,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2024-11-22 12:22:43,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490812877] [2024-11-22 12:22:43,873 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:22:43,878 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 12:22:43,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 12:22:43,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 12:22:43,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:22:43,904 INFO L87 Difference]: Start difference. First operand has 41 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-22 12:22:43,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:22:43,926 INFO L93 Difference]: Finished difference Result 75 states and 123 transitions. [2024-11-22 12:22:43,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 12:22:43,929 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) Word has length 74 [2024-11-22 12:22:43,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:22:43,936 INFO L225 Difference]: With dead ends: 75 [2024-11-22 12:22:43,937 INFO L226 Difference]: Without dead ends: 37 [2024-11-22 12:22:43,942 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-11-22 12:22:43,947 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:22:43,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:22:43,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-22 12:22:43,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-22 12:22:43,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 12:22:43,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-22 12:22:43,986 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 74 [2024-11-22 12:22:43,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:22:43,987 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-22 12:22:43,987 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-22 12:22:43,987 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-22 12:22:43,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-22 12:22:43,993 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:22:43,993 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:22:44,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 12:22:44,199 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2024-11-22 12:22:44,199 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:22:44,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:22:44,200 INFO L85 PathProgramCache]: Analyzing trace with hash -865244527, now seen corresponding path program 1 times [2024-11-22 12:22:44,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 12:22:44,201 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602805171] [2024-11-22 12:22:44,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:22:44,201 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 12:22:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 12:22:44,356 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 12:22:44,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 12:22:44,494 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 12:22:44,495 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 12:22:44,497 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-22 12:22:44,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 12:22:44,503 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1] [2024-11-22 12:22:44,579 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 12:22:44,585 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 12:22:44 BoogieIcfgContainer [2024-11-22 12:22:44,586 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 12:22:44,587 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 12:22:44,587 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 12:22:44,587 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 12:22:44,588 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:22:43" (3/4) ... [2024-11-22 12:22:44,591 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 12:22:44,592 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 12:22:44,595 INFO L158 Benchmark]: Toolchain (without parser) took 2089.61ms. Allocated memory was 153.1MB in the beginning and 216.0MB in the end (delta: 62.9MB). Free memory was 98.6MB in the beginning and 132.2MB in the end (delta: -33.6MB). Peak memory consumption was 30.9MB. Max. memory is 16.1GB. [2024-11-22 12:22:44,596 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 153.1MB. Free memory was 112.5MB in the beginning and 112.4MB in the end (delta: 172.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 12:22:44,598 INFO L158 Benchmark]: CACSL2BoogieTranslator took 290.72ms. Allocated memory is still 153.1MB. Free memory was 98.2MB in the beginning and 84.3MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 12:22:44,598 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.97ms. Allocated memory is still 153.1MB. Free memory was 83.9MB in the beginning and 81.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 12:22:44,599 INFO L158 Benchmark]: Boogie Preprocessor took 50.07ms. Allocated memory is still 153.1MB. Free memory was 81.5MB in the beginning and 77.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 12:22:44,599 INFO L158 Benchmark]: RCFGBuilder took 451.96ms. Allocated memory is still 153.1MB. Free memory was 77.6MB in the beginning and 62.4MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-22 12:22:44,599 INFO L158 Benchmark]: TraceAbstraction took 1220.59ms. Allocated memory was 153.1MB in the beginning and 216.0MB in the end (delta: 62.9MB). Free memory was 122.2MB in the beginning and 132.2MB in the end (delta: -10.0MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. [2024-11-22 12:22:44,600 INFO L158 Benchmark]: Witness Printer took 5.38ms. Allocated memory is still 216.0MB. Free memory is still 132.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 12:22:44,601 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.20ms. Allocated memory is still 153.1MB. Free memory was 112.5MB in the beginning and 112.4MB in the end (delta: 172.7kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 290.72ms. Allocated memory is still 153.1MB. Free memory was 98.2MB in the beginning and 84.3MB in the end (delta: 13.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.97ms. Allocated memory is still 153.1MB. Free memory was 83.9MB in the beginning and 81.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 50.07ms. Allocated memory is still 153.1MB. Free memory was 81.5MB in the beginning and 77.6MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 451.96ms. Allocated memory is still 153.1MB. Free memory was 77.6MB in the beginning and 62.4MB in the end (delta: 15.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 1220.59ms. Allocated memory was 153.1MB in the beginning and 216.0MB in the end (delta: 62.9MB). Free memory was 122.2MB in the beginning and 132.2MB in the end (delta: -10.0MB). Peak memory consumption was 51.4MB. Max. memory is 16.1GB. * Witness Printer took 5.38ms. Allocated memory is still 216.0MB. Free memory is still 132.2MB. 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 82. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed long int var_1_1 = -1; [L23] unsigned char var_1_8 = 5; [L24] unsigned char var_1_9 = 4; [L25] float var_1_10 = 16.5; [L26] float var_1_11 = 127.25; [L27] unsigned char var_1_12 = 1; [L28] unsigned char var_1_13 = 0; [L29] unsigned char var_1_15 = 0; [L30] unsigned char var_1_16 = 0; [L31] unsigned char var_1_17 = 0; [L32] unsigned char var_1_18 = 0; VAL [isInitial=0, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=4] [L86] isInitial = 1 [L87] FCALL initially() [L88] COND TRUE 1 [L89] FCALL updateLastVariables() [L90] CALL updateVariables() [L61] var_1_9 = __VERIFIER_nondet_uchar() [L62] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5] [L62] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5] [L63] CALL assume_abort_if_not(var_1_9 <= 127) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L63] RET assume_abort_if_not(var_1_9 <= 127) VAL [isInitial=1, var_1_10=33/2, var_1_11=509/4, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L64] var_1_11 = __VERIFIER_nondet_float() [L65] CALL assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L65] RET assume_abort_if_not((var_1_11 >= -922337.2036854765600e+13F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L66] var_1_13 = __VERIFIER_nondet_uchar() [L67] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L67] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L68] CALL assume_abort_if_not(var_1_13 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L68] RET assume_abort_if_not(var_1_13 <= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L69] var_1_15 = __VERIFIER_nondet_uchar() [L70] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L70] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L71] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L71] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L72] var_1_16 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L73] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L74] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L74] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L75] var_1_18 = __VERIFIER_nondet_uchar() [L76] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L76] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L77] CALL assume_abort_if_not(var_1_18 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L77] RET assume_abort_if_not(var_1_18 <= 0) VAL [isInitial=1, var_1_10=33/2, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=5, var_1_9=127] [L90] RET updateVariables() [L91] CALL step() [L36] var_1_8 = (var_1_9 + 100) [L37] var_1_10 = ((((var_1_11) < (64.15f)) ? (var_1_11) : (64.15f))) VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=-1, var_1_8=227, var_1_9=127] [L38] COND FALSE !(var_1_8 > var_1_8) [L41] var_1_1 = (((((var_1_8 - var_1_8)) > ((var_1_8 - var_1_8))) ? ((var_1_8 - var_1_8)) : ((var_1_8 - var_1_8)))) VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=0, var_1_8=227, var_1_9=127] [L43] COND FALSE !(var_1_11 <= var_1_10) VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=0, var_1_8=227, var_1_9=127] [L48] COND TRUE var_1_8 <= 1000000 [L49] var_1_17 = 0 VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=1, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=0, var_1_8=227, var_1_9=127] [L54] COND TRUE (- var_1_10) > var_1_11 [L55] var_1_12 = (var_1_13 || (var_1_17 && (var_1_15 || var_1_16))) VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=0, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=0, var_1_8=227, var_1_9=127] [L91] RET step() [L92] CALL, EXPR property() [L82-L83] return (((((var_1_8 > var_1_8) ? (var_1_1 == ((signed long int) (((((var_1_8) < (var_1_8)) ? (var_1_8) : (var_1_8))) - 10))) : (var_1_1 == ((signed long int) (((((var_1_8 - var_1_8)) > ((var_1_8 - var_1_8))) ? ((var_1_8 - var_1_8)) : ((var_1_8 - var_1_8))))))) && (var_1_8 == ((unsigned char) (var_1_9 + 100)))) && (var_1_10 == ((float) ((((var_1_11) < (64.15f)) ? (var_1_11) : (64.15f)))))) && (((- var_1_10) > var_1_11) ? (var_1_12 == ((unsigned char) (var_1_13 || (var_1_17 && (var_1_15 || var_1_16))))) : (var_1_12 == ((unsigned char) ((var_1_1 <= var_1_9) && var_1_16))))) && ((var_1_11 <= var_1_10) ? ((var_1_1 != var_1_8) ? (var_1_17 == ((unsigned char) var_1_18)) : 1) : ((var_1_8 <= 1000000) ? (var_1_17 == ((unsigned char) 0)) : (var_1_17 == ((unsigned char) 0)))) ; VAL [\result=0, isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=0, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=0, var_1_8=227, var_1_9=127] [L92] RET, EXPR property() [L92] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=0, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=0, var_1_8=227, var_1_9=127] [L19] reach_error() VAL [isInitial=1, var_1_10=1283/20, var_1_11=1283/20, var_1_12=0, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=0, var_1_18=0, var_1_1=0, var_1_8=227, var_1_9=127] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.1s, OverallIterations: 2, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 0 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 0 mSDsluCounter, 50 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 0 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 0 IncrementalHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 0 mSolverCounterUnsat, 50 mSDtfsCounter, 0 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, InterpolantAutomatonStates: 2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.1s InterpolantComputationTime, 222 NumberOfCodeBlocks, 222 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 146 ConstructedInterpolants, 0 QuantifiedInterpolants, 146 SizeOfPredicates, 0 NumberOfNonLiveVariables, 178 ConjunctsInSsa, 1 ConjunctsInUnsatCore, 2 InterpolantComputations, 1 PerfectInterpolantSequences, 420/440 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-22 12:22:44,629 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 ../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.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 09f9b90ef6a2b1ab3909a18c4c3a547168931d170a359c3773d165496438e210 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 12:22:46,922 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 12:22:47,002 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-22 12:22:47,007 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 12:22:47,008 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 12:22:47,041 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 12:22:47,042 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 12:22:47,043 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 12:22:47,043 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 12:22:47,044 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 12:22:47,044 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 12:22:47,044 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 12:22:47,045 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 12:22:47,048 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 12:22:47,049 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 12:22:47,049 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 12:22:47,049 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 12:22:47,050 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 12:22:47,050 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 12:22:47,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 12:22:47,052 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 12:22:47,053 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 12:22:47,053 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 12:22:47,053 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 12:22:47,053 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 12:22:47,054 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 12:22:47,054 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 12:22:47,054 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 12:22:47,055 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 12:22:47,055 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 12:22:47,055 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 12:22:47,055 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 12:22:47,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 12:22:47,056 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 12:22:47,066 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:22:47,067 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 12:22:47,067 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 12:22:47,067 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 12:22:47,067 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 12:22:47,067 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 12:22:47,067 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 12:22:47,069 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 12:22:47,069 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 12:22:47,069 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 12:22:47,069 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 -> 09f9b90ef6a2b1ab3909a18c4c3a547168931d170a359c3773d165496438e210 [2024-11-22 12:22:47,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 12:22:47,400 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 12:22:47,404 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 12:22:47,405 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 12:22:47,406 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 12:22:47,407 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i [2024-11-22 12:22:48,869 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 12:22:49,095 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 12:22:49,096 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i [2024-11-22 12:22:49,107 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/084e40d8d/ea18bd53a8e041dfb47c9a129d35f213/FLAG4bfb61b3e [2024-11-22 12:22:49,125 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/084e40d8d/ea18bd53a8e041dfb47c9a129d35f213 [2024-11-22 12:22:49,128 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 12:22:49,129 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 12:22:49,131 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 12:22:49,132 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 12:22:49,137 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 12:22:49,138 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:22:49" (1/1) ... [2024-11-22 12:22:49,139 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42db8bb6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:49, skipping insertion in model container [2024-11-22 12:22:49,139 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 12:22:49" (1/1) ... [2024-11-22 12:22:49,166 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 12:22:49,359 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i[913,926] [2024-11-22 12:22:49,412 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:22:49,433 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 12:22:49,444 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-42.i[913,926] [2024-11-22 12:22:49,470 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 12:22:49,492 INFO L204 MainTranslator]: Completed translation [2024-11-22 12:22:49,493 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:49 WrapperNode [2024-11-22 12:22:49,493 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 12:22:49,494 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 12:22:49,495 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 12:22:49,495 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 12:22:49,501 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:49" (1/1) ... [2024-11-22 12:22:49,516 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:49" (1/1) ... [2024-11-22 12:22:49,548 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 88 [2024-11-22 12:22:49,548 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 12:22:49,550 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 12:22:49,550 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 12:22:49,550 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 12:22:49,561 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:49" (1/1) ... [2024-11-22 12:22:49,562 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:49" (1/1) ... [2024-11-22 12:22:49,565 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:49" (1/1) ... [2024-11-22 12:22:49,583 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-11-22 12:22:49,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:49" (1/1) ... [2024-11-22 12:22:49,584 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:49" (1/1) ... [2024-11-22 12:22:49,595 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:49" (1/1) ... [2024-11-22 12:22:49,599 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:49" (1/1) ... [2024-11-22 12:22:49,601 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:49" (1/1) ... [2024-11-22 12:22:49,602 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:49" (1/1) ... [2024-11-22 12:22:49,605 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 12:22:49,607 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 12:22:49,607 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 12:22:49,608 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 12:22:49,609 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:49" (1/1) ... [2024-11-22 12:22:49,618 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 12:22:49,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 12:22:49,645 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-22 12:22:49,647 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-22 12:22:49,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 12:22:49,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 12:22:49,684 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-22 12:22:49,684 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-22 12:22:49,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 12:22:49,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 12:22:49,749 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 12:22:49,752 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 12:22:49,989 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2024-11-22 12:22:49,989 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 12:22:50,003 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 12:22:50,004 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-22 12:22:50,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:22:50 BoogieIcfgContainer [2024-11-22 12:22:50,004 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 12:22:50,006 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 12:22:50,006 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 12:22:50,010 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 12:22:50,010 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 12:22:49" (1/3) ... [2024-11-22 12:22:50,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4761680f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:22:50, skipping insertion in model container [2024-11-22 12:22:50,011 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 12:22:49" (2/3) ... [2024-11-22 12:22:50,011 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4761680f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 12:22:50, skipping insertion in model container [2024-11-22 12:22:50,012 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 12:22:50" (3/3) ... [2024-11-22 12:22:50,013 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-42.i [2024-11-22 12:22:50,044 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 12:22:50,044 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-22 12:22:50,117 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 12:22:50,127 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;@1c1aaf50, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 12:22:50,127 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-22 12:22:50,132 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 12:22:50,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-22 12:22:50,142 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:22:50,142 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:22:50,143 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:22:50,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:22:50,151 INFO L85 PathProgramCache]: Analyzing trace with hash -827587499, now seen corresponding path program 1 times [2024-11-22 12:22:50,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:22:50,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1681994279] [2024-11-22 12:22:50,169 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:22:50,169 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:22:50,170 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:22:50,173 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:22:50,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-22 12:22:50,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:22:50,324 INFO L255 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-22 12:22:50,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:22:50,367 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2024-11-22 12:22:50,369 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 12:22:50,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:22:50,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1681994279] [2024-11-22 12:22:50,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1681994279] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 12:22:50,371 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 12:22:50,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 12:22:50,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093481450] [2024-11-22 12:22:50,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:22:50,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-22 12:22:50,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:22:50,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-22 12:22:50,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:22:50,404 INFO L87 Difference]: Start difference. First operand has 41 states, 27 states have (on average 1.3703703703703705) internal successors, (37), 28 states have internal predecessors, (37), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-22 12:22:50,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:22:50,431 INFO L93 Difference]: Finished difference Result 75 states and 123 transitions. [2024-11-22 12:22:50,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-22 12:22:50,433 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 74 [2024-11-22 12:22:50,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:22:50,441 INFO L225 Difference]: With dead ends: 75 [2024-11-22 12:22:50,441 INFO L226 Difference]: Without dead ends: 37 [2024-11-22 12:22:50,444 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-22 12:22:50,450 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 12:22:50,451 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 12:22:50,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2024-11-22 12:22:50,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2024-11-22 12:22:50,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 11 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 12:22:50,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 50 transitions. [2024-11-22 12:22:50,498 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 50 transitions. Word has length 74 [2024-11-22 12:22:50,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:22:50,498 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 50 transitions. [2024-11-22 12:22:50,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.0) internal successors, (26), 2 states have internal predecessors, (26), 2 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2024-11-22 12:22:50,499 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 50 transitions. [2024-11-22 12:22:50,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-22 12:22:50,502 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:22:50,502 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:22:50,508 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-22 12:22:50,703 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:22:50,704 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:22:50,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:22:50,705 INFO L85 PathProgramCache]: Analyzing trace with hash -865244527, now seen corresponding path program 1 times [2024-11-22 12:22:50,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:22:50,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2048881096] [2024-11-22 12:22:50,706 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:22:50,706 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:22:50,706 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:22:50,709 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:22:50,711 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-22 12:22:50,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:22:50,812 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 21 conjuncts are in the unsatisfiable core [2024-11-22 12:22:50,825 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:22:51,888 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 159 proven. 27 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2024-11-22 12:22:51,889 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:23:20,218 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 12:23:20,218 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:23:20,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2048881096] [2024-11-22 12:23:20,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2048881096] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:23:20,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:23:20,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [15] total 21 [2024-11-22 12:23:20,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350184139] [2024-11-22 12:23:20,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:23:20,221 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 12:23:20,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:23:20,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 12:23:20,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=333, Unknown=0, NotChecked=0, Total=420 [2024-11-22 12:23:20,223 INFO L87 Difference]: Start difference. First operand 37 states and 50 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 12:23:21,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:23:21,732 INFO L93 Difference]: Finished difference Result 58 states and 71 transitions. [2024-11-22 12:23:21,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 12:23:21,733 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2024-11-22 12:23:21,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:23:21,735 INFO L225 Difference]: With dead ends: 58 [2024-11-22 12:23:21,735 INFO L226 Difference]: Without dead ends: 56 [2024-11-22 12:23:21,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 127 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 138 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=101, Invalid=405, Unknown=0, NotChecked=0, Total=506 [2024-11-22 12:23:21,736 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 39 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 12:23:21,737 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 183 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 12:23:21,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-11-22 12:23:21,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 45. [2024-11-22 12:23:21,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 12:23:21,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2024-11-22 12:23:21,746 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 74 [2024-11-22 12:23:21,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:23:21,747 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2024-11-22 12:23:21,747 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 12:23:21,748 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2024-11-22 12:23:21,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-22 12:23:21,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:23:21,750 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:23:21,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-22 12:23:21,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:23:21,951 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:23:21,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:23:21,952 INFO L85 PathProgramCache]: Analyzing trace with hash -863397485, now seen corresponding path program 1 times [2024-11-22 12:23:21,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:23:21,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405578427] [2024-11-22 12:23:21,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:23:21,953 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:23:21,953 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:23:21,956 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:23:21,958 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-22 12:23:22,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:23:22,071 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-22 12:23:22,084 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 12:23:42,153 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 78 proven. 24 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2024-11-22 12:23:42,154 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 12:23:59,318 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-11-22 12:23:59,319 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 12:23:59,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405578427] [2024-11-22 12:23:59,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405578427] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-22 12:23:59,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 12:23:59,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 20 [2024-11-22 12:23:59,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438867967] [2024-11-22 12:23:59,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 12:23:59,320 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-22 12:23:59,321 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 12:23:59,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-22 12:23:59,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=293, Unknown=0, NotChecked=0, Total=380 [2024-11-22 12:23:59,322 INFO L87 Difference]: Start difference. First operand 45 states and 58 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 12:24:00,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 12:24:00,511 INFO L93 Difference]: Finished difference Result 63 states and 76 transitions. [2024-11-22 12:24:00,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-22 12:24:00,512 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) Word has length 74 [2024-11-22 12:24:00,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 12:24:00,515 INFO L225 Difference]: With dead ends: 63 [2024-11-22 12:24:00,517 INFO L226 Difference]: Without dead ends: 61 [2024-11-22 12:24:00,517 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 128 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=103, Invalid=359, Unknown=0, NotChecked=0, Total=462 [2024-11-22 12:24:00,518 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 61 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 12:24:00,519 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 199 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 12:24:00,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-22 12:24:00,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 45. [2024-11-22 12:24:00,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 31 states have (on average 1.1612903225806452) internal successors, (36), 31 states have internal predecessors, (36), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-22 12:24:00,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 58 transitions. [2024-11-22 12:24:00,530 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 58 transitions. Word has length 74 [2024-11-22 12:24:00,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 12:24:00,530 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 58 transitions. [2024-11-22 12:24:00,530 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 9 states have internal predecessors, (22), 1 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 1 states have call successors, (11) [2024-11-22 12:24:00,531 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 58 transitions. [2024-11-22 12:24:00,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-22 12:24:00,532 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 12:24:00,532 INFO L215 NwaCegarLoop]: trace histogram [11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 12:24:00,537 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-22 12:24:00,733 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:24:00,733 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-22 12:24:00,734 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 12:24:00,734 INFO L85 PathProgramCache]: Analyzing trace with hash 395627409, now seen corresponding path program 1 times [2024-11-22 12:24:00,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 12:24:00,734 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350608902] [2024-11-22 12:24:00,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 12:24:00,734 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 12:24:00,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 12:24:00,738 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 12:24:00,739 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-22 12:24:00,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 12:24:00,801 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-22 12:24:00,804 INFO L278 TraceCheckSpWp]: Computing forward predicates...