./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-36.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-36.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 679f3e9a797f0d0c698ba326ece0ec204f57b310bb0854e1596d356f433c56d3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:46:11,047 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:46:11,108 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 05:46:11,115 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:46:11,118 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:46:11,140 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:46:11,141 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:46:11,141 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:46:11,143 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:46:11,143 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:46:11,144 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:46:11,144 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:46:11,145 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:46:11,147 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:46:11,147 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:46:11,148 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:46:11,148 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:46:11,148 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:46:11,149 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 05:46:11,149 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:46:11,149 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:46:11,153 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:46:11,153 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:46:11,154 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:46:11,154 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:46:11,155 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:46:11,155 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:46:11,156 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:46:11,156 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:46:11,156 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:46:11,157 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:46:11,157 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:46:11,157 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:46:11,158 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:46:11,158 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:46:11,159 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:46:11,159 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 05:46:11,159 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 05:46:11,160 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:46:11,160 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:46:11,160 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:46:11,160 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:46:11,161 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 -> 679f3e9a797f0d0c698ba326ece0ec204f57b310bb0854e1596d356f433c56d3 [2024-10-13 05:46:11,459 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:46:11,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:46:11,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:46:11,490 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:46:11,490 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:46:11,491 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-36.i [2024-10-13 05:46:12,976 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:46:13,212 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:46:13,213 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-36.i [2024-10-13 05:46:13,222 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49bd2f3e2/026062e162584180b6e1925628cedc68/FLAG9cb91d243 [2024-10-13 05:46:13,553 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/49bd2f3e2/026062e162584180b6e1925628cedc68 [2024-10-13 05:46:13,557 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:46:13,559 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:46:13,560 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:46:13,560 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:46:13,566 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:46:13,566 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:46:13" (1/1) ... [2024-10-13 05:46:13,567 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3953acee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:13, skipping insertion in model container [2024-10-13 05:46:13,569 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:46:13" (1/1) ... [2024-10-13 05:46:13,596 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:46:13,749 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-36.i[913,926] [2024-10-13 05:46:13,787 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:46:13,795 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:46:13,808 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-36.i[913,926] [2024-10-13 05:46:13,824 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:46:13,839 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:46:13,839 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:13 WrapperNode [2024-10-13 05:46:13,839 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:46:13,840 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:46:13,840 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:46:13,840 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:46:13,845 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:13" (1/1) ... [2024-10-13 05:46:13,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:13" (1/1) ... [2024-10-13 05:46:13,875 INFO L138 Inliner]: procedures = 26, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 120 [2024-10-13 05:46:13,876 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:46:13,876 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:46:13,877 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:46:13,877 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:46:13,887 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:13" (1/1) ... [2024-10-13 05:46:13,887 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:13" (1/1) ... [2024-10-13 05:46:13,889 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:13" (1/1) ... [2024-10-13 05:46:13,905 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 05:46:13,909 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:13" (1/1) ... [2024-10-13 05:46:13,909 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:13" (1/1) ... [2024-10-13 05:46:13,914 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:13" (1/1) ... [2024-10-13 05:46:13,917 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:13" (1/1) ... [2024-10-13 05:46:13,918 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:13" (1/1) ... [2024-10-13 05:46:13,919 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:13" (1/1) ... [2024-10-13 05:46:13,922 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:46:13,923 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:46:13,923 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:46:13,923 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:46:13,927 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:13" (1/1) ... [2024-10-13 05:46:13,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:46:13,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:46:13,958 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 05:46:13,961 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 05:46:14,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:46:14,002 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:46:14,002 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:46:14,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 05:46:14,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:46:14,003 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:46:14,068 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:46:14,070 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:46:14,293 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-13 05:46:14,293 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:46:14,326 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:46:14,327 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:46:14,327 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:46:14 BoogieIcfgContainer [2024-10-13 05:46:14,327 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:46:14,329 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:46:14,332 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:46:14,336 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:46:14,336 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:46:13" (1/3) ... [2024-10-13 05:46:14,336 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db66360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:46:14, skipping insertion in model container [2024-10-13 05:46:14,337 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:13" (2/3) ... [2024-10-13 05:46:14,337 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2db66360 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:46:14, skipping insertion in model container [2024-10-13 05:46:14,338 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:46:14" (3/3) ... [2024-10-13 05:46:14,339 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-36.i [2024-10-13 05:46:14,357 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:46:14,358 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:46:14,418 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:46:14,423 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;@52789c7c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:46:14,423 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:46:14,427 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 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-10-13 05:46:14,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-13 05:46:14,436 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:46:14,437 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, 1, 1] [2024-10-13 05:46:14,437 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:46:14,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:46:14,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1393222035, now seen corresponding path program 1 times [2024-10-13 05:46:14,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:46:14,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104065071] [2024-10-13 05:46:14,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:14,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:46:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:46:14,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:46:14,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:46:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 05:46:14,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 05:46:14,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:46:14,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:46:14,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:46:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:46:14,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 05:46:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:46:14,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:14,747 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 05:46:14,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:46:14,751 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104065071] [2024-10-13 05:46:14,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104065071] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:46:14,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:46:14,752 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:46:14,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48725407] [2024-10-13 05:46:14,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:46:14,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:46:14,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:46:14,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:46:14,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:46:14,782 INFO L87 Difference]: Start difference. First operand has 47 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 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), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 05:46:14,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:46:14,815 INFO L93 Difference]: Finished difference Result 91 states and 149 transitions. [2024-10-13 05:46:14,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:46:14,818 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), 1 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 76 [2024-10-13 05:46:14,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:46:14,827 INFO L225 Difference]: With dead ends: 91 [2024-10-13 05:46:14,828 INFO L226 Difference]: Without dead ends: 45 [2024-10-13 05:46:14,832 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:46:14,835 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:46:14,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:46:14,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-13 05:46:14,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-13 05:46:14,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 32 states have (on average 1.34375) internal successors, (43), 32 states have internal predecessors, (43), 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-10-13 05:46:14,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 65 transitions. [2024-10-13 05:46:14,880 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 65 transitions. Word has length 76 [2024-10-13 05:46:14,881 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:46:14,881 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 65 transitions. [2024-10-13 05:46:14,882 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), 1 states have call predecessors, (11), 1 states have return successors, (11), 1 states have call predecessors, (11), 2 states have call successors, (11) [2024-10-13 05:46:14,882 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 65 transitions. [2024-10-13 05:46:14,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-13 05:46:14,885 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:46:14,886 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, 1, 1] [2024-10-13 05:46:14,886 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 05:46:14,886 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:46:14,887 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:46:14,890 INFO L85 PathProgramCache]: Analyzing trace with hash 740059943, now seen corresponding path program 1 times [2024-10-13 05:46:14,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:46:14,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226329020] [2024-10-13 05:46:14,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:14,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:46:14,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:46:15,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:46:15,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:46:15,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 05:46:15,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 05:46:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:46:15,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:46:15,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:46:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:46:15,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 05:46:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:46:15,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,151 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 05:46:15,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:46:15,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226329020] [2024-10-13 05:46:15,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226329020] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:46:15,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:46:15,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 05:46:15,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1141677837] [2024-10-13 05:46:15,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:46:15,153 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 05:46:15,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:46:15,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 05:46:15,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:46:15,155 INFO L87 Difference]: Start difference. First operand 45 states and 65 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-10-13 05:46:15,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:46:15,206 INFO L93 Difference]: Finished difference Result 90 states and 131 transitions. [2024-10-13 05:46:15,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 05:46:15,207 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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 76 [2024-10-13 05:46:15,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:46:15,208 INFO L225 Difference]: With dead ends: 90 [2024-10-13 05:46:15,208 INFO L226 Difference]: Without dead ends: 46 [2024-10-13 05:46:15,209 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 05:46:15,210 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 0 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:46:15,211 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 112 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:46:15,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-10-13 05:46:15,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2024-10-13 05:46:15,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 33 states have internal predecessors, (44), 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-10-13 05:46:15,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 66 transitions. [2024-10-13 05:46:15,226 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 66 transitions. Word has length 76 [2024-10-13 05:46:15,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:46:15,227 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 66 transitions. [2024-10-13 05:46:15,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-10-13 05:46:15,228 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 66 transitions. [2024-10-13 05:46:15,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-10-13 05:46:15,231 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:46:15,232 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, 1, 1] [2024-10-13 05:46:15,232 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 05:46:15,232 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:46:15,233 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:46:15,233 INFO L85 PathProgramCache]: Analyzing trace with hash 347032933, now seen corresponding path program 1 times [2024-10-13 05:46:15,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:46:15,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992897879] [2024-10-13 05:46:15,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:15,234 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:46:15,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 05:46:15,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 05:46:15,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-13 05:46:15,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 05:46:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 05:46:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 05:46:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,470 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 05:46:15,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-10-13 05:46:15,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-10-13 05:46:15,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-13 05:46:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-10-13 05:46:15,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2024-10-13 05:46:15,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 05:46:15,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992897879] [2024-10-13 05:46:15,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1992897879] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:46:15,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:46:15,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 05:46:15,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [347940127] [2024-10-13 05:46:15,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:46:15,535 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 05:46:15,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 05:46:15,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 05:46:15,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 05:46:15,536 INFO L87 Difference]: Start difference. First operand 46 states and 66 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10-13 05:46:15,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:46:15,672 INFO L93 Difference]: Finished difference Result 136 states and 196 transitions. [2024-10-13 05:46:15,673 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 05:46:15,673 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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 76 [2024-10-13 05:46:15,674 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:46:15,678 INFO L225 Difference]: With dead ends: 136 [2024-10-13 05:46:15,678 INFO L226 Difference]: Without dead ends: 91 [2024-10-13 05:46:15,678 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 05:46:15,681 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 48 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 05:46:15,682 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 160 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 05:46:15,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-10-13 05:46:15,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 83. [2024-10-13 05:46:15,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 58 states have (on average 1.3275862068965518) internal successors, (77), 58 states have internal predecessors, (77), 22 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-13 05:46:15,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 121 transitions. [2024-10-13 05:46:15,699 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 121 transitions. Word has length 76 [2024-10-13 05:46:15,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:46:15,699 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 121 transitions. [2024-10-13 05:46:15,700 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 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-10-13 05:46:15,700 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 121 transitions. [2024-10-13 05:46:15,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-10-13 05:46:15,701 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:46:15,702 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, 1, 1, 1] [2024-10-13 05:46:15,702 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 05:46:15,702 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:46:15,703 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:46:15,703 INFO L85 PathProgramCache]: Analyzing trace with hash -430127304, now seen corresponding path program 1 times [2024-10-13 05:46:15,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 05:46:15,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671840113] [2024-10-13 05:46:15,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:15,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 05:46:15,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:46:15,760 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 05:46:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 05:46:15,829 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 05:46:15,829 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 05:46:15,830 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 05:46:15,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 05:46:15,835 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-13 05:46:15,910 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 05:46:15,913 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 05:46:15 BoogieIcfgContainer [2024-10-13 05:46:15,913 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 05:46:15,914 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 05:46:15,914 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 05:46:15,914 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 05:46:15,914 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:46:14" (3/4) ... [2024-10-13 05:46:15,916 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 05:46:15,917 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 05:46:15,918 INFO L158 Benchmark]: Toolchain (without parser) took 2359.28ms. Allocated memory is still 161.5MB. Free memory was 131.3MB in the beginning and 103.3MB in the end (delta: 28.0MB). Peak memory consumption was 29.6MB. Max. memory is 16.1GB. [2024-10-13 05:46:15,918 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 161.5MB. Free memory is still 134.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:46:15,919 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.60ms. Allocated memory is still 161.5MB. Free memory was 131.3MB in the beginning and 117.3MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-10-13 05:46:15,919 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.95ms. Allocated memory is still 161.5MB. Free memory was 117.3MB in the beginning and 115.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 05:46:15,920 INFO L158 Benchmark]: Boogie Preprocessor took 45.41ms. Allocated memory is still 161.5MB. Free memory was 115.2MB in the beginning and 112.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-13 05:46:15,920 INFO L158 Benchmark]: RCFGBuilder took 404.70ms. Allocated memory is still 161.5MB. Free memory was 112.5MB in the beginning and 94.2MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-10-13 05:46:15,921 INFO L158 Benchmark]: TraceAbstraction took 1584.23ms. Allocated memory is still 161.5MB. Free memory was 93.6MB in the beginning and 103.3MB in the end (delta: -9.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:46:15,921 INFO L158 Benchmark]: Witness Printer took 3.72ms. Allocated memory is still 161.5MB. Free memory is still 103.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 05:46:15,924 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 161.5MB. Free memory is still 134.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.60ms. Allocated memory is still 161.5MB. Free memory was 131.3MB in the beginning and 117.3MB in the end (delta: 14.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.95ms. Allocated memory is still 161.5MB. Free memory was 117.3MB in the beginning and 115.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.41ms. Allocated memory is still 161.5MB. Free memory was 115.2MB in the beginning and 112.5MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 404.70ms. Allocated memory is still 161.5MB. Free memory was 112.5MB in the beginning and 94.2MB in the end (delta: 18.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 1584.23ms. Allocated memory is still 161.5MB. Free memory was 93.6MB in the beginning and 103.3MB in the end (delta: -9.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.72ms. Allocated memory is still 161.5MB. Free memory is still 103.3MB. 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 95, overapproximation of someBinaryDOUBLEComparisonOperation at line 95, overapproximation of shiftRight at line 38. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 1; [L23] float var_1_3 = 9999999999.875; [L24] unsigned char var_1_4 = 0; [L25] float var_1_5 = 4.25; [L26] unsigned char var_1_7 = 1; [L27] unsigned char var_1_9 = 1; [L28] double var_1_10 = 64.2; [L29] double var_1_11 = 9.5; [L30] double var_1_12 = 199.5; [L31] double var_1_13 = 3.5; [L32] unsigned char var_1_14 = 1; [L33] unsigned char var_1_16 = 2; [L34] unsigned char last_1_var_1_14 = 1; [L99] isInitial = 1 [L100] FCALL initially() [L101] COND TRUE 1 [L102] CALL updateLastVariables() [L92] last_1_var_1_14 = var_1_14 [L102] RET updateLastVariables() [L103] CALL updateVariables() [L71] var_1_3 = __VERIFIER_nondet_float() [L72] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_11=19/2, var_1_12=399/2, var_1_13=7/2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_4=0, var_1_5=17/4, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_11=19/2, var_1_12=399/2, var_1_13=7/2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_4=0, var_1_5=17/4, var_1_7=1, var_1_9=1] [L72] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_11=19/2, var_1_12=399/2, var_1_13=7/2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_4=0, var_1_5=17/4, var_1_7=1, var_1_9=1] [L73] var_1_4 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_11=19/2, var_1_12=399/2, var_1_13=7/2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_5=17/4, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_11=19/2, var_1_12=399/2, var_1_13=7/2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_5=17/4, var_1_7=1, var_1_9=1] [L74] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_11=19/2, var_1_12=399/2, var_1_13=7/2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_5=17/4, var_1_7=1, var_1_9=1] [L75] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_11=19/2, var_1_12=399/2, var_1_13=7/2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_4=1, var_1_5=17/4, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_11=19/2, var_1_12=399/2, var_1_13=7/2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_4=1, var_1_5=17/4, var_1_7=1, var_1_9=1] [L75] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_11=19/2, var_1_12=399/2, var_1_13=7/2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_4=1, var_1_5=17/4, var_1_7=1, var_1_9=1] [L76] var_1_5 = __VERIFIER_nondet_float() [L77] CALL assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_11=19/2, var_1_12=399/2, var_1_13=7/2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_11=19/2, var_1_12=399/2, var_1_13=7/2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L77] RET assume_abort_if_not((var_1_5 >= -922337.2036854776000e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854776000e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_11=19/2, var_1_12=399/2, var_1_13=7/2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L78] var_1_9 = __VERIFIER_nondet_uchar() [L79] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_11=19/2, var_1_12=399/2, var_1_13=7/2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_11=19/2, var_1_12=399/2, var_1_13=7/2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L79] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_11=19/2, var_1_12=399/2, var_1_13=7/2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L80] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_11=19/2, var_1_12=399/2, var_1_13=7/2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_11=19/2, var_1_12=399/2, var_1_13=7/2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L80] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_11=19/2, var_1_12=399/2, var_1_13=7/2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L81] var_1_11 = __VERIFIER_nondet_double() [L82] 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, last_1_var_1_14=1, var_1_10=321/5, var_1_12=399/2, var_1_13=7/2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_12=399/2, var_1_13=7/2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L82] 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, last_1_var_1_14=1, var_1_10=321/5, var_1_12=399/2, var_1_13=7/2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L83] var_1_12 = __VERIFIER_nondet_double() [L84] CALL assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_13=7/2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_13=7/2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L84] RET assume_abort_if_not((var_1_12 >= -922337.2036854765600e+13F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_13=7/2, var_1_14=1, var_1_16=2, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L85] var_1_13 = __VERIFIER_nondet_double() [L86] CALL assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_14=1, var_1_16=2, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_14=1, var_1_16=2, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L86] RET assume_abort_if_not((var_1_13 >= -922337.2036854765600e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_14=1, var_1_16=2, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L87] var_1_16 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_14=1, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_14=1, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L88] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_14=1, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L89] CALL assume_abort_if_not(var_1_16 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_14=1, var_1_16=254, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_14=1, var_1_16=254, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L89] RET assume_abort_if_not(var_1_16 <= 254) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_14=1, var_1_16=254, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L103] RET updateVariables() [L104] CALL step() [L38] EXPR last_1_var_1_14 >> last_1_var_1_14 VAL [isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_14=1, var_1_16=254, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L38] COND TRUE (last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14) [L39] var_1_7 = (var_1_4 || var_1_9) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_14=1, var_1_16=254, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L41] COND FALSE !(var_1_13 == (- var_1_12)) [L48] var_1_14 = 0 VAL [isInitial=1, last_1_var_1_14=1, var_1_10=321/5, var_1_14=0, var_1_16=254, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L50] COND FALSE !(var_1_5 > var_1_3) [L53] var_1_10 = ((((var_1_11) > (((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) ? (var_1_11) : (((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13)))))) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=10000000004, var_1_11=10000000004, var_1_12=10000000004, var_1_13=10000000004, var_1_14=0, var_1_16=254, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L55] unsigned char stepLocal_0 = var_1_10 > var_1_10; VAL [isInitial=1, last_1_var_1_14=1, stepLocal_0=0, var_1_10=10000000004, var_1_11=10000000004, var_1_12=10000000004, var_1_13=10000000004, var_1_14=0, var_1_16=254, var_1_1=1, var_1_4=1, var_1_7=1, var_1_9=1] [L56] COND FALSE !(stepLocal_0 && var_1_7) [L67] var_1_1 = var_1_14 VAL [isInitial=1, last_1_var_1_14=1, var_1_10=10000000004, var_1_11=10000000004, var_1_12=10000000004, var_1_13=10000000004, var_1_14=0, var_1_16=254, var_1_1=0, var_1_4=1, var_1_7=1, var_1_9=1] [L104] RET step() [L105] CALL, EXPR property() [L95] EXPR (((var_1_10 > var_1_10) && var_1_7) ? ((((((var_1_10) > ((- var_1_10))) ? (var_1_10) : ((- var_1_10)))) != var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned long int) 10u)) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) && (((last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14)) ? (var_1_7 == ((unsigned char) (var_1_4 || var_1_9))) : 1) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=10000000004, var_1_11=10000000004, var_1_12=10000000004, var_1_13=10000000004, var_1_14=0, var_1_16=254, var_1_1=0, var_1_4=1, var_1_7=1, var_1_9=1] [L95-L96] return (((((var_1_10 > var_1_10) && var_1_7) ? ((((((var_1_10) > ((- var_1_10))) ? (var_1_10) : ((- var_1_10)))) != var_1_10) ? (var_1_7 ? (var_1_1 == ((unsigned long int) 10u)) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) : (var_1_1 == ((unsigned long int) var_1_14))) && (((last_1_var_1_14 >> last_1_var_1_14) < (- last_1_var_1_14)) ? (var_1_7 == ((unsigned char) (var_1_4 || var_1_9))) : 1)) && ((var_1_5 > var_1_3) ? (var_1_10 == ((double) 4.6)) : (var_1_10 == ((double) ((((var_1_11) > (((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13))))) ? (var_1_11) : (((((var_1_12) > (var_1_13)) ? (var_1_12) : (var_1_13)))))))))) && ((var_1_13 == (- var_1_12)) ? ((var_1_7 && var_1_7) ? (var_1_14 == ((unsigned char) var_1_16)) : (var_1_14 == ((unsigned char) var_1_16))) : (var_1_14 == ((unsigned char) 0))) ; [L105] RET, EXPR property() [L105] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=1, var_1_10=10000000004, var_1_11=10000000004, var_1_12=10000000004, var_1_13=10000000004, var_1_14=0, var_1_16=254, var_1_1=0, var_1_4=1, var_1_7=1, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=1, var_1_10=10000000004, var_1_11=10000000004, var_1_12=10000000004, var_1_13=10000000004, var_1_14=0, var_1_16=254, var_1_1=0, var_1_4=1, var_1_7=1, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 47 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.4s, OverallIterations: 4, TraceHistogramMax: 11, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 48 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 48 mSDsluCounter, 334 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 156 mSDsCounter, 35 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 53 IncrementalHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 35 mSolverCounterUnsat, 178 mSDtfsCounter, 53 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83occurred in iteration=3, InterpolantAutomatonStates: 9, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 8 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 305 NumberOfCodeBlocks, 305 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 225 ConstructedInterpolants, 0 QuantifiedInterpolants, 273 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 660/660 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 05:46:15,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-36.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 679f3e9a797f0d0c698ba326ece0ec204f57b310bb0854e1596d356f433c56d3 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 05:46:18,114 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 05:46:18,200 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 05:46:18,210 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 05:46:18,211 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 05:46:18,242 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 05:46:18,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 05:46:18,243 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 05:46:18,244 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 05:46:18,244 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 05:46:18,245 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 05:46:18,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 05:46:18,246 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 05:46:18,248 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 05:46:18,248 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 05:46:18,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 05:46:18,249 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 05:46:18,249 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 05:46:18,250 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 05:46:18,250 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 05:46:18,253 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 05:46:18,254 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 05:46:18,254 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 05:46:18,254 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 05:46:18,255 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 05:46:18,255 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 05:46:18,255 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 05:46:18,255 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 05:46:18,256 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 05:46:18,256 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 05:46:18,256 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 05:46:18,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 05:46:18,257 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 05:46:18,257 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 05:46:18,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:46:18,259 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 05:46:18,260 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 05:46:18,260 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 05:46:18,260 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 05:46:18,261 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 05:46:18,261 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 05:46:18,261 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 05:46:18,261 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 05:46:18,262 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 05:46:18,262 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 05:46:18,262 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 -> 679f3e9a797f0d0c698ba326ece0ec204f57b310bb0854e1596d356f433c56d3 [2024-10-13 05:46:18,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 05:46:18,608 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 05:46:18,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 05:46:18,613 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 05:46:18,614 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 05:46:18,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-36.i [2024-10-13 05:46:20,118 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 05:46:20,357 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 05:46:20,358 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-36.i [2024-10-13 05:46:20,370 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e165210bb/adcfd57418a843ceab7ade7a10e405e3/FLAG27c2ee27f [2024-10-13 05:46:20,700 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e165210bb/adcfd57418a843ceab7ade7a10e405e3 [2024-10-13 05:46:20,703 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 05:46:20,704 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 05:46:20,707 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 05:46:20,708 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 05:46:20,713 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 05:46:20,714 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:46:20" (1/1) ... [2024-10-13 05:46:20,715 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@22269282 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:20, skipping insertion in model container [2024-10-13 05:46:20,715 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 05:46:20" (1/1) ... [2024-10-13 05:46:20,746 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 05:46:20,947 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-36.i[913,926] [2024-10-13 05:46:20,998 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:46:21,018 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 05:46:21,031 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-36.i[913,926] [2024-10-13 05:46:21,059 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 05:46:21,079 INFO L204 MainTranslator]: Completed translation [2024-10-13 05:46:21,079 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:21 WrapperNode [2024-10-13 05:46:21,080 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 05:46:21,081 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 05:46:21,081 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 05:46:21,081 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 05:46:21,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:21" (1/1) ... [2024-10-13 05:46:21,103 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:21" (1/1) ... [2024-10-13 05:46:21,139 INFO L138 Inliner]: procedures = 27, calls = 24, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 101 [2024-10-13 05:46:21,140 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 05:46:21,140 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 05:46:21,140 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 05:46:21,141 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 05:46:21,151 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:21" (1/1) ... [2024-10-13 05:46:21,152 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:21" (1/1) ... [2024-10-13 05:46:21,155 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:21" (1/1) ... [2024-10-13 05:46:21,168 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 05:46:21,172 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:21" (1/1) ... [2024-10-13 05:46:21,173 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:21" (1/1) ... [2024-10-13 05:46:21,183 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:21" (1/1) ... [2024-10-13 05:46:21,193 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:21" (1/1) ... [2024-10-13 05:46:21,195 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:21" (1/1) ... [2024-10-13 05:46:21,196 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:21" (1/1) ... [2024-10-13 05:46:21,205 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 05:46:21,206 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 05:46:21,206 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 05:46:21,206 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 05:46:21,207 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:21" (1/1) ... [2024-10-13 05:46:21,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 05:46:21,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 05:46:21,243 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 05:46:21,245 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 05:46:21,292 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 05:46:21,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 05:46:21,292 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 05:46:21,292 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 05:46:21,292 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 05:46:21,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 05:46:21,378 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 05:46:21,380 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 05:46:21,634 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-13 05:46:21,635 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 05:46:21,684 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 05:46:21,684 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 05:46:21,685 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:46:21 BoogieIcfgContainer [2024-10-13 05:46:21,685 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 05:46:21,687 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 05:46:21,690 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 05:46:21,697 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 05:46:21,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 05:46:20" (1/3) ... [2024-10-13 05:46:21,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3afb8962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:46:21, skipping insertion in model container [2024-10-13 05:46:21,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 05:46:21" (2/3) ... [2024-10-13 05:46:21,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3afb8962 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 05:46:21, skipping insertion in model container [2024-10-13 05:46:21,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 05:46:21" (3/3) ... [2024-10-13 05:46:21,699 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-36.i [2024-10-13 05:46:21,715 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 05:46:21,715 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 05:46:21,779 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 05:46:21,786 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;@7f8a2e4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 05:46:21,786 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 05:46:21,790 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 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-10-13 05:46:21,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-13 05:46:21,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:46:21,802 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] [2024-10-13 05:46:21,802 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:46:21,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:46:21,807 INFO L85 PathProgramCache]: Analyzing trace with hash 1250064239, now seen corresponding path program 1 times [2024-10-13 05:46:21,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:46:21,821 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [424566922] [2024-10-13 05:46:21,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:21,821 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:46:21,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:46:21,825 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 05:46:21,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 05:46:22,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:22,019 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 05:46:22,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 05:46:22,083 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 200 trivial. 0 not checked. [2024-10-13 05:46:22,084 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 05:46:22,084 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 05:46:22,085 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [424566922] [2024-10-13 05:46:22,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [424566922] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 05:46:22,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 05:46:22,087 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 05:46:22,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237046826] [2024-10-13 05:46:22,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 05:46:22,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 05:46:22,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 05:46:22,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 05:46:22,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:46:22,120 INFO L87 Difference]: Start difference. First operand has 40 states, 26 states have (on average 1.4615384615384615) internal successors, (38), 27 states have internal predecessors, (38), 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 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 05:46:22,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 05:46:22,178 INFO L93 Difference]: Finished difference Result 77 states and 129 transitions. [2024-10-13 05:46:22,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 05:46:22,183 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) Word has length 73 [2024-10-13 05:46:22,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 05:46:22,189 INFO L225 Difference]: With dead ends: 77 [2024-10-13 05:46:22,189 INFO L226 Difference]: Without dead ends: 38 [2024-10-13 05:46:22,194 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 05:46:22,198 INFO L432 NwaCegarLoop]: 51 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 05:46:22,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 05:46:22,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-10-13 05:46:22,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-10-13 05:46:22,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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-10-13 05:46:22,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 54 transitions. [2024-10-13 05:46:22,245 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 54 transitions. Word has length 73 [2024-10-13 05:46:22,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 05:46:22,246 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 54 transitions. [2024-10-13 05:46:22,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 1 states have call successors, (11), 1 states have call predecessors, (11), 2 states have return successors, (11), 2 states have call predecessors, (11), 1 states have call successors, (11) [2024-10-13 05:46:22,247 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 54 transitions. [2024-10-13 05:46:22,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-10-13 05:46:22,250 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 05:46:22,250 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] [2024-10-13 05:46:22,258 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 (2)] Forceful destruction successful, exit code 0 [2024-10-13 05:46:22,451 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:46:22,452 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 05:46:22,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 05:46:22,453 INFO L85 PathProgramCache]: Analyzing trace with hash 1261260467, now seen corresponding path program 1 times [2024-10-13 05:46:22,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 05:46:22,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1146675768] [2024-10-13 05:46:22,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 05:46:22,454 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 05:46:22,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 05:46:22,458 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 05:46:22,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 05:46:22,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 05:46:22,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-13 05:46:22,600 INFO L278 TraceCheckSpWp]: Computing forward predicates...