./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-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-8.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 83837f94fc7bd30360fd01d655750d82d3cc2bacf5947cc8d97518c23fb519c1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:10:25,968 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:10:26,036 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 13:10:26,040 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:10:26,041 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:10:26,079 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:10:26,080 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:10:26,080 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:10:26,080 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:10:26,081 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:10:26,081 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:10:26,083 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:10:26,084 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:10:26,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:10:26,085 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:10:26,085 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:10:26,086 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:10:26,086 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:10:26,086 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 13:10:26,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:10:26,088 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:10:26,088 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:10:26,089 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:10:26,089 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:10:26,089 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:10:26,089 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:10:26,089 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:10:26,089 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:10:26,090 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:10:26,090 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:10:26,092 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:10:26,092 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:10:26,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:10:26,093 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:10:26,093 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:10:26,093 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:10:26,093 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 13:10:26,093 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 13:10:26,093 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:10:26,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:10:26,094 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:10:26,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:10:26,095 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-clean/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-clean/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 -> 83837f94fc7bd30360fd01d655750d82d3cc2bacf5947cc8d97518c23fb519c1 [2024-10-11 13:10:26,287 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:10:26,312 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:10:26,314 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:10:26,315 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:10:26,315 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:10:26,316 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-8.i [2024-10-11 13:10:27,676 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:10:27,842 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:10:27,843 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-8.i [2024-10-11 13:10:27,855 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1dd4feba3/909544f5836b46579a268cb6eabe9427/FLAGb73cce786 [2024-10-11 13:10:28,235 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/1dd4feba3/909544f5836b46579a268cb6eabe9427 [2024-10-11 13:10:28,237 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:10:28,238 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:10:28,239 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:10:28,239 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:10:28,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:10:28,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:10:28" (1/1) ... [2024-10-11 13:10:28,246 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@69327b3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:28, skipping insertion in model container [2024-10-11 13:10:28,246 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:10:28" (1/1) ... [2024-10-11 13:10:28,273 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:10:28,388 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-8.i[912,925] [2024-10-11 13:10:28,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:10:28,431 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:10:28,441 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-8.i[912,925] [2024-10-11 13:10:28,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:10:28,510 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:10:28,514 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:28 WrapperNode [2024-10-11 13:10:28,515 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:10:28,519 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:10:28,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:10:28,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:10:28,530 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:28" (1/1) ... [2024-10-11 13:10:28,575 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:28" (1/1) ... [2024-10-11 13:10:28,617 INFO L138 Inliner]: procedures = 26, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-10-11 13:10:28,620 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:10:28,621 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:10:28,625 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:10:28,625 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:10:28,642 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:28" (1/1) ... [2024-10-11 13:10:28,642 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:28" (1/1) ... [2024-10-11 13:10:28,649 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:28" (1/1) ... [2024-10-11 13:10:28,669 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-11 13:10:28,673 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:28" (1/1) ... [2024-10-11 13:10:28,676 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:28" (1/1) ... [2024-10-11 13:10:28,680 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:28" (1/1) ... [2024-10-11 13:10:28,682 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:28" (1/1) ... [2024-10-11 13:10:28,683 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:28" (1/1) ... [2024-10-11 13:10:28,684 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:28" (1/1) ... [2024-10-11 13:10:28,689 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:10:28,690 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:10:28,690 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:10:28,690 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:10:28,691 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:28" (1/1) ... [2024-10-11 13:10:28,704 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:10:28,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:10:28,745 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:10:28,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:10:28,806 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:10:28,807 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:10:28,807 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:10:28,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 13:10:28,808 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:10:28,808 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:10:28,880 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:10:28,883 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:10:29,166 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 13:10:29,166 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:10:29,250 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:10:29,251 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:10:29,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:10:29 BoogieIcfgContainer [2024-10-11 13:10:29,251 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:10:29,253 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:10:29,253 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:10:29,264 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:10:29,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:10:28" (1/3) ... [2024-10-11 13:10:29,265 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3516bb5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:10:29, skipping insertion in model container [2024-10-11 13:10:29,266 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:28" (2/3) ... [2024-10-11 13:10:29,266 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3516bb5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:10:29, skipping insertion in model container [2024-10-11 13:10:29,267 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:10:29" (3/3) ... [2024-10-11 13:10:29,268 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-8.i [2024-10-11 13:10:29,301 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:10:29,302 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:10:29,398 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:10:29,415 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;@7a4cea7b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:10:29,416 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:10:29,420 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:10:29,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 13:10:29,441 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:10:29,441 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:10:29,442 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:10:29,449 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:10:29,450 INFO L85 PathProgramCache]: Analyzing trace with hash -899899240, now seen corresponding path program 1 times [2024-10-11 13:10:29,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:10:29,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792367076] [2024-10-11 13:10:29,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:10:29,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:10:29,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:29,772 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:10:29,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:29,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:10:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:29,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:10:29,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:29,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:10:29,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:29,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:10:29,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:29,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:10:29,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:29,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:10:29,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:29,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 13:10:29,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:29,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:10:29,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:29,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 13:10:29,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:29,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 13:10:29,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:29,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 13:10:29,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:29,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 13:10:29,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:29,833 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 13:10:29,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:29,838 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:10:29,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:10:29,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792367076] [2024-10-11 13:10:29,839 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792367076] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:10:29,839 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:10:29,839 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:10:29,840 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121289805] [2024-10-11 13:10:29,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:10:29,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:10:29,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:10:29,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:10:29,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:10:29,864 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:10:29,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:10:29,895 INFO L93 Difference]: Finished difference Result 79 states and 134 transitions. [2024-10-11 13:10:29,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:10:29,898 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 88 [2024-10-11 13:10:29,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:10:29,903 INFO L225 Difference]: With dead ends: 79 [2024-10-11 13:10:29,904 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 13:10:29,906 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 44 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-11 13:10:29,909 INFO L432 NwaCegarLoop]: 53 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, 53 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-11 13:10:29,910 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-11 13:10:29,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 13:10:29,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-11 13:10:29,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:10:29,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2024-10-11 13:10:29,941 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 56 transitions. Word has length 88 [2024-10-11 13:10:29,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:10:29,941 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 56 transitions. [2024-10-11 13:10:29,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 10.5) internal successors, (21), 2 states have internal predecessors, (21), 2 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:10:29,941 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 56 transitions. [2024-10-11 13:10:29,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 13:10:29,944 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:10:29,944 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:10:29,944 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 13:10:29,945 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:10:29,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:10:29,945 INFO L85 PathProgramCache]: Analyzing trace with hash -1587462192, now seen corresponding path program 1 times [2024-10-11 13:10:29,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:10:29,946 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [426601464] [2024-10-11 13:10:29,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:10:29,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:10:30,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:30,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-11 13:10:30,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:30,220 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-11 13:10:30,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:30,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-11 13:10:30,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:30,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-11 13:10:30,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:30,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-11 13:10:30,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:30,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-11 13:10:30,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:30,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-11 13:10:30,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:30,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-11 13:10:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:30,254 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-11 13:10:30,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:30,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-11 13:10:30,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:30,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-11 13:10:30,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:30,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-11 13:10:30,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:30,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-11 13:10:30,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:30,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-11 13:10:30,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:30,280 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:10:30,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 13:10:30,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [426601464] [2024-10-11 13:10:30,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [426601464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:10:30,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:10:30,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 13:10:30,282 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438845428] [2024-10-11 13:10:30,283 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:10:30,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 13:10:30,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 13:10:30,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 13:10:30,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-11 13:10:30,289 INFO L87 Difference]: Start difference. First operand 39 states and 56 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:10:30,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:10:30,386 INFO L93 Difference]: Finished difference Result 77 states and 111 transitions. [2024-10-11 13:10:30,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 13:10:30,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 88 [2024-10-11 13:10:30,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:10:30,388 INFO L225 Difference]: With dead ends: 77 [2024-10-11 13:10:30,388 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 13:10:30,388 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 30 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-11 13:10:30,389 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 49 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:10:30,389 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 65 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 13:10:30,390 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 13:10:30,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-11 13:10:30,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:10:30,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2024-10-11 13:10:30,399 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 88 [2024-10-11 13:10:30,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:10:30,401 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2024-10-11 13:10:30,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 4 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:10:30,401 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2024-10-11 13:10:30,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 13:10:30,403 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:10:30,403 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:10:30,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 13:10:30,403 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:10:30,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:10:30,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1585615150, now seen corresponding path program 1 times [2024-10-11 13:10:30,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 13:10:30,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017942910] [2024-10-11 13:10:30,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:10:30,405 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 13:10:30,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:10:30,473 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-11 13:10:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-11 13:10:30,550 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-11 13:10:30,550 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-11 13:10:30,551 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 13:10:30,553 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 13:10:30,555 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2024-10-11 13:10:30,625 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 13:10:30,628 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 01:10:30 BoogieIcfgContainer [2024-10-11 13:10:30,628 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 13:10:30,629 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 13:10:30,629 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 13:10:30,629 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 13:10:30,630 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:10:29" (3/4) ... [2024-10-11 13:10:30,632 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-11 13:10:30,633 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 13:10:30,635 INFO L158 Benchmark]: Toolchain (without parser) took 2395.30ms. Allocated memory was 176.2MB in the beginning and 276.8MB in the end (delta: 100.7MB). Free memory was 120.1MB in the beginning and 189.5MB in the end (delta: -69.5MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2024-10-11 13:10:30,636 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 176.2MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:10:30,637 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.39ms. Allocated memory is still 176.2MB. Free memory was 119.4MB in the beginning and 105.4MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 13:10:30,637 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.41ms. Allocated memory is still 176.2MB. Free memory was 105.4MB in the beginning and 103.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:10:30,638 INFO L158 Benchmark]: Boogie Preprocessor took 68.66ms. Allocated memory is still 176.2MB. Free memory was 103.3MB in the beginning and 100.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 13:10:30,638 INFO L158 Benchmark]: RCFGBuilder took 560.85ms. Allocated memory is still 176.2MB. Free memory was 100.5MB in the beginning and 82.1MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-11 13:10:30,640 INFO L158 Benchmark]: TraceAbstraction took 1375.62ms. Allocated memory was 176.2MB in the beginning and 276.8MB in the end (delta: 100.7MB). Free memory was 81.6MB in the beginning and 189.5MB in the end (delta: -107.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:10:30,640 INFO L158 Benchmark]: Witness Printer took 3.76ms. Allocated memory is still 276.8MB. Free memory is still 189.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 13:10:30,641 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.13ms. Allocated memory is still 176.2MB. Free memory is still 139.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.39ms. Allocated memory is still 176.2MB. Free memory was 119.4MB in the beginning and 105.4MB in the end (delta: 14.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.41ms. Allocated memory is still 176.2MB. Free memory was 105.4MB in the beginning and 103.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 68.66ms. Allocated memory is still 176.2MB. Free memory was 103.3MB in the beginning and 100.5MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 560.85ms. Allocated memory is still 176.2MB. Free memory was 100.5MB in the beginning and 82.1MB in the end (delta: 18.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 1375.62ms. Allocated memory was 176.2MB in the beginning and 276.8MB in the end (delta: 100.7MB). Free memory was 81.6MB in the beginning and 189.5MB in the end (delta: -107.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.76ms. Allocated memory is still 276.8MB. Free memory is still 189.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 94, overapproximation of someBinaryArithmeticFLOAToperation at line 58. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned char var_1_6 = 0; [L26] unsigned char var_1_7 = 0; [L27] signed long int var_1_8 = 64; [L28] float var_1_12 = 2.4; [L29] float var_1_13 = 127.75; [L30] float var_1_14 = 0.0; [L31] float var_1_15 = 31.4; [L32] float var_1_16 = 256.75; [L33] float var_1_17 = 256.6; [L34] signed long int var_1_18 = 0; [L35] unsigned char var_1_19 = 32; [L36] unsigned char var_1_20 = 100; [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] FCALL updateLastVariables() [L102] CALL updateVariables() [L67] var_1_4 = __VERIFIER_nondet_uchar() [L68] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L68] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L69] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L69] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L70] var_1_5 = __VERIFIER_nondet_uchar() [L71] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=64] [L71] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_6=0, var_1_7=0, var_1_8=64] [L72] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L72] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L73] var_1_6 = __VERIFIER_nondet_uchar() [L74] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=64] [L74] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_7=0, var_1_8=64] [L75] CALL assume_abort_if_not(var_1_6 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L75] RET assume_abort_if_not(var_1_6 <= 0) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=0, var_1_8=64] [L76] var_1_7 = __VERIFIER_nondet_uchar() [L77] CALL assume_abort_if_not(var_1_7 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L77] RET assume_abort_if_not(var_1_7 >= 1) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L78] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L78] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, var_1_12=12/5, var_1_13=511/4, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L79] var_1_13 = __VERIFIER_nondet_float() [L80] CALL assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L80] RET assume_abort_if_not((var_1_13 >= -461168.6018427382800e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 4611686.018427382800e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=12/5, var_1_14=0, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L81] var_1_14 = __VERIFIER_nondet_float() [L82] CALL assume_abort_if_not((var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L82] RET assume_abort_if_not((var_1_14 >= 2305843.009213691390e+12F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 4611686.018427382800e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=12/5, var_1_15=157/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L83] var_1_15 = __VERIFIER_nondet_float() [L84] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L84] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=12/5, var_1_16=1027/4, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L85] var_1_16 = __VERIFIER_nondet_float() [L86] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L86] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 4611686.018427382800e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=100, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L87] var_1_20 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L88] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L89] CALL assume_abort_if_not(var_1_20 <= 254) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L89] RET assume_abort_if_not(var_1_20 <= 254) VAL [isInitial=1, var_1_12=12/5, var_1_17=1283/5, var_1_18=0, var_1_19=32, var_1_1=0, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L102] RET updateVariables() [L103] CALL step() [L40] var_1_17 = var_1_14 [L41] var_1_19 = var_1_20 [L42] var_1_18 = var_1_19 [L43] unsigned char stepLocal_1 = var_1_19; [L44] signed long int stepLocal_0 = (var_1_18 * var_1_18) * (var_1_19 - var_1_19); VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_12=12/5, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=64] [L45] COND FALSE !(stepLocal_0 >= 1u) [L52] var_1_8 = var_1_19 VAL [isInitial=1, stepLocal_1=0, var_1_12=12/5, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L54] signed long int stepLocal_2 = var_1_8; VAL [isInitial=1, stepLocal_1=0, stepLocal_2=0, var_1_12=12/5, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L55] COND FALSE !(var_1_19 > stepLocal_2) [L58] var_1_12 = (var_1_16 - (var_1_14 + var_1_15)) VAL [isInitial=1, stepLocal_1=0, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=0, var_1_1=0, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L60] COND TRUE var_1_18 >= (8u * var_1_8) [L61] var_1_1 = (! (var_1_4 || (var_1_5 || var_1_6))) VAL [isInitial=1, stepLocal_1=0, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L103] RET step() [L104] CALL, EXPR property() [L94-L95] return ((((((var_1_18 >= (8u * var_1_8)) ? (var_1_1 == ((unsigned char) (! (var_1_4 || (var_1_5 || var_1_6))))) : (var_1_1 == ((unsigned char) var_1_7))) && ((((var_1_18 * var_1_18) * (var_1_19 - var_1_19)) >= 1u) ? ((var_1_18 <= var_1_19) ? (var_1_8 == ((signed long int) var_1_19)) : (var_1_8 == ((signed long int) var_1_19))) : (var_1_8 == ((signed long int) var_1_19)))) && ((var_1_19 > var_1_8) ? (var_1_12 == ((float) (var_1_13 + ((var_1_14 - var_1_15) - var_1_16)))) : (var_1_12 == ((float) (var_1_16 - (var_1_14 + var_1_15)))))) && (var_1_17 == ((float) var_1_14))) && (var_1_18 == ((signed long int) var_1_19))) && (var_1_19 == ((unsigned char) var_1_20)) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] [L19] reach_error() VAL [isInitial=1, var_1_14=261, var_1_17=261, var_1_18=0, var_1_19=0, var_1_1=1, var_1_20=0, var_1_4=0, var_1_5=0, var_1_6=0, var_1_7=1, var_1_8=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 41 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 3, TraceHistogramMax: 14, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 49 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 49 mSDsluCounter, 118 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 17 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 49 IncrementalHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 101 mSDtfsCounter, 49 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 77 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=41occurred in iteration=0, InterpolantAutomatonStates: 6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 264 NumberOfCodeBlocks, 264 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 190 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 728/728 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-11 13:10:30,672 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-8.i -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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 83837f94fc7bd30360fd01d655750d82d3cc2bacf5947cc8d97518c23fb519c1 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-84cfde4 [2024-10-11 13:10:32,741 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 13:10:32,819 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-11 13:10:32,826 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 13:10:32,830 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 13:10:32,861 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 13:10:32,862 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 13:10:32,862 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 13:10:32,866 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 13:10:32,866 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 13:10:32,867 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 13:10:32,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 13:10:32,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 13:10:32,868 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 13:10:32,868 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 13:10:32,868 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 13:10:32,869 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 13:10:32,869 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 13:10:32,869 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 13:10:32,869 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 13:10:32,869 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 13:10:32,872 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 13:10:32,872 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 13:10:32,872 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 13:10:32,872 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-11 13:10:32,872 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 13:10:32,873 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-11 13:10:32,873 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 13:10:32,873 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 13:10:32,873 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 13:10:32,873 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 13:10:32,874 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 13:10:32,874 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 13:10:32,874 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 13:10:32,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:10:32,874 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 13:10:32,874 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 13:10:32,875 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 13:10:32,875 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-11 13:10:32,879 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-11 13:10:32,879 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 13:10:32,880 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 13:10:32,880 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 13:10:32,880 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 13:10:32,880 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-11 13:10:32,880 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-clean/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-clean/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 -> 83837f94fc7bd30360fd01d655750d82d3cc2bacf5947cc8d97518c23fb519c1 [2024-10-11 13:10:33,156 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 13:10:33,187 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 13:10:33,194 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 13:10:33,195 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 13:10:33,196 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 13:10:33,197 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-8.i [2024-10-11 13:10:34,745 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 13:10:34,925 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 13:10:34,926 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_variablewrapping_normal_file-8.i [2024-10-11 13:10:34,935 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e9d7f0504/4234a067d9a14e138195497a9d789dfb/FLAG68846c129 [2024-10-11 13:10:34,947 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/e9d7f0504/4234a067d9a14e138195497a9d789dfb [2024-10-11 13:10:34,950 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 13:10:34,951 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 13:10:34,956 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 13:10:34,956 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 13:10:34,963 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 13:10:34,967 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:10:34" (1/1) ... [2024-10-11 13:10:34,968 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@53d7c7f8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:34, skipping insertion in model container [2024-10-11 13:10:34,968 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 01:10:34" (1/1) ... [2024-10-11 13:10:34,991 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 13:10:35,143 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-8.i[912,925] [2024-10-11 13:10:35,179 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:10:35,191 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 13:10:35,201 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-8.i[912,925] [2024-10-11 13:10:35,221 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 13:10:35,244 INFO L204 MainTranslator]: Completed translation [2024-10-11 13:10:35,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:35 WrapperNode [2024-10-11 13:10:35,244 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 13:10:35,245 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 13:10:35,245 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 13:10:35,245 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 13:10:35,250 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:35" (1/1) ... [2024-10-11 13:10:35,260 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:35" (1/1) ... [2024-10-11 13:10:35,282 INFO L138 Inliner]: procedures = 27, calls = 27, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 107 [2024-10-11 13:10:35,282 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 13:10:35,283 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 13:10:35,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 13:10:35,284 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 13:10:35,292 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:35" (1/1) ... [2024-10-11 13:10:35,292 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:35" (1/1) ... [2024-10-11 13:10:35,295 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:35" (1/1) ... [2024-10-11 13:10:35,318 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-11 13:10:35,318 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:35" (1/1) ... [2024-10-11 13:10:35,318 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:35" (1/1) ... [2024-10-11 13:10:35,324 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:35" (1/1) ... [2024-10-11 13:10:35,330 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:35" (1/1) ... [2024-10-11 13:10:35,335 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:35" (1/1) ... [2024-10-11 13:10:35,336 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:35" (1/1) ... [2024-10-11 13:10:35,343 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 13:10:35,343 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 13:10:35,344 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 13:10:35,344 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 13:10:35,344 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:35" (1/1) ... [2024-10-11 13:10:35,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 13:10:35,358 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 13:10:35,372 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 13:10:35,375 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 13:10:35,407 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 13:10:35,408 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-11 13:10:35,408 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-11 13:10:35,408 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-11 13:10:35,408 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 13:10:35,408 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 13:10:35,499 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 13:10:35,501 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 13:10:36,418 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-11 13:10:36,418 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 13:10:36,491 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 13:10:36,497 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 13:10:36,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:10:36 BoogieIcfgContainer [2024-10-11 13:10:36,497 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 13:10:36,518 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 13:10:36,518 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 13:10:36,520 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 13:10:36,521 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 01:10:34" (1/3) ... [2024-10-11 13:10:36,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d0c955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:10:36, skipping insertion in model container [2024-10-11 13:10:36,525 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 01:10:35" (2/3) ... [2024-10-11 13:10:36,525 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66d0c955 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 01:10:36, skipping insertion in model container [2024-10-11 13:10:36,526 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 01:10:36" (3/3) ... [2024-10-11 13:10:36,527 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_variablewrapping_normal_file-8.i [2024-10-11 13:10:36,556 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 13:10:36,556 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 13:10:36,630 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 13:10:36,639 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;@7192e380, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 13:10:36,639 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 13:10:36,648 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:10:36,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 13:10:36,662 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:10:36,663 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:10:36,663 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:10:36,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:10:36,668 INFO L85 PathProgramCache]: Analyzing trace with hash -899899240, now seen corresponding path program 1 times [2024-10-11 13:10:36,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:10:36,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [760175127] [2024-10-11 13:10:36,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:10:36,683 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-11 13:10:36,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:10:36,685 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/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-11 13:10:36,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:10:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:36,975 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-11 13:10:36,986 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:10:37,020 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2024-10-11 13:10:37,025 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:10:37,026 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:10:37,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [760175127] [2024-10-11 13:10:37,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [760175127] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:10:37,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:10:37,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 13:10:37,032 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531639681] [2024-10-11 13:10:37,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:10:37,036 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-11 13:10:37,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:10:37,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-11 13:10:37,074 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-11 13:10:37,080 INFO L87 Difference]: Start difference. First operand has 41 states, 24 states have (on average 1.375) internal successors, (33), 25 states have internal predecessors, (33), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:10:37,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:10:37,814 INFO L93 Difference]: Finished difference Result 79 states and 134 transitions. [2024-10-11 13:10:37,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-11 13:10:37,829 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) Word has length 88 [2024-10-11 13:10:37,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:10:37,834 INFO L225 Difference]: With dead ends: 79 [2024-10-11 13:10:37,834 INFO L226 Difference]: Without dead ends: 39 [2024-10-11 13:10:37,837 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 87 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-11 13:10:37,839 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 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.7s IncrementalHoareTripleChecker+Time [2024-10-11 13:10:37,840 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-11 13:10:37,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-10-11 13:10:37,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-10-11 13:10:37,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:10:37,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 56 transitions. [2024-10-11 13:10:37,871 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 56 transitions. Word has length 88 [2024-10-11 13:10:37,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:10:37,871 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 56 transitions. [2024-10-11 13:10:37,872 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.5) internal successors, (23), 2 states have internal predecessors, (23), 2 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 2 states have call successors, (14) [2024-10-11 13:10:37,872 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 56 transitions. [2024-10-11 13:10:37,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 13:10:37,874 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:10:37,874 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:10:37,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-11 13:10:38,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-clean/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-11 13:10:38,076 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:10:38,076 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:10:38,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1587462192, now seen corresponding path program 1 times [2024-10-11 13:10:38,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:10:38,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [388509906] [2024-10-11 13:10:38,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:10:38,079 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-11 13:10:38,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:10:38,081 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/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-11 13:10:38,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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-11 13:10:38,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:38,345 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-11 13:10:38,357 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:10:38,508 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2024-10-11 13:10:38,509 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-11 13:10:38,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-11 13:10:38,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [388509906] [2024-10-11 13:10:38,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [388509906] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 13:10:38,509 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 13:10:38,509 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 13:10:38,509 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544548068] [2024-10-11 13:10:38,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 13:10:38,510 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 13:10:38,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-11 13:10:38,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 13:10:38,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:10:38,514 INFO L87 Difference]: Start difference. First operand 39 states and 56 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:10:40,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-11 13:10:40,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 13:10:40,613 INFO L93 Difference]: Finished difference Result 105 states and 152 transitions. [2024-10-11 13:10:40,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 13:10:40,613 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 88 [2024-10-11 13:10:40,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 13:10:40,615 INFO L225 Difference]: With dead ends: 105 [2024-10-11 13:10:40,615 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 13:10:40,615 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-10-11 13:10:40,618 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 71 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-11 13:10:40,619 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 140 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-11 13:10:40,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 13:10:40,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 39. [2024-10-11 13:10:40,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 23 states have (on average 1.173913043478261) internal successors, (27), 23 states have internal predecessors, (27), 14 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2024-10-11 13:10:40,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 55 transitions. [2024-10-11 13:10:40,634 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 55 transitions. Word has length 88 [2024-10-11 13:10:40,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 13:10:40,636 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 55 transitions. [2024-10-11 13:10:40,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (14), 1 states have call predecessors, (14), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2024-10-11 13:10:40,637 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 55 transitions. [2024-10-11 13:10:40,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2024-10-11 13:10:40,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 13:10:40,641 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11 13:10:40,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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)] Forceful destruction successful, exit code 0 [2024-10-11 13:10:40,842 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-clean/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-11 13:10:40,842 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 13:10:40,843 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 13:10:40,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1585615150, now seen corresponding path program 1 times [2024-10-11 13:10:40,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-11 13:10:40,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1125617332] [2024-10-11 13:10:40,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 13:10:40,846 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-11 13:10:40,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-11 13:10:40,847 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/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-11 13:10:40,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-11 13:10:41,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 13:10:41,136 INFO L255 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 13:10:41,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 13:11:53,696 WARN L286 SmtUtils]: Spent 5.63s on a formula simplification that was a NOOP. DAG size: 12 (called from [L 728] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)