./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_floatingpointinfluence_has-floats_file-73.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-73.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c91b09ece49acd3b34e3a7c214a3b7e265a90f1ce6244f806045e045a43605a2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:48:18,141 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:48:18,192 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 08:48:18,197 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:48:18,199 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:48:18,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:48:18,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:48:18,224 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:48:18,225 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:48:18,225 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:48:18,226 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:48:18,227 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:48:18,227 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:48:18,228 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:48:18,228 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:48:18,229 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:48:18,229 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:48:18,231 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:48:18,231 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 08:48:18,232 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:48:18,232 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:48:18,232 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:48:18,232 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:48:18,232 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:48:18,233 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:48:18,233 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:48:18,233 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:48:18,233 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:48:18,233 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:48:18,233 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:48:18,234 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:48:18,234 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:48:18,234 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:48:18,234 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:48:18,234 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:48:18,234 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:48:18,235 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 08:48:18,235 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 08:48:18,235 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:48:18,235 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:48:18,237 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:48:18,237 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:48:18,237 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c91b09ece49acd3b34e3a7c214a3b7e265a90f1ce6244f806045e045a43605a2 [2024-10-24 08:48:18,510 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:48:18,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:48:18,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:48:18,534 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:48:18,534 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:48:18,535 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-73.i [2024-10-24 08:48:19,821 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:48:19,967 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:48:19,968 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-73.i [2024-10-24 08:48:19,976 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/713cfdb7b/fcbfc3b7717a4b32b9c693da8ec5454c/FLAG1f01a198d [2024-10-24 08:48:19,987 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/713cfdb7b/fcbfc3b7717a4b32b9c693da8ec5454c [2024-10-24 08:48:19,989 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:48:19,990 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:48:19,991 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:48:19,991 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:48:19,995 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:48:19,998 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:48:19" (1/1) ... [2024-10-24 08:48:19,999 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45d97398 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:19, skipping insertion in model container [2024-10-24 08:48:19,999 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:48:19" (1/1) ... [2024-10-24 08:48:20,017 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:48:20,125 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_floatingpointinfluence_has-floats_file-73.i[917,930] [2024-10-24 08:48:20,161 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:48:20,170 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:48:20,186 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_floatingpointinfluence_has-floats_file-73.i[917,930] [2024-10-24 08:48:20,202 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:48:20,218 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:48:20,218 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:20 WrapperNode [2024-10-24 08:48:20,218 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:48:20,219 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:48:20,219 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:48:20,220 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:48:20,225 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:20" (1/1) ... [2024-10-24 08:48:20,231 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:20" (1/1) ... [2024-10-24 08:48:20,283 INFO L138 Inliner]: procedures = 26, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 111 [2024-10-24 08:48:20,283 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:48:20,284 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:48:20,284 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:48:20,284 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:48:20,295 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:20" (1/1) ... [2024-10-24 08:48:20,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:20" (1/1) ... [2024-10-24 08:48:20,298 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:20" (1/1) ... [2024-10-24 08:48:20,327 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 08:48:20,327 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:20" (1/1) ... [2024-10-24 08:48:20,327 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:20" (1/1) ... [2024-10-24 08:48:20,336 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:20" (1/1) ... [2024-10-24 08:48:20,342 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:20" (1/1) ... [2024-10-24 08:48:20,343 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:20" (1/1) ... [2024-10-24 08:48:20,345 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:20" (1/1) ... [2024-10-24 08:48:20,349 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:48:20,350 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:48:20,350 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:48:20,350 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:48:20,351 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:20" (1/1) ... [2024-10-24 08:48:20,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:48:20,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:48:20,381 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 08:48:20,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 08:48:20,418 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:48:20,418 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:48:20,419 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:48:20,419 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 08:48:20,419 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:48:20,419 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:48:20,485 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:48:20,486 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:48:20,656 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 08:48:20,656 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:48:20,691 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:48:20,691 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:48:20,692 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:48:20 BoogieIcfgContainer [2024-10-24 08:48:20,692 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:48:20,693 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:48:20,694 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:48:20,696 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:48:20,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:48:19" (1/3) ... [2024-10-24 08:48:20,697 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc399fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:48:20, skipping insertion in model container [2024-10-24 08:48:20,697 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:20" (2/3) ... [2024-10-24 08:48:20,698 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6cc399fe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:48:20, skipping insertion in model container [2024-10-24 08:48:20,698 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:48:20" (3/3) ... [2024-10-24 08:48:20,699 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-73.i [2024-10-24 08:48:20,712 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:48:20,712 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:48:20,757 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:48:20,762 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;@1b8bceca, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:48:20,763 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:48:20,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 08:48:20,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 08:48:20,774 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:48:20,774 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:48:20,775 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:48:20,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:48:20,779 INFO L85 PathProgramCache]: Analyzing trace with hash -2061904121, now seen corresponding path program 1 times [2024-10-24 08:48:20,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:48:20,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828872840] [2024-10-24 08:48:20,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:48:20,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:48:20,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:20,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:48:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:20,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:48:20,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:20,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:48:20,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:20,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 08:48:20,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:20,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:48:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:20,976 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 08:48:20,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:20,979 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:48:20,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:20,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 08:48:20,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:20,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:48:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:20,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:48:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:20,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:48:20,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:20,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:48:20,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:20,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:48:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 08:48:21,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:48:21,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,010 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 08:48:21,011 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:48:21,011 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828872840] [2024-10-24 08:48:21,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828872840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:48:21,012 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:48:21,012 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:48:21,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358220776] [2024-10-24 08:48:21,014 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:48:21,017 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:48:21,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:48:21,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:48:21,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:48:21,036 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 08:48:21,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:48:21,065 INFO L93 Difference]: Finished difference Result 89 states and 153 transitions. [2024-10-24 08:48:21,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:48:21,067 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 94 [2024-10-24 08:48:21,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:48:21,072 INFO L225 Difference]: With dead ends: 89 [2024-10-24 08:48:21,073 INFO L226 Difference]: Without dead ends: 44 [2024-10-24 08:48:21,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:48:21,077 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:48:21,078 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:48:21,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-24 08:48:21,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-24 08:48:21,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 08:48:21,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2024-10-24 08:48:21,110 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 94 [2024-10-24 08:48:21,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:48:21,111 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2024-10-24 08:48:21,111 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 11.0) internal successors, (22), 2 states have internal predecessors, (22), 2 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 08:48:21,111 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2024-10-24 08:48:21,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 08:48:21,114 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:48:21,114 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:48:21,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 08:48:21,114 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:48:21,118 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:48:21,118 INFO L85 PathProgramCache]: Analyzing trace with hash 709628301, now seen corresponding path program 1 times [2024-10-24 08:48:21,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:48:21,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759083044] [2024-10-24 08:48:21,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:48:21,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:48:21,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:48:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:48:21,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:48:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 08:48:21,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,554 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:48:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 08:48:21,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:48:21,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 08:48:21,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:48:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,575 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:48:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:48:21,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,581 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:48:21,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,583 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:48:21,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,586 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 08:48:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:48:21,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,593 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 08:48:21,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:48:21,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759083044] [2024-10-24 08:48:21,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759083044] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:48:21,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:48:21,598 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:48:21,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648299941] [2024-10-24 08:48:21,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:48:21,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:48:21,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:48:21,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:48:21,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:48:21,602 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 08:48:21,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:48:21,647 INFO L93 Difference]: Finished difference Result 87 states and 129 transitions. [2024-10-24 08:48:21,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:48:21,648 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2024-10-24 08:48:21,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:48:21,651 INFO L225 Difference]: With dead ends: 87 [2024-10-24 08:48:21,652 INFO L226 Difference]: Without dead ends: 44 [2024-10-24 08:48:21,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:48:21,654 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 0 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:48:21,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 113 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:48:21,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-24 08:48:21,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-24 08:48:21,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 08:48:21,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2024-10-24 08:48:21,670 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 94 [2024-10-24 08:48:21,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:48:21,672 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2024-10-24 08:48:21,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 08:48:21,673 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2024-10-24 08:48:21,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 08:48:21,677 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:48:21,678 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:48:21,678 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 08:48:21,678 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:48:21,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:48:21,679 INFO L85 PathProgramCache]: Analyzing trace with hash 514105839, now seen corresponding path program 1 times [2024-10-24 08:48:21,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:48:21,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [558540329] [2024-10-24 08:48:21,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:48:21,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:48:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 08:48:21,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 08:48:21,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-24 08:48:21,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-24 08:48:21,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-24 08:48:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-24 08:48:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-24 08:48:21,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-24 08:48:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-24 08:48:21,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-24 08:48:21,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-24 08:48:21,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-24 08:48:21,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-24 08:48:21,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-10-24 08:48:21,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2024-10-24 08:48:21,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:21,755 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 08:48:21,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 08:48:21,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [558540329] [2024-10-24 08:48:21,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [558540329] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:48:21,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:48:21,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:48:21,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256855159] [2024-10-24 08:48:21,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:48:21,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:48:21,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 08:48:21,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:48:21,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:48:21,758 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 08:48:21,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:48:21,785 INFO L93 Difference]: Finished difference Result 99 states and 142 transitions. [2024-10-24 08:48:21,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:48:21,785 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 95 [2024-10-24 08:48:21,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:48:21,791 INFO L225 Difference]: With dead ends: 99 [2024-10-24 08:48:21,791 INFO L226 Difference]: Without dead ends: 56 [2024-10-24 08:48:21,791 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:48:21,792 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 8 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 08:48:21,793 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 113 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 08:48:21,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-24 08:48:21,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2024-10-24 08:48:21,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 08:48:21,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2024-10-24 08:48:21,799 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 95 [2024-10-24 08:48:21,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:48:21,800 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2024-10-24 08:48:21,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 08:48:21,800 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2024-10-24 08:48:21,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 08:48:21,801 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:48:21,802 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:48:21,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 08:48:21,802 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:48:21,802 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:48:21,803 INFO L85 PathProgramCache]: Analyzing trace with hash 514165421, now seen corresponding path program 1 times [2024-10-24 08:48:21,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 08:48:21,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124627513] [2024-10-24 08:48:21,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:48:21,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 08:48:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:48:21,887 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 08:48:21,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 08:48:21,957 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 08:48:21,958 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 08:48:21,959 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 08:48:21,960 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 08:48:21,963 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-24 08:48:22,036 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 08:48:22,038 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 08:48:22 BoogieIcfgContainer [2024-10-24 08:48:22,039 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 08:48:22,039 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 08:48:22,039 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 08:48:22,039 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 08:48:22,040 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:48:20" (3/4) ... [2024-10-24 08:48:22,041 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 08:48:22,042 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 08:48:22,043 INFO L158 Benchmark]: Toolchain (without parser) took 2053.02ms. Allocated memory was 151.0MB in the beginning and 209.7MB in the end (delta: 58.7MB). Free memory was 80.6MB in the beginning and 176.4MB in the end (delta: -95.8MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:48:22,043 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 151.0MB. Free memory is still 101.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:48:22,043 INFO L158 Benchmark]: CACSL2BoogieTranslator took 227.98ms. Allocated memory is still 151.0MB. Free memory was 80.3MB in the beginning and 66.1MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-24 08:48:22,044 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.05ms. Allocated memory is still 151.0MB. Free memory was 65.9MB in the beginning and 121.7MB in the end (delta: -55.8MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2024-10-24 08:48:22,044 INFO L158 Benchmark]: Boogie Preprocessor took 65.73ms. Allocated memory was 151.0MB in the beginning and 209.7MB in the end (delta: 58.7MB). Free memory was 121.7MB in the beginning and 179.3MB in the end (delta: -57.7MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. [2024-10-24 08:48:22,044 INFO L158 Benchmark]: RCFGBuilder took 341.65ms. Allocated memory is still 209.7MB. Free memory was 179.3MB in the beginning and 158.4MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 08:48:22,045 INFO L158 Benchmark]: TraceAbstraction took 1345.24ms. Allocated memory is still 209.7MB. Free memory was 158.4MB in the beginning and 176.4MB in the end (delta: -18.0MB). Peak memory consumption was 76.3MB. Max. memory is 16.1GB. [2024-10-24 08:48:22,045 INFO L158 Benchmark]: Witness Printer took 3.25ms. Allocated memory is still 209.7MB. Free memory is still 176.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 08:48:22,049 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.14ms. Allocated memory is still 151.0MB. Free memory is still 101.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 227.98ms. Allocated memory is still 151.0MB. Free memory was 80.3MB in the beginning and 66.1MB in the end (delta: 14.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.05ms. Allocated memory is still 151.0MB. Free memory was 65.9MB in the beginning and 121.7MB in the end (delta: -55.8MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Boogie Preprocessor took 65.73ms. Allocated memory was 151.0MB in the beginning and 209.7MB in the end (delta: 58.7MB). Free memory was 121.7MB in the beginning and 179.3MB in the end (delta: -57.7MB). Peak memory consumption was 5.3MB. Max. memory is 16.1GB. * RCFGBuilder took 341.65ms. Allocated memory is still 209.7MB. Free memory was 179.3MB in the beginning and 158.4MB in the end (delta: 20.9MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. * TraceAbstraction took 1345.24ms. Allocated memory is still 209.7MB. Free memory was 158.4MB in the beginning and 176.4MB in the end (delta: -18.0MB). Peak memory consumption was 76.3MB. Max. memory is 16.1GB. * Witness Printer took 3.25ms. Allocated memory is still 209.7MB. Free memory is still 176.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 101, overapproximation of someBinaryFLOATComparisonOperation at line 101, overapproximation of someUnaryDOUBLEoperation at line 24. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 5.5; [L23] unsigned char var_1_6 = 1; [L24] double var_1_7 = -0.41; [L25] unsigned char var_1_8 = 25; [L26] unsigned char var_1_9 = 100; [L27] unsigned char var_1_10 = 1; [L28] float var_1_12 = 15.75; [L29] float var_1_13 = 1.6; [L30] unsigned char var_1_14 = 0; [L31] unsigned char var_1_15 = 0; [L32] float var_1_16 = 16.5; [L33] signed char var_1_17 = 10; [L34] signed char var_1_18 = -10; [L35] signed long int var_1_19 = -16; [L36] float last_1_var_1_12 = 15.75; [L105] isInitial = 1 [L106] FCALL initially() [L107] COND TRUE 1 [L108] CALL updateLastVariables() [L98] last_1_var_1_12 = var_1_12 [L108] RET updateLastVariables() [L109] CALL updateVariables() [L72] var_1_6 = __VERIFIER_nondet_uchar() [L73] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_8=25, var_1_9=100] [L73] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_8=25, var_1_9=100] [L74] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L74] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L75] var_1_7 = __VERIFIER_nondet_double() [L76] CALL assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L76] RET assume_abort_if_not((var_1_7 >= -922337.2036854765600e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 9223372.036854765600e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=100] [L77] var_1_9 = __VERIFIER_nondet_uchar() [L78] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25] [L78] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25] [L79] CALL assume_abort_if_not(var_1_9 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L79] RET assume_abort_if_not(var_1_9 <= 254) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=1, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L80] var_1_10 = __VERIFIER_nondet_uchar() [L81] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L81] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L82] CALL assume_abort_if_not(var_1_10 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L82] RET assume_abort_if_not(var_1_10 <= 254) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_13=8/5, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L83] var_1_13 = __VERIFIER_nondet_float() [L84] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L84] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=0, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L85] var_1_14 = __VERIFIER_nondet_uchar() [L86] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L86] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L87] CALL assume_abort_if_not(var_1_14 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L87] RET assume_abort_if_not(var_1_14 <= 1) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=0, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L88] var_1_15 = __VERIFIER_nondet_uchar() [L89] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L89] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L90] CALL assume_abort_if_not(var_1_15 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L90] RET assume_abort_if_not(var_1_15 <= 1) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_16=33/2, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L91] var_1_16 = __VERIFIER_nondet_float() [L92] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L92] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-10, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L93] var_1_18 = __VERIFIER_nondet_char() [L94] CALL assume_abort_if_not(var_1_18 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L94] RET assume_abort_if_not(var_1_18 >= -127) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L95] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L95] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=25, var_1_9=5] [L109] RET updateVariables() [L110] CALL step() [L40] COND TRUE \read(var_1_6) [L41] var_1_8 = ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=-16, var_1_1=11/2, var_1_6=1, var_1_8=5, var_1_9=5] [L47] var_1_19 = var_1_8 VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=63/4, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=5, var_1_1=11/2, var_1_6=1, var_1_8=5, var_1_9=5] [L48] COND FALSE !(var_1_19 > var_1_9) [L59] var_1_12 = var_1_13 VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=105, var_1_13=105, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=5, var_1_1=11/2, var_1_6=1, var_1_8=5, var_1_9=5] [L61] signed long int stepLocal_0 = (((var_1_8) > ((var_1_8 + var_1_19))) ? (var_1_8) : ((var_1_8 + var_1_19))); VAL [isInitial=1, last_1_var_1_12=63/4, stepLocal_0=10, var_1_10=4, var_1_12=105, var_1_13=105, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=5, var_1_1=11/2, var_1_6=1, var_1_8=5, var_1_9=5] [L62] COND TRUE var_1_8 <= stepLocal_0 VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=105, var_1_13=105, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=5, var_1_1=11/2, var_1_6=1, var_1_8=5, var_1_9=5] [L63] COND FALSE !(! var_1_6) [L66] var_1_1 = var_1_7 VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=105, var_1_13=105, var_1_14=1, var_1_15=1, var_1_17=10, var_1_18=-127, var_1_19=5, var_1_1=106, var_1_6=1, var_1_7=106, var_1_8=5, var_1_9=5] [L69] var_1_17 = var_1_18 [L110] RET step() [L111] CALL, EXPR property() [L101-L102] return (((((var_1_8 <= ((((var_1_8) > ((var_1_8 + var_1_19))) ? (var_1_8) : ((var_1_8 + var_1_19))))) ? ((! var_1_6) ? (var_1_1 == ((double) var_1_7)) : (var_1_1 == ((double) var_1_7))) : 1) && (var_1_6 ? (var_1_8 == ((unsigned char) ((((var_1_9) > (var_1_10)) ? (var_1_9) : (var_1_10))))) : ((last_1_var_1_12 < (last_1_var_1_12 + var_1_7)) ? (var_1_8 == ((unsigned char) ((((var_1_9) < (var_1_10)) ? (var_1_9) : (var_1_10))))) : 1))) && ((var_1_19 > var_1_9) ? (var_1_6 ? (var_1_12 == ((float) (var_1_13 - ((((99999.25f) < 0 ) ? -(99999.25f) : (99999.25f)))))) : ((var_1_14 && var_1_15) ? (var_1_12 == ((float) (var_1_13 - var_1_16))) : (var_1_12 == ((float) var_1_16)))) : (var_1_12 == ((float) var_1_13)))) && (var_1_17 == ((signed char) var_1_18))) && (var_1_19 == ((signed long int) var_1_8)) ; [L111] RET, EXPR property() [L111] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=105, var_1_13=105, var_1_14=1, var_1_15=1, var_1_17=-127, var_1_18=-127, var_1_19=5, var_1_1=106, var_1_6=1, var_1_7=106, var_1_8=5, var_1_9=5] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=63/4, var_1_10=4, var_1_12=105, var_1_13=105, var_1_14=1, var_1_15=1, var_1_17=-127, var_1_18=-127, var_1_19=5, var_1_1=106, var_1_6=1, var_1_7=106, var_1_8=5, var_1_9=5] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 46 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.2s, OverallIterations: 4, TraceHistogramMax: 15, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 8 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8 mSDsluCounter, 288 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 107 mSDsCounter, 4 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 28 IncrementalHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 4 mSolverCounterUnsat, 181 mSDtfsCounter, 28 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 114 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=50occurred in iteration=3, InterpolantAutomatonStates: 8, 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, 3 MinimizatonAttempts, 6 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 378 NumberOfCodeBlocks, 378 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 280 ConstructedInterpolants, 0 QuantifiedInterpolants, 327 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 1260/1260 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 08:48:22,079 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-73.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c91b09ece49acd3b34e3a7c214a3b7e265a90f1ce6244f806045e045a43605a2 --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 08:48:24,065 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 08:48:24,124 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 08:48:24,128 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 08:48:24,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 08:48:24,156 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 08:48:24,160 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 08:48:24,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 08:48:24,160 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 08:48:24,161 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 08:48:24,161 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 08:48:24,161 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 08:48:24,162 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 08:48:24,162 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 08:48:24,162 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 08:48:24,162 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 08:48:24,163 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 08:48:24,163 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 08:48:24,163 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 08:48:24,163 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 08:48:24,164 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 08:48:24,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 08:48:24,164 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 08:48:24,165 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 08:48:24,165 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 08:48:24,165 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 08:48:24,165 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 08:48:24,165 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 08:48:24,166 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 08:48:24,166 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 08:48:24,166 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 08:48:24,166 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 08:48:24,166 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 08:48:24,167 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 08:48:24,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:48:24,167 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 08:48:24,167 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 08:48:24,168 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 08:48:24,168 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 08:48:24,168 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 08:48:24,168 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 08:48:24,168 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 08:48:24,169 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 08:48:24,169 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 08:48:24,169 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 08:48:24,169 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c91b09ece49acd3b34e3a7c214a3b7e265a90f1ce6244f806045e045a43605a2 [2024-10-24 08:48:24,408 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 08:48:24,424 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 08:48:24,426 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 08:48:24,427 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 08:48:24,427 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 08:48:24,428 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-73.i [2024-10-24 08:48:25,743 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 08:48:25,904 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 08:48:25,905 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-73.i [2024-10-24 08:48:25,914 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2c10cc55/f8c739dc4ea04ecb9f5a9e6ff113662e/FLAG79b31fa89 [2024-10-24 08:48:25,925 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2c10cc55/f8c739dc4ea04ecb9f5a9e6ff113662e [2024-10-24 08:48:25,927 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 08:48:25,928 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 08:48:25,929 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 08:48:25,929 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 08:48:25,936 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 08:48:25,937 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:48:25" (1/1) ... [2024-10-24 08:48:25,937 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1374679d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:25, skipping insertion in model container [2024-10-24 08:48:25,937 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 08:48:25" (1/1) ... [2024-10-24 08:48:25,959 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 08:48:26,098 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_floatingpointinfluence_has-floats_file-73.i[917,930] [2024-10-24 08:48:26,144 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:48:26,160 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 08:48:26,170 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_floatingpointinfluence_has-floats_file-73.i[917,930] [2024-10-24 08:48:26,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 08:48:26,228 INFO L204 MainTranslator]: Completed translation [2024-10-24 08:48:26,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:26 WrapperNode [2024-10-24 08:48:26,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 08:48:26,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 08:48:26,230 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 08:48:26,230 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 08:48:26,234 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:26" (1/1) ... [2024-10-24 08:48:26,248 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:26" (1/1) ... [2024-10-24 08:48:26,267 INFO L138 Inliner]: procedures = 27, calls = 28, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 110 [2024-10-24 08:48:26,269 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 08:48:26,270 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 08:48:26,271 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 08:48:26,271 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 08:48:26,278 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:26" (1/1) ... [2024-10-24 08:48:26,278 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:26" (1/1) ... [2024-10-24 08:48:26,282 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:26" (1/1) ... [2024-10-24 08:48:26,294 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 08:48:26,294 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:26" (1/1) ... [2024-10-24 08:48:26,295 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:26" (1/1) ... [2024-10-24 08:48:26,301 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:26" (1/1) ... [2024-10-24 08:48:26,307 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:26" (1/1) ... [2024-10-24 08:48:26,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:26" (1/1) ... [2024-10-24 08:48:26,313 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:26" (1/1) ... [2024-10-24 08:48:26,315 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 08:48:26,315 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 08:48:26,319 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 08:48:26,319 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 08:48:26,320 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:26" (1/1) ... [2024-10-24 08:48:26,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 08:48:26,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 08:48:26,356 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 08:48:26,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 08:48:26,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 08:48:26,399 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 08:48:26,399 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 08:48:26,399 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 08:48:26,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 08:48:26,400 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 08:48:26,473 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 08:48:26,474 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 08:48:27,604 INFO L? ?]: Removed 10 outVars from TransFormulas that were not future-live. [2024-10-24 08:48:27,605 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 08:48:27,641 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 08:48:27,642 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 08:48:27,642 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:48:27 BoogieIcfgContainer [2024-10-24 08:48:27,643 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 08:48:27,644 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 08:48:27,644 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 08:48:27,646 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 08:48:27,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 08:48:25" (1/3) ... [2024-10-24 08:48:27,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d97965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:48:27, skipping insertion in model container [2024-10-24 08:48:27,647 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 08:48:26" (2/3) ... [2024-10-24 08:48:27,647 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56d97965 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 08:48:27, skipping insertion in model container [2024-10-24 08:48:27,648 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 08:48:27" (3/3) ... [2024-10-24 08:48:27,648 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-73.i [2024-10-24 08:48:27,661 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 08:48:27,661 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 08:48:27,707 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 08:48:27,720 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;@84e0ade, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 08:48:27,721 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 08:48:27,725 INFO L276 IsEmpty]: Start isEmpty. Operand has 46 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 08:48:27,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 08:48:27,735 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:48:27,735 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:48:27,736 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:48:27,739 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:48:27,741 INFO L85 PathProgramCache]: Analyzing trace with hash -2061904121, now seen corresponding path program 1 times [2024-10-24 08:48:27,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:48:27,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1755758677] [2024-10-24 08:48:27,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:48:27,753 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:48:27,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:48:27,759 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:48:27,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 08:48:27,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:27,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 08:48:28,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:48:28,033 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2024-10-24 08:48:28,033 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:48:28,034 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:48:28,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1755758677] [2024-10-24 08:48:28,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1755758677] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:48:28,034 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:48:28,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 08:48:28,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914805969] [2024-10-24 08:48:28,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:48:28,040 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 08:48:28,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:48:28,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 08:48:28,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:48:28,058 INFO L87 Difference]: Start difference. First operand has 46 states, 28 states have (on average 1.4285714285714286) internal successors, (40), 29 states have internal predecessors, (40), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 08:48:29,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:48:29,005 INFO L93 Difference]: Finished difference Result 89 states and 153 transitions. [2024-10-24 08:48:29,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 08:48:29,027 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) Word has length 94 [2024-10-24 08:48:29,028 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:48:29,037 INFO L225 Difference]: With dead ends: 89 [2024-10-24 08:48:29,037 INFO L226 Difference]: Without dead ends: 44 [2024-10-24 08:48:29,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 08:48:29,047 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 62 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-10-24 08:48:29,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 62 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-10-24 08:48:29,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2024-10-24 08:48:29,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2024-10-24 08:48:29,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 08:48:29,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 65 transitions. [2024-10-24 08:48:29,105 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 65 transitions. Word has length 94 [2024-10-24 08:48:29,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:48:29,105 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 65 transitions. [2024-10-24 08:48:29,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 12.0) internal successors, (24), 2 states have internal predecessors, (24), 2 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 2 states have call successors, (15) [2024-10-24 08:48:29,106 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 65 transitions. [2024-10-24 08:48:29,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2024-10-24 08:48:29,108 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:48:29,108 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:48:29,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 08:48:29,309 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:48:29,310 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:48:29,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:48:29,310 INFO L85 PathProgramCache]: Analyzing trace with hash 709628301, now seen corresponding path program 1 times [2024-10-24 08:48:29,311 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:48:29,311 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1188099294] [2024-10-24 08:48:29,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:48:29,311 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:48:29,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:48:29,318 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:48:29,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 08:48:29,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:29,503 INFO L255 TraceCheckSpWp]: Trace formula consists of 155 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-24 08:48:29,508 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:48:29,590 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 08:48:29,592 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:48:29,592 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:48:29,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1188099294] [2024-10-24 08:48:29,593 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1188099294] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:48:29,593 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:48:29,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 08:48:29,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832762982] [2024-10-24 08:48:29,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:48:29,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 08:48:29,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:48:29,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 08:48:29,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 08:48:29,596 INFO L87 Difference]: Start difference. First operand 44 states and 65 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 08:48:31,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:48:31,179 INFO L93 Difference]: Finished difference Result 119 states and 177 transitions. [2024-10-24 08:48:31,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 08:48:31,180 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 94 [2024-10-24 08:48:31,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:48:31,181 INFO L225 Difference]: With dead ends: 119 [2024-10-24 08:48:31,181 INFO L226 Difference]: Without dead ends: 76 [2024-10-24 08:48:31,182 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 91 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-24 08:48:31,183 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 59 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-10-24 08:48:31,183 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 213 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-10-24 08:48:31,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-24 08:48:31,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 44. [2024-10-24 08:48:31,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 08:48:31,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 64 transitions. [2024-10-24 08:48:31,191 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 64 transitions. Word has length 94 [2024-10-24 08:48:31,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:48:31,192 INFO L471 AbstractCegarLoop]: Abstraction has 44 states and 64 transitions. [2024-10-24 08:48:31,193 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 08:48:31,193 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 64 transitions. [2024-10-24 08:48:31,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 08:48:31,194 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:48:31,194 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:48:31,202 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 08:48:31,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:48:31,399 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:48:31,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:48:31,400 INFO L85 PathProgramCache]: Analyzing trace with hash 514105839, now seen corresponding path program 1 times [2024-10-24 08:48:31,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:48:31,402 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1537921359] [2024-10-24 08:48:31,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:48:31,402 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:48:31,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:48:31,404 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:48:31,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 08:48:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:31,562 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 08:48:31,565 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 08:48:31,612 INFO L134 CoverageAnalysis]: Checked inductivity of 420 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2024-10-24 08:48:31,612 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 08:48:31,612 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 08:48:31,612 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1537921359] [2024-10-24 08:48:31,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1537921359] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 08:48:31,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 08:48:31,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 08:48:31,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655287059] [2024-10-24 08:48:31,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 08:48:31,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 08:48:31,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 08:48:31,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 08:48:31,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:48:31,618 INFO L87 Difference]: Start difference. First operand 44 states and 64 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 08:48:32,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 08:48:32,930 INFO L93 Difference]: Finished difference Result 99 states and 142 transitions. [2024-10-24 08:48:32,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 08:48:32,947 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 95 [2024-10-24 08:48:32,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 08:48:32,948 INFO L225 Difference]: With dead ends: 99 [2024-10-24 08:48:32,949 INFO L226 Difference]: Without dead ends: 56 [2024-10-24 08:48:32,949 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 08:48:32,950 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 8 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2024-10-24 08:48:32,950 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 112 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2024-10-24 08:48:32,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-24 08:48:32,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 50. [2024-10-24 08:48:32,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 33 states have (on average 1.2424242424242424) internal successors, (41), 33 states have internal predecessors, (41), 15 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2024-10-24 08:48:32,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 71 transitions. [2024-10-24 08:48:32,961 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 71 transitions. Word has length 95 [2024-10-24 08:48:32,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 08:48:32,962 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 71 transitions. [2024-10-24 08:48:32,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 1 states have call successors, (15), 1 states have call predecessors, (15), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2024-10-24 08:48:32,962 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 71 transitions. [2024-10-24 08:48:32,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2024-10-24 08:48:32,963 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 08:48:32,963 INFO L215 NwaCegarLoop]: trace histogram [15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 08:48:32,977 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-24 08:48:33,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:48:33,164 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 08:48:33,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 08:48:33,165 INFO L85 PathProgramCache]: Analyzing trace with hash 514165421, now seen corresponding path program 1 times [2024-10-24 08:48:33,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 08:48:33,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1487830549] [2024-10-24 08:48:33,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 08:48:33,165 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 08:48:33,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 08:48:33,171 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 08:48:33,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 08:48:33,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 08:48:33,351 INFO L255 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-10-24 08:48:33,356 INFO L278 TraceCheckSpWp]: Computing forward predicates...