./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-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 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-92.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 8a414fc8edfc2d8d8869c2a8a1f169297ecf9d798ee385b139bec6a9c64dec89 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:59:17,119 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:59:17,184 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 10:59:17,191 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:59:17,191 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:59:17,223 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:59:17,224 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:59:17,224 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:59:17,225 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:59:17,225 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:59:17,226 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:59:17,226 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:59:17,227 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:59:17,227 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:59:17,227 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:59:17,228 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:59:17,228 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:59:17,228 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:59:17,229 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 10:59:17,229 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:59:17,229 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:59:17,233 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:59:17,233 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:59:17,233 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:59:17,234 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:59:17,234 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:59:17,234 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:59:17,234 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:59:17,235 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:59:17,235 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:59:17,235 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:59:17,235 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:59:17,236 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:59:17,236 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:59:17,236 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:59:17,237 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:59:17,238 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 10:59:17,238 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 10:59:17,239 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:59:17,239 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:59:17,239 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:59:17,241 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:59:17,241 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 -> 8a414fc8edfc2d8d8869c2a8a1f169297ecf9d798ee385b139bec6a9c64dec89 [2024-10-14 10:59:17,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:59:17,500 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:59:17,503 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:59:17,504 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:59:17,504 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:59:17,506 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-92.i [2024-10-14 10:59:18,986 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:59:19,201 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:59:19,202 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-92.i [2024-10-14 10:59:19,210 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa05d02b5/e0cc12a88e5747598f6f5249b5a16080/FLAG785634b59 [2024-10-14 10:59:19,569 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa05d02b5/e0cc12a88e5747598f6f5249b5a16080 [2024-10-14 10:59:19,572 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:59:19,574 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:59:19,578 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:59:19,578 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:59:19,583 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:59:19,584 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:59:19" (1/1) ... [2024-10-14 10:59:19,585 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5afe105a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:19, skipping insertion in model container [2024-10-14 10:59:19,587 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:59:19" (1/1) ... [2024-10-14 10:59:19,615 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:59:19,775 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-92.i[917,930] [2024-10-14 10:59:19,825 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:59:19,835 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:59:19,847 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-92.i[917,930] [2024-10-14 10:59:19,875 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:59:19,899 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:59:19,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:19 WrapperNode [2024-10-14 10:59:19,900 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:59:19,900 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:59:19,900 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:59:19,901 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:59:19,907 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:19" (1/1) ... [2024-10-14 10:59:19,916 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:19" (1/1) ... [2024-10-14 10:59:19,953 INFO L138 Inliner]: procedures = 26, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 139 [2024-10-14 10:59:19,954 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:59:19,957 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:59:19,958 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:59:19,958 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:59:19,972 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:19" (1/1) ... [2024-10-14 10:59:19,972 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:19" (1/1) ... [2024-10-14 10:59:19,975 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:19" (1/1) ... [2024-10-14 10:59:20,000 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-14 10:59:20,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:19" (1/1) ... [2024-10-14 10:59:20,000 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:19" (1/1) ... [2024-10-14 10:59:20,006 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:19" (1/1) ... [2024-10-14 10:59:20,012 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:19" (1/1) ... [2024-10-14 10:59:20,016 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:19" (1/1) ... [2024-10-14 10:59:20,018 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:19" (1/1) ... [2024-10-14 10:59:20,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:59:20,023 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:59:20,023 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:59:20,024 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:59:20,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:19" (1/1) ... [2024-10-14 10:59:20,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:59:20,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:59:20,061 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-14 10:59:20,065 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-14 10:59:20,115 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:59:20,115 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:59:20,115 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:59:20,115 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 10:59:20,116 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:59:20,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:59:20,201 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:59:20,204 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:59:20,539 INFO L? ?]: Removed 14 outVars from TransFormulas that were not future-live. [2024-10-14 10:59:20,539 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:59:20,585 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:59:20,586 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:59:20,586 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:59:20 BoogieIcfgContainer [2024-10-14 10:59:20,587 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:59:20,588 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:59:20,589 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:59:20,591 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:59:20,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:59:19" (1/3) ... [2024-10-14 10:59:20,592 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17cf088f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:59:20, skipping insertion in model container [2024-10-14 10:59:20,592 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:19" (2/3) ... [2024-10-14 10:59:20,593 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@17cf088f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:59:20, skipping insertion in model container [2024-10-14 10:59:20,593 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:59:20" (3/3) ... [2024-10-14 10:59:20,594 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-92.i [2024-10-14 10:59:20,608 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:59:20,609 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:59:20,664 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:59:20,669 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;@269db281, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:59:20,670 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:59:20,674 INFO L276 IsEmpty]: Start isEmpty. Operand has 57 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 10:59:20,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-14 10:59:20,691 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:59:20,691 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:59:20,693 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:59:20,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:59:20,699 INFO L85 PathProgramCache]: Analyzing trace with hash 1466632263, now seen corresponding path program 1 times [2024-10-14 10:59:20,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:59:20,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815761175] [2024-10-14 10:59:20,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:59:20,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:59:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:59:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:59:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:59:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:59:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:59:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:59:21,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:59:21,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:59:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:59:21,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:59:21,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:59:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:59:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:59:21,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:59:21,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:59:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:59:21,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:59:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:59:21,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:59:21,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,131 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 10:59:21,131 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:59:21,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815761175] [2024-10-14 10:59:21,132 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1815761175] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:59:21,132 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:59:21,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:59:21,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842361300] [2024-10-14 10:59:21,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:59:21,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:59:21,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:59:21,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:59:21,167 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:59:21,169 INFO L87 Difference]: Start difference. First operand has 57 states, 35 states have (on average 1.3714285714285714) internal successors, (48), 36 states have internal predecessors, (48), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 10:59:21,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:59:21,217 INFO L93 Difference]: Finished difference Result 111 states and 189 transitions. [2024-10-14 10:59:21,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:59:21,220 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) Word has length 119 [2024-10-14 10:59:21,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:59:21,227 INFO L225 Difference]: With dead ends: 111 [2024-10-14 10:59:21,228 INFO L226 Difference]: Without dead ends: 55 [2024-10-14 10:59:21,233 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 59 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-14 10:59:21,238 INFO L432 NwaCegarLoop]: 78 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, 78 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-14 10:59:21,239 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 78 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 10:59:21,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-10-14 10:59:21,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 55. [2024-10-14 10:59:21,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.2647058823529411) internal successors, (43), 34 states have internal predecessors, (43), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 10:59:21,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 81 transitions. [2024-10-14 10:59:21,277 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 81 transitions. Word has length 119 [2024-10-14 10:59:21,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:59:21,278 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 81 transitions. [2024-10-14 10:59:21,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 10:59:21,278 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 81 transitions. [2024-10-14 10:59:21,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2024-10-14 10:59:21,281 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:59:21,282 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:59:21,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 10:59:21,283 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:59:21,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:59:21,284 INFO L85 PathProgramCache]: Analyzing trace with hash 95757697, now seen corresponding path program 1 times [2024-10-14 10:59:21,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:59:21,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809305464] [2024-10-14 10:59:21,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:59:21,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:59:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:59:21,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:59:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,840 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:59:21,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:59:21,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:59:21,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:59:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:59:21,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:59:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:59:21,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,866 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:59:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:59:21,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:59:21,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:59:21,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:59:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:59:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:59:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:59:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:59:21,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,897 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:59:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:21,900 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2024-10-14 10:59:21,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:59:21,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809305464] [2024-10-14 10:59:21,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [809305464] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:59:21,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:59:21,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 10:59:21,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720126318] [2024-10-14 10:59:21,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:59:21,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 10:59:21,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:59:21,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 10:59:21,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 10:59:21,905 INFO L87 Difference]: Start difference. First operand 55 states and 81 transitions. Second operand has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 10:59:22,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:59:22,111 INFO L93 Difference]: Finished difference Result 110 states and 162 transitions. [2024-10-14 10:59:22,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 10:59:22,114 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) Word has length 119 [2024-10-14 10:59:22,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:59:22,116 INFO L225 Difference]: With dead ends: 110 [2024-10-14 10:59:22,116 INFO L226 Difference]: Without dead ends: 56 [2024-10-14 10:59:22,117 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 10:59:22,119 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 20 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:59:22,119 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 154 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:59:22,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2024-10-14 10:59:22,127 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 55. [2024-10-14 10:59:22,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 34 states have (on average 1.2352941176470589) internal successors, (42), 34 states have internal predecessors, (42), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 10:59:22,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 80 transitions. [2024-10-14 10:59:22,132 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 80 transitions. Word has length 119 [2024-10-14 10:59:22,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:59:22,135 INFO L471 AbstractCegarLoop]: Abstraction has 55 states and 80 transitions. [2024-10-14 10:59:22,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 1 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 1 states have call predecessors, (19), 1 states have call successors, (19) [2024-10-14 10:59:22,135 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 80 transitions. [2024-10-14 10:59:22,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 10:59:22,139 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:59:22,140 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:59:22,140 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 10:59:22,141 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:59:22,141 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:59:22,141 INFO L85 PathProgramCache]: Analyzing trace with hash 1320693766, now seen corresponding path program 1 times [2024-10-14 10:59:22,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:59:22,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1575560942] [2024-10-14 10:59:22,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:59:22,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:59:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:22,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 10:59:22,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:22,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 10:59:22,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:22,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 10:59:22,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:22,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 10:59:22,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:22,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 10:59:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:22,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 10:59:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:22,627 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 10:59:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:22,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 10:59:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:22,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 10:59:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:22,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 10:59:22,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:22,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 10:59:22,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:22,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-10-14 10:59:22,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:22,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-10-14 10:59:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:22,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2024-10-14 10:59:22,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:22,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 10:59:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:22,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2024-10-14 10:59:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:22,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 10:59:22,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:22,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 10:59:22,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:22,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-10-14 10:59:22,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:22,706 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-14 10:59:22,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:59:22,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1575560942] [2024-10-14 10:59:22,709 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1575560942] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:59:22,709 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710102697] [2024-10-14 10:59:22,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:59:22,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:59:22,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:59:22,712 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 10:59:22,714 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 10:59:22,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:22,828 INFO L255 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 10:59:22,837 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:59:22,970 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 178 proven. 6 refuted. 0 times theorem prover too weak. 500 trivial. 0 not checked. [2024-10-14 10:59:22,971 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:59:23,216 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 48 proven. 6 refuted. 0 times theorem prover too weak. 630 trivial. 0 not checked. [2024-10-14 10:59:23,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710102697] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 10:59:23,217 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 10:59:23,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-14 10:59:23,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580092664] [2024-10-14 10:59:23,219 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 10:59:23,220 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 10:59:23,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:59:23,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 10:59:23,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-10-14 10:59:23,224 INFO L87 Difference]: Start difference. First operand 55 states and 80 transitions. Second operand has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 10:59:23,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:59:23,935 INFO L93 Difference]: Finished difference Result 239 states and 335 transitions. [2024-10-14 10:59:23,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-10-14 10:59:23,935 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 121 [2024-10-14 10:59:23,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:59:23,941 INFO L225 Difference]: With dead ends: 239 [2024-10-14 10:59:23,942 INFO L226 Difference]: Without dead ends: 185 [2024-10-14 10:59:23,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 275 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 136 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=206, Invalid=496, Unknown=0, NotChecked=0, Total=702 [2024-10-14 10:59:23,944 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 210 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 416 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 10:59:23,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 404 Invalid, 489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 416 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 10:59:23,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-14 10:59:23,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 61. [2024-10-14 10:59:23,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 39 states have (on average 1.205128205128205) internal successors, (47), 39 states have internal predecessors, (47), 19 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 10:59:23,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 85 transitions. [2024-10-14 10:59:23,966 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 85 transitions. Word has length 121 [2024-10-14 10:59:23,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:59:23,967 INFO L471 AbstractCegarLoop]: Abstraction has 61 states and 85 transitions. [2024-10-14 10:59:23,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.4) internal successors, (44), 10 states have internal predecessors, (44), 2 states have call successors, (21), 2 states have call predecessors, (21), 4 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 10:59:23,968 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 85 transitions. [2024-10-14 10:59:23,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 10:59:23,972 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:59:23,972 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:59:23,994 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-14 10:59:24,173 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:59:24,174 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:59:24,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:59:24,174 INFO L85 PathProgramCache]: Analyzing trace with hash 511347140, now seen corresponding path program 1 times [2024-10-14 10:59:24,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:59:24,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115314452] [2024-10-14 10:59:24,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:59:24,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:59:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 10:59:24,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2089070307] [2024-10-14 10:59:24,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:59:24,258 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:59:24,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:59:24,260 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 10:59:24,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 10:59:24,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:24,359 INFO L255 TraceCheckSpWp]: Trace formula consists of 274 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-14 10:59:24,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:59:24,911 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 479 proven. 69 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2024-10-14 10:59:24,912 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:59:25,446 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 10:59:25,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115314452] [2024-10-14 10:59:25,447 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-10-14 10:59:25,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2089070307] [2024-10-14 10:59:25,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2089070307] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:59:25,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-10-14 10:59:25,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2024-10-14 10:59:25,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [445072917] [2024-10-14 10:59:25,450 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-10-14 10:59:25,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-14 10:59:25,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 10:59:25,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-14 10:59:25,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=238, Unknown=2, NotChecked=0, Total=306 [2024-10-14 10:59:25,452 INFO L87 Difference]: Start difference. First operand 61 states and 85 transitions. Second operand has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 4 states have call successors, (19), 4 states have call predecessors, (19), 7 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-14 10:59:26,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:59:26,062 INFO L93 Difference]: Finished difference Result 139 states and 185 transitions. [2024-10-14 10:59:26,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-14 10:59:26,064 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 4 states have call successors, (19), 4 states have call predecessors, (19), 7 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) Word has length 121 [2024-10-14 10:59:26,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:59:26,066 INFO L225 Difference]: With dead ends: 139 [2024-10-14 10:59:26,068 INFO L226 Difference]: Without dead ends: 79 [2024-10-14 10:59:26,069 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 167 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=151, Invalid=497, Unknown=2, NotChecked=0, Total=650 [2024-10-14 10:59:26,070 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 106 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 498 mSolverCounterSat, 35 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 539 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 498 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-14 10:59:26,073 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 181 Invalid, 539 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 498 Invalid, 6 Unknown, 0 Unchecked, 0.4s Time] [2024-10-14 10:59:26,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-10-14 10:59:26,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 71. [2024-10-14 10:59:26,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 46 states have (on average 1.1521739130434783) internal successors, (53), 46 states have internal predecessors, (53), 19 states have call successors, (19), 5 states have call predecessors, (19), 5 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 10:59:26,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 91 transitions. [2024-10-14 10:59:26,088 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 91 transitions. Word has length 121 [2024-10-14 10:59:26,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:59:26,088 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 91 transitions. [2024-10-14 10:59:26,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.1333333333333333) internal successors, (47), 15 states have internal predecessors, (47), 4 states have call successors, (19), 4 states have call predecessors, (19), 7 states have return successors, (19), 4 states have call predecessors, (19), 4 states have call successors, (19) [2024-10-14 10:59:26,089 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 91 transitions. [2024-10-14 10:59:26,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2024-10-14 10:59:26,090 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:59:26,090 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:59:26,109 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-14 10:59:26,294 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2024-10-14 10:59:26,295 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:59:26,295 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:59:26,295 INFO L85 PathProgramCache]: Analyzing trace with hash 927666756, now seen corresponding path program 1 times [2024-10-14 10:59:26,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 10:59:26,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117526839] [2024-10-14 10:59:26,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:59:26,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 10:59:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 10:59:26,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2094523282] [2024-10-14 10:59:26,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:59:26,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:59:26,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:59:26,349 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 10:59:26,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 10:59:26,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:59:26,448 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 10:59:26,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 10:59:26,599 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 10:59:26,600 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 10:59:26,601 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 10:59:26,621 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 10:59:26,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 10:59:26,806 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2024-10-14 10:59:26,902 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 10:59:26,905 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 10:59:26 BoogieIcfgContainer [2024-10-14 10:59:26,905 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 10:59:26,906 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 10:59:26,906 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 10:59:26,906 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 10:59:26,907 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:59:20" (3/4) ... [2024-10-14 10:59:26,911 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 10:59:26,912 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 10:59:26,912 INFO L158 Benchmark]: Toolchain (without parser) took 7338.25ms. Allocated memory was 165.7MB in the beginning and 207.6MB in the end (delta: 41.9MB). Free memory was 99.0MB in the beginning and 129.9MB in the end (delta: -30.9MB). Peak memory consumption was 12.3MB. Max. memory is 16.1GB. [2024-10-14 10:59:26,912 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 113.2MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:59:26,913 INFO L158 Benchmark]: CACSL2BoogieTranslator took 322.19ms. Allocated memory is still 165.7MB. Free memory was 98.8MB in the beginning and 85.4MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 10:59:26,913 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.38ms. Allocated memory is still 165.7MB. Free memory was 85.4MB in the beginning and 82.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 10:59:26,913 INFO L158 Benchmark]: Boogie Preprocessor took 64.93ms. Allocated memory is still 165.7MB. Free memory was 82.9MB in the beginning and 79.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-14 10:59:26,913 INFO L158 Benchmark]: RCFGBuilder took 563.36ms. Allocated memory is still 165.7MB. Free memory was 79.7MB in the beginning and 125.1MB in the end (delta: -45.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 10:59:26,914 INFO L158 Benchmark]: TraceAbstraction took 6317.00ms. Allocated memory was 165.7MB in the beginning and 207.6MB in the end (delta: 41.9MB). Free memory was 124.5MB in the beginning and 131.0MB in the end (delta: -6.5MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. [2024-10-14 10:59:26,914 INFO L158 Benchmark]: Witness Printer took 5.69ms. Allocated memory is still 207.6MB. Free memory was 131.0MB in the beginning and 129.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 10:59:26,916 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.16ms. Allocated memory is still 113.2MB. Free memory is still 74.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 322.19ms. Allocated memory is still 165.7MB. Free memory was 98.8MB in the beginning and 85.4MB in the end (delta: 13.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.38ms. Allocated memory is still 165.7MB. Free memory was 85.4MB in the beginning and 82.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.93ms. Allocated memory is still 165.7MB. Free memory was 82.9MB in the beginning and 79.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 563.36ms. Allocated memory is still 165.7MB. Free memory was 79.7MB in the beginning and 125.1MB in the end (delta: -45.4MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 6317.00ms. Allocated memory was 165.7MB in the beginning and 207.6MB in the end (delta: 41.9MB). Free memory was 124.5MB in the beginning and 131.0MB in the end (delta: -6.5MB). Peak memory consumption was 37.8MB. Max. memory is 16.1GB. * Witness Printer took 5.69ms. Allocated memory is still 207.6MB. Free memory was 131.0MB in the beginning and 129.9MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 94, overapproximation of someBinaryFLOATComparisonOperation at line 94. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 32; [L23] signed char var_1_2 = 2; [L24] signed char var_1_3 = 8; [L25] signed char var_1_4 = 0; [L26] signed char var_1_5 = 32; [L27] signed char var_1_6 = 10; [L28] double var_1_7 = 1000000.625; [L29] double var_1_8 = 16.65; [L30] double var_1_9 = 15.5; [L31] signed short int var_1_10 = 500; [L32] unsigned short int var_1_11 = 8; [L33] unsigned char var_1_13 = 0; [L34] unsigned short int var_1_14 = 100; [L35] unsigned char var_1_15 = 0; [L36] unsigned char var_1_16 = 0; [L37] float var_1_17 = 2.4; [L98] isInitial = 1 [L99] FCALL initially() [L100] COND TRUE 1 [L101] FCALL updateLastVariables() [L102] CALL updateVariables() [L61] var_1_2 = __VERIFIER_nondet_char() [L62] CALL assume_abort_if_not(var_1_2 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L62] RET assume_abort_if_not(var_1_2 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L63] CALL assume_abort_if_not(var_1_2 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L63] RET assume_abort_if_not(var_1_2 <= 63) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=8, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L64] var_1_3 = __VERIFIER_nondet_char() [L65] CALL assume_abort_if_not(var_1_3 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L65] RET assume_abort_if_not(var_1_3 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L66] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L66] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L67] var_1_4 = __VERIFIER_nondet_char() [L68] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L68] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L69] CALL assume_abort_if_not(var_1_4 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L69] RET assume_abort_if_not(var_1_4 <= 126) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=32, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L70] var_1_5 = __VERIFIER_nondet_char() [L71] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L71] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L72] CALL assume_abort_if_not(var_1_5 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L72] RET assume_abort_if_not(var_1_5 <= 63) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=10, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L73] var_1_6 = __VERIFIER_nondet_char() [L74] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L74] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L75] CALL assume_abort_if_not(var_1_6 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L75] RET assume_abort_if_not(var_1_6 <= 63) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8, var_1_8=333/20, var_1_9=31/2] [L76] var_1_8 = __VERIFIER_nondet_double() [L77] CALL assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8, var_1_9=31/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8, var_1_9=31/2] [L77] RET assume_abort_if_not((var_1_8 >= -922337.2036854765600e+13F && var_1_8 <= -1.0e-20F) || (var_1_8 <= 9223372.036854765600e+12F && var_1_8 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8, var_1_9=31/2] [L78] var_1_9 = __VERIFIER_nondet_double() [L79] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L79] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=100, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L80] var_1_14 = __VERIFIER_nondet_ushort() [L81] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L81] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L82] CALL assume_abort_if_not(var_1_14 <= 65535) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L82] RET assume_abort_if_not(var_1_14 <= 65535) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L83] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L83] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L84] var_1_15 = __VERIFIER_nondet_uchar() [L85] CALL assume_abort_if_not(var_1_15 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L85] RET assume_abort_if_not(var_1_15 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L86] CALL assume_abort_if_not(var_1_15 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L86] RET assume_abort_if_not(var_1_15 <= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L87] var_1_16 = __VERIFIER_nondet_uchar() [L88] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L88] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L89] CALL assume_abort_if_not(var_1_16 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L89] RET assume_abort_if_not(var_1_16 <= 0) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=32, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L102] RET updateVariables() [L103] CALL step() [L41] var_1_1 = ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))) VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L42] EXPR var_1_6 & var_1_3 VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=8000005/8] [L42] signed long int stepLocal_0 = (~ var_1_5) * (var_1_6 & var_1_3); [L43] COND TRUE stepLocal_0 >= var_1_4 [L44] var_1_7 = var_1_8 VAL [isInitial=1, var_1_10=500, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=2, var_1_8=2] [L48] var_1_10 = ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2))) [L49] signed long int stepLocal_1 = var_1_6 / var_1_14; VAL [isInitial=1, stepLocal_1=0, var_1_10=63, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=2, var_1_8=2] [L50] COND FALSE !(stepLocal_1 < -100) [L53] var_1_13 = (var_1_15 && var_1_16) VAL [isInitial=1, var_1_10=63, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=12/5, var_1_1=0, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=2, var_1_8=2] [L55] var_1_17 = var_1_8 VAL [isInitial=1, var_1_10=63, var_1_11=8, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=2, var_1_8=2] [L56] COND TRUE ! var_1_13 [L57] var_1_11 = (var_1_5 + (((((var_1_6) > (1)) ? (var_1_6) : (1))) + 64)) VAL [isInitial=1, var_1_10=63, var_1_11=127, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=2, var_1_8=2] [L103] RET step() [L104] CALL, EXPR property() [L94] EXPR (var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : (var_1_7 == ((double) var_1_9))) VAL [isInitial=1, var_1_10=63, var_1_11=127, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=2, var_1_8=2] [L94] EXPR var_1_6 & var_1_3 VAL [isInitial=1, var_1_10=63, var_1_11=127, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=2, var_1_8=2] [L94] EXPR (var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : (var_1_7 == ((double) var_1_9))) VAL [isInitial=1, var_1_10=63, var_1_11=127, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=2, var_1_8=2] [L94-L95] return (((((var_1_1 == ((signed char) ((var_1_2 + var_1_3) - ((((var_1_4) > ((var_1_5 + var_1_6))) ? (var_1_4) : ((var_1_5 + var_1_6))))))) && ((((~ var_1_5) * (var_1_6 & var_1_3)) >= var_1_4) ? (var_1_7 == ((double) var_1_8)) : (var_1_7 == ((double) var_1_9)))) && (var_1_10 == ((signed short int) ((((var_1_2) < 0 ) ? -(var_1_2) : (var_1_2)))))) && ((! var_1_13) ? (var_1_11 == ((unsigned short int) (var_1_5 + (((((var_1_6) > (1)) ? (var_1_6) : (1))) + 64)))) : 1)) && (((var_1_6 / var_1_14) < -100) ? (var_1_13 == ((unsigned char) (! (! (! var_1_15))))) : (var_1_13 == ((unsigned char) (var_1_15 && var_1_16))))) && (var_1_17 == ((float) var_1_8)) ; [L104] RET, EXPR property() [L104] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=63, var_1_11=127, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=2, var_1_8=2] [L19] reach_error() VAL [isInitial=1, var_1_10=63, var_1_11=127, var_1_13=0, var_1_14=64, var_1_15=0, var_1_16=0, var_1_17=2, var_1_1=0, var_1_2=63, var_1_3=0, var_1_4=0, var_1_5=0, var_1_6=63, var_1_7=2, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 57 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 6.2s, OverallIterations: 5, TraceHistogramMax: 19, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 6 mSolverCounterUnknown, 378 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 336 mSDsluCounter, 817 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 549 mSDsCounter, 108 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 977 IncrementalHoareTripleChecker+Invalid, 1091 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 108 mSolverCounterUnsat, 268 mSDtfsCounter, 977 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 571 GetRequests, 517 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 255 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=71occurred in iteration=4, InterpolantAutomatonStates: 50, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 133 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.8s InterpolantComputationTime, 964 NumberOfCodeBlocks, 964 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 716 ConstructedInterpolants, 1 QuantifiedInterpolants, 3182 SizeOfPredicates, 6 NumberOfNonLiveVariables, 551 ConjunctsInSsa, 32 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 4017/4104 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-14 10:59:26,948 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-92.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 8a414fc8edfc2d8d8869c2a8a1f169297ecf9d798ee385b139bec6a9c64dec89 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 10:59:29,075 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 10:59:29,157 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 10:59:29,164 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 10:59:29,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 10:59:29,198 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 10:59:29,202 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 10:59:29,203 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 10:59:29,203 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 10:59:29,204 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 10:59:29,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 10:59:29,205 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 10:59:29,205 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 10:59:29,207 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 10:59:29,208 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 10:59:29,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 10:59:29,209 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 10:59:29,209 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 10:59:29,209 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 10:59:29,210 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 10:59:29,210 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 10:59:29,214 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 10:59:29,214 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 10:59:29,214 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 10:59:29,215 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 10:59:29,215 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 10:59:29,215 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 10:59:29,216 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 10:59:29,216 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 10:59:29,216 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 10:59:29,216 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 10:59:29,217 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 10:59:29,217 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 10:59:29,217 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 10:59:29,218 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:59:29,227 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 10:59:29,227 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 10:59:29,227 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 10:59:29,227 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 10:59:29,228 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 10:59:29,228 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 10:59:29,231 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 10:59:29,231 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 10:59:29,231 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 10:59:29,231 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 10:59:29,232 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 -> 8a414fc8edfc2d8d8869c2a8a1f169297ecf9d798ee385b139bec6a9c64dec89 [2024-10-14 10:59:29,539 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 10:59:29,561 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 10:59:29,566 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 10:59:29,567 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 10:59:29,568 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 10:59:29,569 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-92.i [2024-10-14 10:59:31,119 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 10:59:31,330 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 10:59:31,331 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_floatingpointinfluence_has-floats_file-92.i [2024-10-14 10:59:31,345 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c1903dbc/01682e889a6a400093477bd07b824671/FLAGd5fd2e46c [2024-10-14 10:59:31,365 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3c1903dbc/01682e889a6a400093477bd07b824671 [2024-10-14 10:59:31,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 10:59:31,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 10:59:31,375 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 10:59:31,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 10:59:31,381 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 10:59:31,382 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:59:31" (1/1) ... [2024-10-14 10:59:31,383 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35de7897 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:31, skipping insertion in model container [2024-10-14 10:59:31,383 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 10:59:31" (1/1) ... [2024-10-14 10:59:31,413 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 10:59:31,597 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-92.i[917,930] [2024-10-14 10:59:31,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:59:31,681 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 10:59:31,694 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-92.i[917,930] [2024-10-14 10:59:31,724 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 10:59:31,745 INFO L204 MainTranslator]: Completed translation [2024-10-14 10:59:31,746 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:31 WrapperNode [2024-10-14 10:59:31,746 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 10:59:31,747 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 10:59:31,747 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 10:59:31,747 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 10:59:31,753 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:31" (1/1) ... [2024-10-14 10:59:31,767 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:31" (1/1) ... [2024-10-14 10:59:31,803 INFO L138 Inliner]: procedures = 27, calls = 32, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 112 [2024-10-14 10:59:31,804 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 10:59:31,805 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 10:59:31,805 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 10:59:31,805 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 10:59:31,816 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:31" (1/1) ... [2024-10-14 10:59:31,816 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:31" (1/1) ... [2024-10-14 10:59:31,822 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:31" (1/1) ... [2024-10-14 10:59:31,841 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-14 10:59:31,842 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:31" (1/1) ... [2024-10-14 10:59:31,842 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:31" (1/1) ... [2024-10-14 10:59:31,852 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:31" (1/1) ... [2024-10-14 10:59:31,860 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:31" (1/1) ... [2024-10-14 10:59:31,863 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:31" (1/1) ... [2024-10-14 10:59:31,868 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:31" (1/1) ... [2024-10-14 10:59:31,875 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 10:59:31,876 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 10:59:31,876 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 10:59:31,876 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 10:59:31,877 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:31" (1/1) ... [2024-10-14 10:59:31,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 10:59:31,894 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 10:59:31,908 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-14 10:59:31,914 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-14 10:59:31,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 10:59:31,951 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 10:59:31,952 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 10:59:31,952 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 10:59:31,952 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 10:59:31,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 10:59:32,044 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 10:59:32,046 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 10:59:32,640 INFO L? ?]: Removed 12 outVars from TransFormulas that were not future-live. [2024-10-14 10:59:32,640 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 10:59:32,705 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 10:59:32,705 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 10:59:32,706 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:59:32 BoogieIcfgContainer [2024-10-14 10:59:32,706 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 10:59:32,708 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 10:59:32,708 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 10:59:32,714 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 10:59:32,714 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 10:59:31" (1/3) ... [2024-10-14 10:59:32,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1d9818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:59:32, skipping insertion in model container [2024-10-14 10:59:32,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 10:59:31" (2/3) ... [2024-10-14 10:59:32,715 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c1d9818 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 10:59:32, skipping insertion in model container [2024-10-14 10:59:32,715 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 10:59:32" (3/3) ... [2024-10-14 10:59:32,717 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_floatingpointinfluence_has-floats_file-92.i [2024-10-14 10:59:32,734 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 10:59:32,734 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 10:59:32,814 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 10:59:32,823 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;@70a2c446, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 10:59:32,824 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 10:59:32,829 INFO L276 IsEmpty]: Start isEmpty. Operand has 47 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 10:59:32,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 10:59:32,842 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:59:32,843 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:59:32,844 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:59:32,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:59:32,850 INFO L85 PathProgramCache]: Analyzing trace with hash 1944405470, now seen corresponding path program 1 times [2024-10-14 10:59:32,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:59:32,865 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741989222] [2024-10-14 10:59:32,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:59:32,866 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-14 10:59:32,866 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:59:32,869 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-14 10:59:32,870 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-14 10:59:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:33,111 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 10:59:33,120 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:59:33,174 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 356 proven. 0 refuted. 0 times theorem prover too weak. 328 trivial. 0 not checked. [2024-10-14 10:59:33,175 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 10:59:33,176 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:59:33,176 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741989222] [2024-10-14 10:59:33,176 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741989222] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 10:59:33,177 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 10:59:33,177 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 10:59:33,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566946983] [2024-10-14 10:59:33,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 10:59:33,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 10:59:33,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 10:59:33,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 10:59:33,210 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 10:59:33,212 INFO L87 Difference]: Start difference. First operand has 47 states, 25 states have (on average 1.32) internal successors, (33), 26 states have internal predecessors, (33), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 10:59:33,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 10:59:33,382 INFO L93 Difference]: Finished difference Result 91 states and 159 transitions. [2024-10-14 10:59:33,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 10:59:33,395 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 115 [2024-10-14 10:59:33,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 10:59:33,401 INFO L225 Difference]: With dead ends: 91 [2024-10-14 10:59:33,402 INFO L226 Difference]: Without dead ends: 45 [2024-10-14 10:59:33,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 114 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-14 10:59:33,408 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 63 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.1s IncrementalHoareTripleChecker+Time [2024-10-14 10:59:33,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 63 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 10:59:33,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2024-10-14 10:59:33,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2024-10-14 10:59:33,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 24 states have (on average 1.1666666666666667) internal successors, (28), 24 states have internal predecessors, (28), 19 states have call successors, (19), 1 states have call predecessors, (19), 1 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2024-10-14 10:59:33,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 66 transitions. [2024-10-14 10:59:33,445 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 66 transitions. Word has length 115 [2024-10-14 10:59:33,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 10:59:33,446 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 66 transitions. [2024-10-14 10:59:33,446 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 13.5) internal successors, (27), 2 states have internal predecessors, (27), 2 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2024-10-14 10:59:33,446 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 66 transitions. [2024-10-14 10:59:33,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2024-10-14 10:59:33,449 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 10:59:33,449 INFO L215 NwaCegarLoop]: trace histogram [19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 10:59:33,457 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-14 10:59:33,651 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-14 10:59:33,652 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 10:59:33,653 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 10:59:33,653 INFO L85 PathProgramCache]: Analyzing trace with hash 1324552216, now seen corresponding path program 1 times [2024-10-14 10:59:33,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 10:59:33,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111879287] [2024-10-14 10:59:33,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:59:33,655 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-14 10:59:33,655 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 10:59:33,659 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-14 10:59:33,660 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-14 10:59:33,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:33,850 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-14 10:59:33,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:59:34,701 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 456 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-10-14 10:59:34,703 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 10:59:35,609 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 10:59:35,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111879287] [2024-10-14 10:59:35,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111879287] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 10:59:35,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc5 [1254625869] [2024-10-14 10:59:35,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 10:59:35,610 INFO L173 SolverBuilder]: Constructing external solver with command: cvc5 --incremental --print-success --lang smt [2024-10-14 10:59:35,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 [2024-10-14 10:59:35,614 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-14 10:59:35,615 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc5 --incremental --print-success --lang smt (4)] Waiting until timeout for monitored process [2024-10-14 10:59:35,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 10:59:35,872 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 67 conjuncts are in the unsatisfiable core [2024-10-14 10:59:35,881 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 10:59:39,942 INFO L134 CoverageAnalysis]: Checked inductivity of 684 backedges. 456 proven. 39 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-10-14 10:59:39,943 INFO L311 TraceCheckSpWp]: Computing backward predicates...