./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_loopvsstraightlinecode_100-1loop_file-84.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-84.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 046e4169d322167d7576c9c2b9007e1beb6aeeec9394209bc254f3d13fdc20dd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:10:25,403 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:10:25,487 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-24 09:10:25,491 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:10:25,491 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:10:25,530 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:10:25,530 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:10:25,531 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:10:25,531 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:10:25,533 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:10:25,536 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:10:25,537 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:10:25,537 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:10:25,537 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:10:25,538 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:10:25,538 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:10:25,538 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:10:25,538 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:10:25,539 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 09:10:25,539 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:10:25,539 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:10:25,540 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:10:25,540 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:10:25,540 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:10:25,540 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:10:25,541 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:10:25,541 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:10:25,543 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:10:25,543 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:10:25,543 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:10:25,544 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:10:25,544 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:10:25,544 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:10:25,544 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:10:25,544 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:10:25,545 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:10:25,545 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 09:10:25,545 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 09:10:25,545 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:10:25,545 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:10:25,546 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:10:25,547 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:10:25,548 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 -> 046e4169d322167d7576c9c2b9007e1beb6aeeec9394209bc254f3d13fdc20dd [2024-10-24 09:10:25,794 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:10:25,816 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:10:25,820 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:10:25,821 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:10:25,821 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:10:25,823 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-84.i [2024-10-24 09:10:27,291 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:10:27,497 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:10:27,501 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-84.i [2024-10-24 09:10:27,511 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e36588834/91831ae748774c1d97e29a262f2a7e44/FLAGd17fcb1bb [2024-10-24 09:10:27,526 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e36588834/91831ae748774c1d97e29a262f2a7e44 [2024-10-24 09:10:27,528 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:10:27,529 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:10:27,530 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:10:27,530 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:10:27,536 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:10:27,537 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:10:27" (1/1) ... [2024-10-24 09:10:27,538 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7a0844fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:27, skipping insertion in model container [2024-10-24 09:10:27,538 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:10:27" (1/1) ... [2024-10-24 09:10:27,570 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:10:27,748 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_loopvsstraightlinecode_100-1loop_file-84.i[916,929] [2024-10-24 09:10:27,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:10:27,891 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:10:27,903 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_loopvsstraightlinecode_100-1loop_file-84.i[916,929] [2024-10-24 09:10:27,960 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:10:27,986 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:10:27,987 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:27 WrapperNode [2024-10-24 09:10:27,987 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:10:27,988 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:10:27,988 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:10:27,988 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:10:27,994 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:27" (1/1) ... [2024-10-24 09:10:28,004 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:27" (1/1) ... [2024-10-24 09:10:28,050 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 193 [2024-10-24 09:10:28,050 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:10:28,051 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:10:28,051 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:10:28,051 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:10:28,062 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:27" (1/1) ... [2024-10-24 09:10:28,062 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:27" (1/1) ... [2024-10-24 09:10:28,070 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:27" (1/1) ... [2024-10-24 09:10:28,102 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 09:10:28,103 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:27" (1/1) ... [2024-10-24 09:10:28,103 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:27" (1/1) ... [2024-10-24 09:10:28,116 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:27" (1/1) ... [2024-10-24 09:10:28,122 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:27" (1/1) ... [2024-10-24 09:10:28,130 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:27" (1/1) ... [2024-10-24 09:10:28,135 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:27" (1/1) ... [2024-10-24 09:10:28,146 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:10:28,148 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:10:28,148 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:10:28,148 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:10:28,149 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:27" (1/1) ... [2024-10-24 09:10:28,154 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:10:28,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:10:28,180 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:10:28,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:10:28,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:10:28,233 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:10:28,233 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:10:28,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-24 09:10:28,233 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:10:28,233 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:10:28,343 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:10:28,346 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:10:28,750 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-10-24 09:10:28,750 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:10:28,813 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:10:28,813 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:10:28,815 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:10:28 BoogieIcfgContainer [2024-10-24 09:10:28,815 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:10:28,817 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:10:28,817 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:10:28,820 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:10:28,821 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:10:27" (1/3) ... [2024-10-24 09:10:28,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd6b055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:10:28, skipping insertion in model container [2024-10-24 09:10:28,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:27" (2/3) ... [2024-10-24 09:10:28,823 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7bd6b055 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:10:28, skipping insertion in model container [2024-10-24 09:10:28,823 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:10:28" (3/3) ... [2024-10-24 09:10:28,824 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-84.i [2024-10-24 09:10:28,840 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:10:28,841 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:10:28,912 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:10:28,919 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;@685e629b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:10:28,919 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:10:28,923 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 09:10:28,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 09:10:28,940 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:10:28,941 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:10:28,941 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:10:28,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:10:28,947 INFO L85 PathProgramCache]: Analyzing trace with hash -738045709, now seen corresponding path program 1 times [2024-10-24 09:10:28,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:10:28,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250619851] [2024-10-24 09:10:28,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:10:28,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:10:29,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,309 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:10:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,318 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 09:10:29,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,330 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 09:10:29,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 09:10:29,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 09:10:29,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 09:10:29,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 09:10:29,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,372 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 09:10:29,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 09:10:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,383 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 09:10:29,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 09:10:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 09:10:29,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 09:10:29,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,399 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 09:10:29,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 09:10:29,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 09:10:29,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 09:10:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,411 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 09:10:29,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 09:10:29,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 09:10:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 09:10:29,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,429 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 09:10:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 09:10:29,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 09:10:29,442 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:10:29,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250619851] [2024-10-24 09:10:29,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1250619851] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:10:29,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:10:29,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:10:29,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432759881] [2024-10-24 09:10:29,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:10:29,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:10:29,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:10:29,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:10:29,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:10:29,470 INFO L87 Difference]: Start difference. First operand has 74 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 09:10:29,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:10:29,522 INFO L93 Difference]: Finished difference Result 147 states and 256 transitions. [2024-10-24 09:10:29,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:10:29,528 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2024-10-24 09:10:29,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:10:29,536 INFO L225 Difference]: With dead ends: 147 [2024-10-24 09:10:29,537 INFO L226 Difference]: Without dead ends: 72 [2024-10-24 09:10:29,541 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 71 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:10:29,546 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:10:29,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:10:29,569 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-24 09:10:29,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-24 09:10:29,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 09:10:29,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 111 transitions. [2024-10-24 09:10:29,613 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 111 transitions. Word has length 150 [2024-10-24 09:10:29,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:10:29,614 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 111 transitions. [2024-10-24 09:10:29,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 09:10:29,616 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 111 transitions. [2024-10-24 09:10:29,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 09:10:29,619 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:10:29,619 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:10:29,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 09:10:29,619 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:10:29,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:10:29,623 INFO L85 PathProgramCache]: Analyzing trace with hash 408231469, now seen corresponding path program 1 times [2024-10-24 09:10:29,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:10:29,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097970238] [2024-10-24 09:10:29,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:10:29,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:10:29,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:10:29,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 09:10:29,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 09:10:29,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 09:10:29,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 09:10:29,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 09:10:29,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 09:10:29,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 09:10:29,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 09:10:29,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 09:10:29,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 09:10:29,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 09:10:29,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 09:10:29,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 09:10:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 09:10:29,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 09:10:29,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 09:10:29,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 09:10:29,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 09:10:29,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:29,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 09:10:29,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 09:10:30,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 09:10:30,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 09:10:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,024 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 09:10:30,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:10:30,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097970238] [2024-10-24 09:10:30,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097970238] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:10:30,026 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:10:30,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:10:30,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819441058] [2024-10-24 09:10:30,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:10:30,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:10:30,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:10:30,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:10:30,033 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:10:30,034 INFO L87 Difference]: Start difference. First operand 72 states and 111 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 09:10:30,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:10:30,107 INFO L93 Difference]: Finished difference Result 178 states and 271 transitions. [2024-10-24 09:10:30,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:10:30,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 150 [2024-10-24 09:10:30,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:10:30,112 INFO L225 Difference]: With dead ends: 178 [2024-10-24 09:10:30,112 INFO L226 Difference]: Without dead ends: 107 [2024-10-24 09:10:30,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:10:30,114 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 44 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:10:30,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 229 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-24 09:10:30,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-10-24 09:10:30,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2024-10-24 09:10:30,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 70 states have (on average 1.3714285714285714) internal successors, (96), 71 states have internal predecessors, (96), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 09:10:30,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 158 transitions. [2024-10-24 09:10:30,145 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 158 transitions. Word has length 150 [2024-10-24 09:10:30,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:10:30,148 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 158 transitions. [2024-10-24 09:10:30,148 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 09:10:30,149 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 158 transitions. [2024-10-24 09:10:30,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 09:10:30,152 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:10:30,152 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:10:30,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 09:10:30,153 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:10:30,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:10:30,154 INFO L85 PathProgramCache]: Analyzing trace with hash 465489771, now seen corresponding path program 1 times [2024-10-24 09:10:30,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:10:30,155 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1043013421] [2024-10-24 09:10:30,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:10:30,155 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:10:30,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,387 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:10:30,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 09:10:30,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 09:10:30,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 09:10:30,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 09:10:30,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 09:10:30,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 09:10:30,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 09:10:30,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 09:10:30,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 09:10:30,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 09:10:30,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 09:10:30,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 09:10:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 09:10:30,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 09:10:30,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 09:10:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 09:10:30,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,443 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 09:10:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 09:10:30,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 09:10:30,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 09:10:30,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 09:10:30,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 09:10:30,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:30,462 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 09:10:30,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:10:30,464 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1043013421] [2024-10-24 09:10:30,464 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1043013421] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:10:30,464 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:10:30,464 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:10:30,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109532416] [2024-10-24 09:10:30,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:10:30,466 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:10:30,467 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:10:30,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:10:30,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:10:30,470 INFO L87 Difference]: Start difference. First operand 104 states and 158 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 09:10:30,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:10:30,550 INFO L93 Difference]: Finished difference Result 207 states and 315 transitions. [2024-10-24 09:10:30,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:10:30,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 150 [2024-10-24 09:10:30,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:10:30,558 INFO L225 Difference]: With dead ends: 207 [2024-10-24 09:10:30,558 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 09:10:30,559 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:10:30,560 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:10:30,560 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:10:30,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 09:10:30,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-24 09:10:30,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 71 states have internal predecessors, (95), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 09:10:30,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 157 transitions. [2024-10-24 09:10:30,581 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 157 transitions. Word has length 150 [2024-10-24 09:10:30,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:10:30,584 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 157 transitions. [2024-10-24 09:10:30,584 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 09:10:30,584 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 157 transitions. [2024-10-24 09:10:30,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 09:10:30,586 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:10:30,586 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:10:30,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 09:10:30,587 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:10:30,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:10:30,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1052295785, now seen corresponding path program 1 times [2024-10-24 09:10:30,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:10:30,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1561032770] [2024-10-24 09:10:30,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:10:30,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:10:30,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:10:31,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 09:10:31,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 09:10:31,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 09:10:31,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 09:10:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 09:10:31,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 09:10:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 09:10:31,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 09:10:31,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 09:10:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 09:10:31,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 09:10:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 09:10:31,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 09:10:31,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 09:10:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 09:10:31,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 09:10:31,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 09:10:31,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 09:10:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 09:10:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 09:10:31,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 09:10:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 09:10:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,097 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 09:10:31,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:10:31,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1561032770] [2024-10-24 09:10:31,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1561032770] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:10:31,100 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:10:31,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-24 09:10:31,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539985725] [2024-10-24 09:10:31,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:10:31,101 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:10:31,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:10:31,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:10:31,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 09:10:31,103 INFO L87 Difference]: Start difference. First operand 104 states and 157 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 09:10:31,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:10:31,182 INFO L93 Difference]: Finished difference Result 209 states and 314 transitions. [2024-10-24 09:10:31,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:10:31,182 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 150 [2024-10-24 09:10:31,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:10:31,184 INFO L225 Difference]: With dead ends: 209 [2024-10-24 09:10:31,184 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 09:10:31,185 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-24 09:10:31,186 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 44 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 09:10:31,186 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 355 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 09:10:31,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 09:10:31,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2024-10-24 09:10:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 70 states have internal predecessors, (93), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 09:10:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 155 transitions. [2024-10-24 09:10:31,204 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 155 transitions. Word has length 150 [2024-10-24 09:10:31,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:10:31,205 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 155 transitions. [2024-10-24 09:10:31,205 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 09:10:31,206 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 155 transitions. [2024-10-24 09:10:31,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 09:10:31,207 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:10:31,207 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:10:31,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 09:10:31,208 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:10:31,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:10:31,208 INFO L85 PathProgramCache]: Analyzing trace with hash -36801245, now seen corresponding path program 1 times [2024-10-24 09:10:31,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:10:31,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858794150] [2024-10-24 09:10:31,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:10:31,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:10:31,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-24 09:10:31,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,906 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 09:10:31,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-24 09:10:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 09:10:31,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,919 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-10-24 09:10:31,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-10-24 09:10:31,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-10-24 09:10:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-10-24 09:10:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-10-24 09:10:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-10-24 09:10:31,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,943 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-10-24 09:10:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-10-24 09:10:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-10-24 09:10:31,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,955 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-24 09:10:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,960 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-24 09:10:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-24 09:10:31,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-24 09:10:31,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-24 09:10:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-24 09:10:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-10-24 09:10:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-10-24 09:10:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:31,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-10-24 09:10:31,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:32,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-10-24 09:10:32,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:32,004 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 09:10:32,005 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 09:10:32,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858794150] [2024-10-24 09:10:32,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [858794150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:10:32,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:10:32,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 09:10:32,006 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134634861] [2024-10-24 09:10:32,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:10:32,006 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 09:10:32,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 09:10:32,007 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 09:10:32,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-10-24 09:10:32,008 INFO L87 Difference]: Start difference. First operand 103 states and 155 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 09:10:32,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:10:32,548 INFO L93 Difference]: Finished difference Result 471 states and 707 transitions. [2024-10-24 09:10:32,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-24 09:10:32,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 150 [2024-10-24 09:10:32,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:10:32,556 INFO L225 Difference]: With dead ends: 471 [2024-10-24 09:10:32,557 INFO L226 Difference]: Without dead ends: 369 [2024-10-24 09:10:32,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-24 09:10:32,559 INFO L432 NwaCegarLoop]: 169 mSDtfsCounter, 259 mSDsluCounter, 298 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 164 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 318 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 164 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-24 09:10:32,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 467 Invalid, 318 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [164 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-24 09:10:32,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 369 states. [2024-10-24 09:10:32,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 369 to 213. [2024-10-24 09:10:32,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 213 states, 146 states have (on average 1.36986301369863) internal successors, (200), 148 states have internal predecessors, (200), 62 states have call successors, (62), 4 states have call predecessors, (62), 4 states have return successors, (62), 60 states have call predecessors, (62), 62 states have call successors, (62) [2024-10-24 09:10:32,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 213 states to 213 states and 324 transitions. [2024-10-24 09:10:32,619 INFO L78 Accepts]: Start accepts. Automaton has 213 states and 324 transitions. Word has length 150 [2024-10-24 09:10:32,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:10:32,620 INFO L471 AbstractCegarLoop]: Abstraction has 213 states and 324 transitions. [2024-10-24 09:10:32,621 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 6 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 09:10:32,621 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 324 transitions. [2024-10-24 09:10:32,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 09:10:32,624 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:10:32,624 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:10:32,624 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 09:10:32,625 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:10:32,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:10:32,625 INFO L85 PathProgramCache]: Analyzing trace with hash -36741663, now seen corresponding path program 1 times [2024-10-24 09:10:32,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 09:10:32,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1743323637] [2024-10-24 09:10:32,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:10:32,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 09:10:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-24 09:10:32,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1699046204] [2024-10-24 09:10:32,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:10:32,802 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 09:10:32,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:10:32,805 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-24 09:10:32,807 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-24 09:10:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:10:33,253 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-24 09:10:33,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-24 09:10:33,443 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-24 09:10:33,443 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-24 09:10:33,445 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-24 09:10:33,466 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 09:10:33,647 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-24 09:10:33,652 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1] [2024-10-24 09:10:33,784 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-24 09:10:33,788 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 24.10 09:10:33 BoogieIcfgContainer [2024-10-24 09:10:33,788 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-24 09:10:33,789 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-24 09:10:33,789 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-24 09:10:33,789 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-24 09:10:33,790 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:10:28" (3/4) ... [2024-10-24 09:10:33,792 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-24 09:10:33,793 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-24 09:10:33,793 INFO L158 Benchmark]: Toolchain (without parser) took 6264.22ms. Allocated memory was 167.8MB in the beginning and 220.2MB in the end (delta: 52.4MB). Free memory was 97.9MB in the beginning and 132.3MB in the end (delta: -34.4MB). Peak memory consumption was 21.0MB. Max. memory is 16.1GB. [2024-10-24 09:10:33,794 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 113.2MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:10:33,794 INFO L158 Benchmark]: CACSL2BoogieTranslator took 456.66ms. Allocated memory is still 167.8MB. Free memory was 97.9MB in the beginning and 134.3MB in the end (delta: -36.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-10-24 09:10:33,794 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.62ms. Allocated memory is still 167.8MB. Free memory was 134.3MB in the beginning and 128.7MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-24 09:10:33,794 INFO L158 Benchmark]: Boogie Preprocessor took 95.52ms. Allocated memory is still 167.8MB. Free memory was 128.7MB in the beginning and 117.4MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-24 09:10:33,795 INFO L158 Benchmark]: RCFGBuilder took 667.39ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 83.2MB in the end (delta: 34.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. [2024-10-24 09:10:33,795 INFO L158 Benchmark]: TraceAbstraction took 4970.93ms. Allocated memory was 167.8MB in the beginning and 220.2MB in the end (delta: 52.4MB). Free memory was 82.5MB in the beginning and 132.3MB in the end (delta: -49.8MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. [2024-10-24 09:10:33,795 INFO L158 Benchmark]: Witness Printer took 4.16ms. Allocated memory is still 220.2MB. Free memory is still 132.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-24 09:10:33,797 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.18ms. Allocated memory is still 113.2MB. Free memory is still 78.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 456.66ms. Allocated memory is still 167.8MB. Free memory was 97.9MB in the beginning and 134.3MB in the end (delta: -36.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.62ms. Allocated memory is still 167.8MB. Free memory was 134.3MB in the beginning and 128.7MB in the end (delta: 5.7MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 95.52ms. Allocated memory is still 167.8MB. Free memory was 128.7MB in the beginning and 117.4MB in the end (delta: 11.2MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * RCFGBuilder took 667.39ms. Allocated memory is still 167.8MB. Free memory was 117.4MB in the beginning and 83.2MB in the end (delta: 34.3MB). Peak memory consumption was 35.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4970.93ms. Allocated memory was 167.8MB in the beginning and 220.2MB in the end (delta: 52.4MB). Free memory was 82.5MB in the beginning and 132.3MB in the end (delta: -49.8MB). Peak memory consumption was 4.9MB. Max. memory is 16.1GB. * Witness Printer took 4.16ms. Allocated memory is still 220.2MB. Free memory is still 132.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 183, overapproximation of someBinaryArithmeticDOUBLEoperation at line 127, overapproximation of someBinaryDOUBLEComparisonOperation at line 183, overapproximation of someBinaryArithmeticFLOAToperation at line 86. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 99999999999.75; [L23] float var_1_4 = 31.25; [L24] float var_1_5 = 0.0; [L25] float var_1_6 = 99.5; [L26] float var_1_7 = 500.5; [L27] double var_1_8 = 199.96; [L28] double var_1_9 = 256.95; [L29] signed long int var_1_11 = 1523382513; [L30] double var_1_14 = 32.6; [L31] double var_1_15 = 0.875; [L32] unsigned short int var_1_16 = 1; [L33] unsigned char var_1_17 = 1; [L34] float var_1_18 = 0.3; [L35] signed short int var_1_19 = 4; [L36] unsigned char var_1_20 = 0; [L37] unsigned char var_1_24 = 0; [L38] unsigned char var_1_25 = 16; [L39] unsigned char var_1_26 = 5; [L40] signed short int var_1_27 = 64; [L41] unsigned char var_1_28 = 1; [L42] float var_1_29 = 64.5; [L43] float var_1_30 = 0.0; [L44] unsigned long int var_1_31 = 2; [L45] unsigned long int var_1_32 = 1140371764; [L46] unsigned long int var_1_33 = 3119542188; [L47] double var_1_34 = 10.5; [L48] unsigned short int last_1_var_1_16 = 1; [L49] signed short int last_1_var_1_19 = 4; [L50] signed short int last_1_var_1_27 = 64; [L51] float last_1_var_1_29 = 64.5; [L52] unsigned long int last_1_var_1_31 = 2; [L187] isInitial = 1 [L188] FCALL initially() [L189] int k_loop; [L190] k_loop = 0 VAL [isInitial=1, k_loop=0, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_4=125/4, var_1_5=0, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L190] COND TRUE k_loop < 1 [L191] CALL updateLastVariables() [L176] last_1_var_1_16 = var_1_16 [L177] last_1_var_1_19 = var_1_19 [L178] last_1_var_1_27 = var_1_27 [L179] last_1_var_1_29 = var_1_29 [L180] last_1_var_1_31 = var_1_31 [L191] RET updateLastVariables() [L192] CALL updateVariables() [L136] var_1_4 = __VERIFIER_nondet_float() [L137] CALL assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_5=0, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_5=0, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L137] RET assume_abort_if_not((var_1_4 >= 0.0F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854765600e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_5=0, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L138] var_1_5 = __VERIFIER_nondet_float() [L139] CALL assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L139] RET assume_abort_if_not((var_1_5 >= 4611686.018427382800e+12F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_6=199/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L140] var_1_6 = __VERIFIER_nondet_float() [L141] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L141] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_7=1001/2, var_1_8=4999/25, var_1_9=5139/20] [L142] var_1_7 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L143] RET assume_abort_if_not((var_1_7 >= 0.0F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1523382513, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L144] var_1_11 = __VERIFIER_nondet_long() [L145] CALL assume_abort_if_not(var_1_11 >= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L145] RET assume_abort_if_not(var_1_11 >= 1073741823) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L146] CALL assume_abort_if_not(var_1_11 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L146] RET assume_abort_if_not(var_1_11 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_14=163/5, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L147] var_1_14 = __VERIFIER_nondet_double() [L148] CALL assume_abort_if_not((var_1_14 >= -230584.3009213691390e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L148] RET assume_abort_if_not((var_1_14 >= -230584.3009213691390e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 2305843.009213691390e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_15=7/8, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L149] var_1_15 = __VERIFIER_nondet_double() [L150] CALL assume_abort_if_not((var_1_15 >= -230584.3009213691390e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L150] RET assume_abort_if_not((var_1_15 >= -230584.3009213691390e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 2305843.009213691390e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L151] var_1_17 = __VERIFIER_nondet_uchar() [L152] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L152] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L153] CALL assume_abort_if_not(var_1_17 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L153] RET assume_abort_if_not(var_1_17 <= 1) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=0, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L154] var_1_20 = __VERIFIER_nondet_uchar() [L155] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L155] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L156] CALL assume_abort_if_not(var_1_20 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L156] RET assume_abort_if_not(var_1_20 <= 1) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=16, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L157] var_1_25 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L158] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L159] CALL assume_abort_if_not(var_1_25 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L159] RET assume_abort_if_not(var_1_25 <= 64) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=5, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L160] var_1_26 = __VERIFIER_nondet_uchar() [L161] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L161] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L162] CALL assume_abort_if_not(var_1_26 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L162] RET assume_abort_if_not(var_1_26 <= 127) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L163] var_1_28 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L164] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L165] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L165] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_30=0, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L166] var_1_30 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_30 >= 2305843.009213691390e+12F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L167] RET assume_abort_if_not((var_1_30 >= 2305843.009213691390e+12F && var_1_30 <= -1.0e-20F) || (var_1_30 <= 4611686.018427382800e+12F && var_1_30 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=1140371764, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L168] var_1_32 = __VERIFIER_nondet_ulong() [L169] CALL assume_abort_if_not(var_1_32 >= 1073741824) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-3221225472, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-3221225472, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L169] RET assume_abort_if_not(var_1_32 >= 1073741824) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-3221225472, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L170] CALL assume_abort_if_not(var_1_32 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-3221225472, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-3221225472, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L170] RET assume_abort_if_not(var_1_32 <= 2147483647) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-3221225472, var_1_33=3119542188, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L171] var_1_33 = __VERIFIER_nondet_ulong() [L172] CALL assume_abort_if_not(var_1_33 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-3221225472, var_1_33=4294967231, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-3221225472, var_1_33=4294967231, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L172] RET assume_abort_if_not(var_1_33 >= 2147483647) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-3221225472, var_1_33=4294967231, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L173] CALL assume_abort_if_not(var_1_33 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-3221225472, var_1_33=4294967231, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-3221225472, var_1_33=4294967231, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L173] RET assume_abort_if_not(var_1_33 <= 4294967294) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-3221225472, var_1_33=4294967231, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L192] RET updateVariables() [L193] CALL step() [L56] unsigned long int stepLocal_1 = last_1_var_1_31; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-3221225472, var_1_33=4294967231, var_1_34=21/2, var_1_8=4999/25, var_1_9=5139/20] [L57] COND FALSE !(var_1_4 < (last_1_var_1_29 + ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))) [L64] var_1_8 = var_1_7 VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-3221225472, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L66] COND FALSE !(! var_1_20) [L73] var_1_24 = var_1_26 VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-3221225472, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L75] signed long int stepLocal_6 = (((var_1_24) < (var_1_24)) ? (var_1_24) : (var_1_24)); [L76] unsigned char stepLocal_5 = var_1_28; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_5=1, stepLocal_6=0, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-3221225472, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L77] COND FALSE !(stepLocal_6 < var_1_25) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_5=1, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-3221225472, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L82] signed long int stepLocal_0 = ~ var_1_24; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_0=-1, stepLocal_1=2, stepLocal_5=1, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_1=399999999999/4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-3221225472, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L83] COND TRUE stepLocal_0 <= var_1_24 [L84] var_1_1 = (var_1_4 - (var_1_5 - ((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))))) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_5=1, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_29=129/2, var_1_31=2, var_1_32=-3221225472, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L86] var_1_29 = (var_1_6 + ((var_1_30 - 7.6f) - var_1_7)) [L87] var_1_31 = ((((((var_1_11 + var_1_32)) > (var_1_33)) ? ((var_1_11 + var_1_32)) : (var_1_33))) - var_1_26) [L88] unsigned char stepLocal_3 = var_1_24; [L89] unsigned long int stepLocal_2 = var_1_31; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=4294967231, stepLocal_3=0, stepLocal_5=1, var_1_11=1073741823, var_1_16=1, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_31=4294967231, var_1_32=-3221225472, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L90] COND FALSE !(\read(var_1_17)) [L97] var_1_16 = var_1_27 VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=4294967231, stepLocal_3=0, stepLocal_5=1, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_31=4294967231, var_1_32=-3221225472, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L99] signed long int stepLocal_8 = ~ var_1_16; [L100] signed long int stepLocal_7 = var_1_24 / var_1_11; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=4294967231, stepLocal_3=0, stepLocal_5=1, stepLocal_7=0, stepLocal_8=-65, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_31=4294967231, var_1_32=-3221225472, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L101] COND FALSE !(stepLocal_8 > var_1_31) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=4294967231, stepLocal_3=0, stepLocal_5=1, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_31=4294967231, var_1_32=-3221225472, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L108] unsigned char stepLocal_4 = var_1_17; VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=4294967231, stepLocal_3=0, stepLocal_4=0, stepLocal_5=1, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_31=4294967231, var_1_32=-3221225472, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L109] COND FALSE !(stepLocal_4 && var_1_20) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=4294967231, stepLocal_3=0, stepLocal_5=1, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=4, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_31=4294967231, var_1_32=-3221225472, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L116] COND FALSE !((var_1_1 * (- var_1_5)) < (var_1_6 - var_1_7)) [L123] var_1_19 = ((var_1_16 + var_1_24) + 16) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=4294967231, stepLocal_3=0, stepLocal_5=1, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=80, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_31=4294967231, var_1_32=-3221225472, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2, var_1_9=5139/20] [L126] COND TRUE (var_1_19 - var_1_16) < ((var_1_11 - var_1_24) - var_1_24) [L127] var_1_9 = (var_1_7 + ((((var_1_6) > ((var_1_14 + var_1_15))) ? (var_1_6) : ((var_1_14 + var_1_15))))) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=4294967231, stepLocal_3=0, stepLocal_5=1, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=80, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_31=4294967231, var_1_32=-3221225472, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2] [L131] COND FALSE !(var_1_19 <= var_1_16) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, stepLocal_1=2, stepLocal_2=4294967231, stepLocal_3=0, stepLocal_5=1, stepLocal_7=0, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=80, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_31=4294967231, var_1_32=-3221225472, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2] [L193] RET step() [L194] CALL, EXPR property() [L183-L184] return ((((((((((((~ var_1_24) <= var_1_24) ? (var_1_1 == ((float) (var_1_4 - (var_1_5 - ((((var_1_6) < (var_1_7)) ? (var_1_6) : (var_1_7))))))) : 1) && ((var_1_4 < (last_1_var_1_29 + ((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))))) ? ((last_1_var_1_19 < last_1_var_1_31) ? (var_1_8 == ((double) (((((var_1_6) < 0 ) ? -(var_1_6) : (var_1_6))) + var_1_7))) : (var_1_8 == ((double) var_1_4))) : (var_1_8 == ((double) var_1_7)))) && (((var_1_19 - var_1_16) < ((var_1_11 - var_1_24) - var_1_24)) ? (var_1_9 == ((double) (var_1_7 + ((((var_1_6) > ((var_1_14 + var_1_15))) ? (var_1_6) : ((var_1_14 + var_1_15))))))) : (var_1_9 == ((double) (var_1_7 - var_1_5))))) && (var_1_17 ? ((var_1_11 <= var_1_24) ? ((var_1_24 <= var_1_31) ? (var_1_16 == ((unsigned short int) var_1_27)) : 1) : 1) : (var_1_16 == ((unsigned short int) var_1_27)))) && ((var_1_19 <= var_1_16) ? (var_1_18 == ((float) (var_1_15 + 64.4f))) : 1)) && ((var_1_17 && var_1_20) ? (var_1_17 ? (var_1_19 == ((signed short int) ((var_1_16 - var_1_24) + 50))) : (var_1_19 == ((signed short int) ((((var_1_24) > (var_1_16)) ? (var_1_24) : (var_1_16)))))) : (((var_1_1 * (- var_1_5)) < (var_1_6 - var_1_7)) ? ((var_1_14 == var_1_8) ? (var_1_19 == ((signed short int) var_1_16)) : (var_1_19 == ((signed short int) (var_1_16 + var_1_24)))) : (var_1_19 == ((signed short int) ((var_1_16 + var_1_24) + 16)))))) && ((! var_1_20) ? ((last_1_var_1_16 <= last_1_var_1_16) ? (var_1_24 == ((unsigned char) ((var_1_25 + 1) + var_1_26))) : (var_1_24 == ((unsigned char) var_1_26))) : (var_1_24 == ((unsigned char) var_1_26)))) && ((((((var_1_24) < (var_1_24)) ? (var_1_24) : (var_1_24))) < var_1_25) ? (((var_1_20 || var_1_17) && var_1_28) ? (var_1_27 == ((signed short int) (((((((((var_1_24) > (var_1_24)) ? (var_1_24) : (var_1_24))) + last_1_var_1_27)) < (((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26))))) ? ((((((var_1_24) > (var_1_24)) ? (var_1_24) : (var_1_24))) + last_1_var_1_27)) : (((((var_1_25) > (var_1_26)) ? (var_1_25) : (var_1_26)))))))) : 1) : 1)) && (var_1_29 == ((float) (var_1_6 + ((var_1_30 - 7.6f) - var_1_7))))) && (var_1_31 == ((unsigned long int) ((((((var_1_11 + var_1_32)) > (var_1_33)) ? ((var_1_11 + var_1_32)) : (var_1_33))) - var_1_26)))) && (((~ var_1_16) > var_1_31) ? (((var_1_24 / var_1_11) >= var_1_26) ? (var_1_34 == ((double) ((((((-5.2001036938992108E18) < 0 ) ? -(-5.2001036938992108E18) : (-5.2001036938992108E18))) - 50.25) - var_1_4))) : (var_1_34 == ((double) var_1_7))) : 1) ; [L194] RET, EXPR property() [L194] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=80, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_31=4294967231, var_1_32=-3221225472, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=1, last_1_var_1_19=4, last_1_var_1_27=64, last_1_var_1_29=129/2, last_1_var_1_31=2, var_1_11=1073741823, var_1_16=64, var_1_17=0, var_1_18=3/10, var_1_19=80, var_1_20=1, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=64, var_1_28=1, var_1_31=4294967231, var_1_32=-3221225472, var_1_33=4294967231, var_1_34=21/2, var_1_7=2, var_1_8=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 74 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.8s, OverallIterations: 6, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 347 SdHoareTripleChecker+Valid, 0.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 347 mSDsluCounter, 1353 SdHoareTripleChecker+Invalid, 0.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 710 mSDsCounter, 166 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 231 IncrementalHoareTripleChecker+Invalid, 397 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 166 mSolverCounterUnsat, 643 mSDtfsCounter, 231 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 268 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=213occurred in iteration=5, InterpolantAutomatonStates: 17, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 5 MinimizatonAttempts, 162 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 1.9s InterpolantComputationTime, 1050 NumberOfCodeBlocks, 1050 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 745 ConstructedInterpolants, 0 QuantifiedInterpolants, 1069 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 5 InterpolantComputations, 5 PerfectInterpolantSequences, 5060/5060 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-24 09:10:33,836 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_loopvsstraightlinecode_100-1loop_file-84.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 046e4169d322167d7576c9c2b9007e1beb6aeeec9394209bc254f3d13fdc20dd --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 09:10:36,138 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 09:10:36,237 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-24 09:10:36,245 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 09:10:36,246 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 09:10:36,277 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 09:10:36,278 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 09:10:36,278 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 09:10:36,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 09:10:36,280 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 09:10:36,280 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 09:10:36,280 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 09:10:36,281 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 09:10:36,285 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 09:10:36,285 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 09:10:36,286 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 09:10:36,286 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-24 09:10:36,286 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-24 09:10:36,286 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-24 09:10:36,287 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 09:10:36,287 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-24 09:10:36,288 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 09:10:36,288 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-24 09:10:36,290 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 09:10:36,290 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-24 09:10:36,291 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 09:10:36,291 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-24 09:10:36,291 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-24 09:10:36,291 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-24 09:10:36,292 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 09:10:36,292 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 09:10:36,292 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 09:10:36,292 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 09:10:36,292 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 09:10:36,293 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:10:36,293 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 09:10:36,293 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 09:10:36,293 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-24 09:10:36,294 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-24 09:10:36,295 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-24 09:10:36,295 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 09:10:36,295 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 09:10:36,295 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 09:10:36,296 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 09:10:36,296 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-24 09:10:36,296 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 -> 046e4169d322167d7576c9c2b9007e1beb6aeeec9394209bc254f3d13fdc20dd [2024-10-24 09:10:36,624 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 09:10:36,649 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 09:10:36,654 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 09:10:36,655 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 09:10:36,656 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 09:10:36,657 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-84.i [2024-10-24 09:10:38,292 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 09:10:38,561 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 09:10:38,562 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-1loop_file-84.i [2024-10-24 09:10:38,578 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f323ae8a/6cf8c77494a646cd9548abcc7fb53abe/FLAG52e38956e [2024-10-24 09:10:38,887 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f323ae8a/6cf8c77494a646cd9548abcc7fb53abe [2024-10-24 09:10:38,890 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 09:10:38,892 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 09:10:38,894 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 09:10:38,895 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 09:10:38,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 09:10:38,900 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:10:38" (1/1) ... [2024-10-24 09:10:38,901 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@58888b50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:38, skipping insertion in model container [2024-10-24 09:10:38,903 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 09:10:38" (1/1) ... [2024-10-24 09:10:38,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 09:10:39,130 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_loopvsstraightlinecode_100-1loop_file-84.i[916,929] [2024-10-24 09:10:39,209 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:10:39,224 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 09:10:39,236 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_loopvsstraightlinecode_100-1loop_file-84.i[916,929] [2024-10-24 09:10:39,278 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 09:10:39,298 INFO L204 MainTranslator]: Completed translation [2024-10-24 09:10:39,299 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:39 WrapperNode [2024-10-24 09:10:39,299 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 09:10:39,300 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 09:10:39,300 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 09:10:39,301 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 09:10:39,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:39" (1/1) ... [2024-10-24 09:10:39,328 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:39" (1/1) ... [2024-10-24 09:10:39,371 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 192 [2024-10-24 09:10:39,375 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 09:10:39,376 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 09:10:39,377 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 09:10:39,377 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 09:10:39,391 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:39" (1/1) ... [2024-10-24 09:10:39,393 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:39" (1/1) ... [2024-10-24 09:10:39,400 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:39" (1/1) ... [2024-10-24 09:10:39,438 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-24 09:10:39,439 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:39" (1/1) ... [2024-10-24 09:10:39,439 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:39" (1/1) ... [2024-10-24 09:10:39,461 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:39" (1/1) ... [2024-10-24 09:10:39,469 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:39" (1/1) ... [2024-10-24 09:10:39,476 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:39" (1/1) ... [2024-10-24 09:10:39,478 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:39" (1/1) ... [2024-10-24 09:10:39,483 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 09:10:39,484 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 09:10:39,484 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 09:10:39,484 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 09:10:39,485 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:39" (1/1) ... [2024-10-24 09:10:39,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 09:10:39,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 09:10:39,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 09:10:39,529 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 09:10:39,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-24 09:10:39,580 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-24 09:10:39,580 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-24 09:10:39,581 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-24 09:10:39,581 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 09:10:39,581 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 09:10:39,677 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 09:10:39,679 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 09:10:49,564 INFO L? ?]: Removed 27 outVars from TransFormulas that were not future-live. [2024-10-24 09:10:49,565 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 09:10:49,634 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 09:10:49,634 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-24 09:10:49,635 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:10:49 BoogieIcfgContainer [2024-10-24 09:10:49,635 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 09:10:49,638 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 09:10:49,639 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 09:10:49,642 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 09:10:49,643 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 09:10:38" (1/3) ... [2024-10-24 09:10:49,644 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@468315a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:10:49, skipping insertion in model container [2024-10-24 09:10:49,644 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 09:10:39" (2/3) ... [2024-10-24 09:10:49,645 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@468315a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 09:10:49, skipping insertion in model container [2024-10-24 09:10:49,645 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 09:10:49" (3/3) ... [2024-10-24 09:10:49,647 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-1loop_file-84.i [2024-10-24 09:10:49,663 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 09:10:49,663 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-24 09:10:49,717 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 09:10:49,724 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;@314e7ef9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 09:10:49,724 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-24 09:10:49,728 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 09:10:49,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 09:10:49,745 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:10:49,746 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:10:49,746 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:10:49,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:10:49,754 INFO L85 PathProgramCache]: Analyzing trace with hash -738045709, now seen corresponding path program 1 times [2024-10-24 09:10:49,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:10:49,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1026824738] [2024-10-24 09:10:49,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:10:49,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:10:49,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:10:49,775 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:10:49,777 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-24 09:10:50,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:50,701 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-24 09:10:50,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:10:50,757 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 464 proven. 0 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2024-10-24 09:10:50,757 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:10:50,758 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:10:50,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1026824738] [2024-10-24 09:10:50,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1026824738] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:10:50,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:10:50,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 09:10:50,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746051080] [2024-10-24 09:10:50,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:10:50,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-24 09:10:50,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:10:50,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-24 09:10:50,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:10:50,796 INFO L87 Difference]: Start difference. First operand has 74 states, 48 states have (on average 1.4791666666666667) internal successors, (71), 49 states have internal predecessors, (71), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 09:10:55,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.26s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:10:55,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:10:55,248 INFO L93 Difference]: Finished difference Result 147 states and 256 transitions. [2024-10-24 09:10:55,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-24 09:10:55,251 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2024-10-24 09:10:55,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:10:55,258 INFO L225 Difference]: With dead ends: 147 [2024-10-24 09:10:55,258 INFO L226 Difference]: Without dead ends: 72 [2024-10-24 09:10:55,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-24 09:10:55,264 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2024-10-24 09:10:55,264 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 108 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2024-10-24 09:10:55,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-24 09:10:55,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-24 09:10:55,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 47 states have internal predecessors, (65), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 09:10:55,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 111 transitions. [2024-10-24 09:10:55,310 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 111 transitions. Word has length 150 [2024-10-24 09:10:55,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:10:55,310 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 111 transitions. [2024-10-24 09:10:55,311 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2024-10-24 09:10:55,311 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 111 transitions. [2024-10-24 09:10:55,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 09:10:55,314 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:10:55,315 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:10:55,342 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-24 09:10:55,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:10:55,516 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:10:55,516 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:10:55,517 INFO L85 PathProgramCache]: Analyzing trace with hash 408231469, now seen corresponding path program 1 times [2024-10-24 09:10:55,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:10:55,518 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2134264443] [2024-10-24 09:10:55,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:10:55,518 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:10:55,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:10:55,519 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:10:55,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-24 09:10:56,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:10:56,247 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-10-24 09:10:56,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:10:56,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 09:10:56,379 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 09:10:56,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:10:56,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2134264443] [2024-10-24 09:10:56,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2134264443] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 09:10:56,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 09:10:56,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 09:10:56,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917246637] [2024-10-24 09:10:56,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:10:56,383 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 09:10:56,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:10:56,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 09:10:56,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:10:56,384 INFO L87 Difference]: Start difference. First operand 72 states and 111 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 09:11:00,775 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.97s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:11:05,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.23s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:11:09,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:11:09,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:11:09,364 INFO L93 Difference]: Finished difference Result 143 states and 221 transitions. [2024-10-24 09:11:09,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 09:11:09,365 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 150 [2024-10-24 09:11:09,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:11:09,367 INFO L225 Difference]: With dead ends: 143 [2024-10-24 09:11:09,367 INFO L226 Difference]: Without dead ends: 72 [2024-10-24 09:11:09,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 09:11:09,373 INFO L432 NwaCegarLoop]: 105 mSDtfsCounter, 0 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 194 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.0s IncrementalHoareTripleChecker+Time [2024-10-24 09:11:09,374 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 194 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 2 Unknown, 0 Unchecked, 13.0s Time] [2024-10-24 09:11:09,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-24 09:11:09,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-24 09:11:09,390 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 47 states have (on average 1.3617021276595744) internal successors, (64), 47 states have internal predecessors, (64), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2024-10-24 09:11:09,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 110 transitions. [2024-10-24 09:11:09,392 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 110 transitions. Word has length 150 [2024-10-24 09:11:09,397 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:11:09,397 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 110 transitions. [2024-10-24 09:11:09,397 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 09:11:09,397 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 110 transitions. [2024-10-24 09:11:09,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 09:11:09,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:11:09,402 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:11:09,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-24 09:11:09,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:11:09,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:11:09,604 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:11:09,604 INFO L85 PathProgramCache]: Analyzing trace with hash 995037483, now seen corresponding path program 1 times [2024-10-24 09:11:09,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:11:09,605 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [620783687] [2024-10-24 09:11:09,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:11:09,605 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:11:09,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:11:09,607 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:11:09,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-24 09:11:10,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:11:10,339 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-24 09:11:10,344 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:11:13,020 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 508 proven. 39 refuted. 0 times theorem prover too weak. 465 trivial. 0 not checked. [2024-10-24 09:11:13,024 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:11:14,181 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2024-10-24 09:11:14,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:11:14,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [620783687] [2024-10-24 09:11:14,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [620783687] provided 1 perfect and 1 imperfect interpolant sequences [2024-10-24 09:11:14,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 09:11:14,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7] total 7 [2024-10-24 09:11:14,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725355339] [2024-10-24 09:11:14,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 09:11:14,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 09:11:14,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:11:14,186 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 09:11:14,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-10-24 09:11:14,187 INFO L87 Difference]: Start difference. First operand 72 states and 110 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 09:11:18,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.22s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:11:22,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:11:26,856 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:11:30,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:11:34,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-24 09:11:35,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 09:11:35,043 INFO L93 Difference]: Finished difference Result 177 states and 267 transitions. [2024-10-24 09:11:35,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 09:11:35,045 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 150 [2024-10-24 09:11:35,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 09:11:35,047 INFO L225 Difference]: With dead ends: 177 [2024-10-24 09:11:35,047 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 09:11:35,048 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 299 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-24 09:11:35,049 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 44 mSDsluCounter, 224 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 1 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.7s IncrementalHoareTripleChecker+Time [2024-10-24 09:11:35,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 354 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 26 Invalid, 5 Unknown, 0 Unchecked, 20.7s Time] [2024-10-24 09:11:35,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 09:11:35,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 103. [2024-10-24 09:11:35,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 69 states have (on average 1.3478260869565217) internal successors, (93), 70 states have internal predecessors, (93), 31 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 30 states have call predecessors, (31), 31 states have call successors, (31) [2024-10-24 09:11:35,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 155 transitions. [2024-10-24 09:11:35,065 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 155 transitions. Word has length 150 [2024-10-24 09:11:35,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 09:11:35,066 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 155 transitions. [2024-10-24 09:11:35,066 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2024-10-24 09:11:35,066 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 155 transitions. [2024-10-24 09:11:35,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-24 09:11:35,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 09:11:35,068 INFO L215 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 09:11:35,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-10-24 09:11:35,269 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:11:35,270 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-24 09:11:35,270 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 09:11:35,270 INFO L85 PathProgramCache]: Analyzing trace with hash -36801245, now seen corresponding path program 1 times [2024-10-24 09:11:35,271 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-24 09:11:35,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1251155369] [2024-10-24 09:11:35,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:11:35,271 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-24 09:11:35,271 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-24 09:11:35,274 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-24 09:11:35,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-24 09:11:36,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:11:36,082 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-10-24 09:11:36,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:11:42,113 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-10-24 09:11:42,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:11:44,078 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-24 09:11:44,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1251155369] [2024-10-24 09:11:44,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1251155369] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:11:44,079 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1893783429] [2024-10-24 09:11:44,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 09:11:44,079 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-10-24 09:11:44,079 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-10-24 09:11:44,083 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-10-24 09:11:44,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-10-24 09:11:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 09:11:46,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-24 09:11:46,628 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 09:11:51,244 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 472 proven. 21 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2024-10-24 09:11:51,245 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 09:11:52,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1893783429] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 09:11:52,365 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 09:11:52,365 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 8 [2024-10-24 09:11:52,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342112925] [2024-10-24 09:11:52,366 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 09:11:52,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 09:11:52,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-24 09:11:52,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 09:11:52,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-10-24 09:11:52,368 INFO L87 Difference]: Start difference. First operand 103 states and 155 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 2 states have call successors, (23), 2 states have call predecessors, (23), 3 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23)