./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_fillercode_fillercodesize_normal_file-15.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-15.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 2ea716fb2630a1d9252b5a1d3d2ae2b44ef6930d24c092b11ab3338ed01d5184 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:20:57,854 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:20:57,928 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-13 00:20:57,937 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:20:57,939 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:20:57,977 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:20:57,978 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:20:57,979 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:20:57,980 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:20:57,981 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:20:57,981 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:20:57,981 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:20:57,982 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:20:57,984 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:20:57,985 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:20:57,985 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:20:57,986 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:20:57,986 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:20:57,986 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 00:20:57,986 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:20:57,987 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:20:57,991 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:20:57,991 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:20:57,991 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:20:57,992 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:20:57,992 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:20:57,992 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:20:57,993 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:20:57,993 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:20:57,993 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:20:57,993 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:20:57,994 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:20:57,994 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:20:57,995 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:20:57,996 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:20:58,007 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:20:58,007 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 00:20:58,007 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 00:20:58,007 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:20:58,007 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:20:58,007 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:20:58,010 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:20:58,010 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 -> 2ea716fb2630a1d9252b5a1d3d2ae2b44ef6930d24c092b11ab3338ed01d5184 [2024-10-13 00:20:58,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:20:58,303 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:20:58,306 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:20:58,307 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:20:58,308 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:20:58,309 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-15.i [2024-10-13 00:20:59,952 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:21:00,186 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:21:00,187 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-15.i [2024-10-13 00:21:00,199 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9339560ce/24cec2bf3e0b4511bb3cfc13ca26c807/FLAGbbd9f49a9 [2024-10-13 00:21:00,213 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9339560ce/24cec2bf3e0b4511bb3cfc13ca26c807 [2024-10-13 00:21:00,215 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:21:00,217 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:21:00,218 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:21:00,218 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:21:00,224 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:21:00,225 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:21:00" (1/1) ... [2024-10-13 00:21:00,226 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a2b719e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:00, skipping insertion in model container [2024-10-13 00:21:00,226 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:21:00" (1/1) ... [2024-10-13 00:21:00,268 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:21:00,454 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_fillercode_fillercodesize_normal_file-15.i[913,926] [2024-10-13 00:21:00,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:21:00,564 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:21:00,583 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_fillercode_fillercodesize_normal_file-15.i[913,926] [2024-10-13 00:21:00,624 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:21:00,649 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:21:00,649 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:00 WrapperNode [2024-10-13 00:21:00,650 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:21:00,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:21:00,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:21:00,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:21:00,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:00" (1/1) ... [2024-10-13 00:21:00,674 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:00" (1/1) ... [2024-10-13 00:21:00,715 INFO L138 Inliner]: procedures = 26, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 154 [2024-10-13 00:21:00,715 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:21:00,716 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:21:00,716 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:21:00,716 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:21:00,729 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:00" (1/1) ... [2024-10-13 00:21:00,730 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:00" (1/1) ... [2024-10-13 00:21:00,733 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:00" (1/1) ... [2024-10-13 00:21:00,751 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 00:21:00,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:00" (1/1) ... [2024-10-13 00:21:00,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:00" (1/1) ... [2024-10-13 00:21:00,758 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:00" (1/1) ... [2024-10-13 00:21:00,766 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:00" (1/1) ... [2024-10-13 00:21:00,768 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:00" (1/1) ... [2024-10-13 00:21:00,772 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:00" (1/1) ... [2024-10-13 00:21:00,775 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:21:00,776 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:21:00,776 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:21:00,776 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:21:00,777 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:00" (1/1) ... [2024-10-13 00:21:00,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:21:00,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:21:00,817 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:21:00,821 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-13 00:21:00,868 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:21:00,869 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:21:00,869 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:21:00,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-13 00:21:00,870 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:21:00,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:21:00,950 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:21:00,954 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:21:01,296 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 00:21:01,296 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:21:01,337 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:21:01,337 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:21:01,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:21:01 BoogieIcfgContainer [2024-10-13 00:21:01,338 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:21:01,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:21:01,341 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:21:01,345 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:21:01,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:21:00" (1/3) ... [2024-10-13 00:21:01,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e0b5994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:21:01, skipping insertion in model container [2024-10-13 00:21:01,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:00" (2/3) ... [2024-10-13 00:21:01,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5e0b5994 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:21:01, skipping insertion in model container [2024-10-13 00:21:01,347 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:21:01" (3/3) ... [2024-10-13 00:21:01,349 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-15.i [2024-10-13 00:21:01,368 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:21:01,369 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:21:01,451 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:21:01,459 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;@64f220bb, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:21:01,460 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:21:01,464 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 00:21:01,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 00:21:01,475 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:21:01,476 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:21:01,477 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:21:01,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:21:01,483 INFO L85 PathProgramCache]: Analyzing trace with hash 396515768, now seen corresponding path program 1 times [2024-10-13 00:21:01,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:21:01,493 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093703793] [2024-10-13 00:21:01,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:21:01,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:21:01,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:01,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:21:01,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:01,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 00:21:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:01,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 00:21:01,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:01,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 00:21:01,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:01,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 00:21:01,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:01,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 00:21:01,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:01,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 00:21:01,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:01,913 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 00:21:01,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:01,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 00:21:01,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:01,932 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 00:21:01,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:01,939 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 00:21:01,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:01,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 00:21:01,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:01,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 00:21:01,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:01,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 00:21:01,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:01,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 00:21:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:01,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 00:21:01,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:02,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 00:21:02,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:02,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 00:21:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:02,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 00:21:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:02,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 00:21:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:02,082 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 00:21:02,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:21:02,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093703793] [2024-10-13 00:21:02,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093703793] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:21:02,084 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:21:02,084 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:21:02,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1947046360] [2024-10-13 00:21:02,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:21:02,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:21:02,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:21:02,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:21:02,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:21:02,153 INFO L87 Difference]: Start difference. First operand has 61 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 00:21:02,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:21:02,209 INFO L93 Difference]: Finished difference Result 119 states and 206 transitions. [2024-10-13 00:21:02,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:21:02,213 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) Word has length 128 [2024-10-13 00:21:02,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:21:02,223 INFO L225 Difference]: With dead ends: 119 [2024-10-13 00:21:02,225 INFO L226 Difference]: Without dead ends: 59 [2024-10-13 00:21:02,230 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:21:02,236 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:21:02,238 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 00:21:02,256 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-13 00:21:02,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-13 00:21:02,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 00:21:02,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2024-10-13 00:21:02,292 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 128 [2024-10-13 00:21:02,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:21:02,293 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2024-10-13 00:21:02,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 15.5) internal successors, (31), 2 states have internal predecessors, (31), 2 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 00:21:02,294 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2024-10-13 00:21:02,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 00:21:02,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:21:02,298 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:21:02,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 00:21:02,298 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:21:02,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:21:02,299 INFO L85 PathProgramCache]: Analyzing trace with hash -10624788, now seen corresponding path program 1 times [2024-10-13 00:21:02,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:21:02,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035882809] [2024-10-13 00:21:02,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:21:02,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:21:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:02,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:21:02,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:02,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 00:21:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:02,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 00:21:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:02,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 00:21:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:02,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 00:21:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:02,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 00:21:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:02,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 00:21:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:02,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 00:21:02,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:02,741 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 00:21:02,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:02,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 00:21:02,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:02,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 00:21:02,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:02,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 00:21:02,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:02,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 00:21:02,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:02,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 00:21:02,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:02,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 00:21:02,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:02,808 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 00:21:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:02,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 00:21:02,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:02,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 00:21:02,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:02,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 00:21:02,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:02,843 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 00:21:02,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:02,850 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 00:21:02,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:21:02,851 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035882809] [2024-10-13 00:21:02,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035882809] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:21:02,851 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:21:02,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 00:21:02,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [900320667] [2024-10-13 00:21:02,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:21:02,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 00:21:02,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:21:02,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 00:21:02,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:21:02,856 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:21:03,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:21:03,068 INFO L93 Difference]: Finished difference Result 177 states and 267 transitions. [2024-10-13 00:21:03,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 00:21:03,070 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 128 [2024-10-13 00:21:03,070 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:21:03,072 INFO L225 Difference]: With dead ends: 177 [2024-10-13 00:21:03,074 INFO L226 Difference]: Without dead ends: 119 [2024-10-13 00:21:03,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:21:03,077 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 56 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:21:03,077 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 243 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 00:21:03,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-13 00:21:03,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 98. [2024-10-13 00:21:03,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 00:21:03,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 147 transitions. [2024-10-13 00:21:03,121 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 147 transitions. Word has length 128 [2024-10-13 00:21:03,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:21:03,122 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 147 transitions. [2024-10-13 00:21:03,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:21:03,123 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 147 transitions. [2024-10-13 00:21:03,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 00:21:03,127 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:21:03,128 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:21:03,128 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 00:21:03,128 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:21:03,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:21:03,129 INFO L85 PathProgramCache]: Analyzing trace with hash -695664293, now seen corresponding path program 1 times [2024-10-13 00:21:03,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:21:03,129 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844407440] [2024-10-13 00:21:03,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:21:03,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:21:03,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:03,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-13 00:21:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:03,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-13 00:21:03,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:03,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2024-10-13 00:21:03,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:03,602 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2024-10-13 00:21:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:03,605 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-10-13 00:21:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:03,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 30 [2024-10-13 00:21:03,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:03,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-13 00:21:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:03,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-10-13 00:21:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:03,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-10-13 00:21:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:03,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2024-10-13 00:21:03,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:03,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-10-13 00:21:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:03,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-10-13 00:21:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:03,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-10-13 00:21:03,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:03,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-10-13 00:21:03,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:03,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-10-13 00:21:03,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:03,657 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-10-13 00:21:03,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:03,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-10-13 00:21:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:03,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-10-13 00:21:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:03,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-10-13 00:21:03,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:03,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-10-13 00:21:03,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:03,685 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 00:21:03,685 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 00:21:03,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844407440] [2024-10-13 00:21:03,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844407440] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:21:03,688 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:21:03,689 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 00:21:03,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [984625084] [2024-10-13 00:21:03,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:21:03,690 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 00:21:03,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 00:21:03,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 00:21:03,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:21:03,691 INFO L87 Difference]: Start difference. First operand 98 states and 147 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:21:03,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:21:03,884 INFO L93 Difference]: Finished difference Result 247 states and 364 transitions. [2024-10-13 00:21:03,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 00:21:03,885 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2024-10-13 00:21:03,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:21:03,888 INFO L225 Difference]: With dead ends: 247 [2024-10-13 00:21:03,888 INFO L226 Difference]: Without dead ends: 189 [2024-10-13 00:21:03,889 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:21:03,890 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 119 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 00:21:03,890 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 217 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 00:21:03,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-10-13 00:21:03,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 152. [2024-10-13 00:21:03,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 93 states have (on average 1.2473118279569892) internal successors, (116), 94 states have internal predecessors, (116), 54 states have call successors, (54), 4 states have call predecessors, (54), 4 states have return successors, (54), 53 states have call predecessors, (54), 54 states have call successors, (54) [2024-10-13 00:21:03,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 224 transitions. [2024-10-13 00:21:03,921 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 224 transitions. Word has length 129 [2024-10-13 00:21:03,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:21:03,921 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 224 transitions. [2024-10-13 00:21:03,922 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 4 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:21:03,922 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 224 transitions. [2024-10-13 00:21:03,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 00:21:03,924 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:21:03,924 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:21:03,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 00:21:03,925 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:21:03,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:21:03,925 INFO L85 PathProgramCache]: Analyzing trace with hash -1505010919, now seen corresponding path program 1 times [2024-10-13 00:21:03,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 00:21:03,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2137723519] [2024-10-13 00:21:03,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:21:03,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 00:21:04,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:21:04,004 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-13 00:21:04,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-13 00:21:04,148 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-13 00:21:04,148 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-13 00:21:04,150 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-13 00:21:04,152 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 00:21:04,156 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-10-13 00:21:04,284 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-13 00:21:04,289 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.10 12:21:04 BoogieIcfgContainer [2024-10-13 00:21:04,291 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-13 00:21:04,291 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-13 00:21:04,291 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-13 00:21:04,292 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-13 00:21:04,292 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:21:01" (3/4) ... [2024-10-13 00:21:04,294 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-13 00:21:04,296 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-13 00:21:04,299 INFO L158 Benchmark]: Toolchain (without parser) took 4079.42ms. Allocated memory was 178.3MB in the beginning and 257.9MB in the end (delta: 79.7MB). Free memory was 121.2MB in the beginning and 142.0MB in the end (delta: -20.8MB). Peak memory consumption was 57.2MB. Max. memory is 16.1GB. [2024-10-13 00:21:04,299 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 178.3MB. Free memory is still 143.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:21:04,299 INFO L158 Benchmark]: CACSL2BoogieTranslator took 431.66ms. Allocated memory is still 178.3MB. Free memory was 120.8MB in the beginning and 105.9MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-13 00:21:04,299 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.71ms. Allocated memory is still 178.3MB. Free memory was 105.9MB in the beginning and 103.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 00:21:04,300 INFO L158 Benchmark]: Boogie Preprocessor took 58.82ms. Allocated memory is still 178.3MB. Free memory was 103.5MB in the beginning and 100.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-13 00:21:04,304 INFO L158 Benchmark]: RCFGBuilder took 562.34ms. Allocated memory is still 178.3MB. Free memory was 100.6MB in the beginning and 78.8MB in the end (delta: 21.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2024-10-13 00:21:04,304 INFO L158 Benchmark]: TraceAbstraction took 2950.22ms. Allocated memory was 178.3MB in the beginning and 257.9MB in the end (delta: 79.7MB). Free memory was 78.4MB in the beginning and 142.0MB in the end (delta: -63.6MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. [2024-10-13 00:21:04,305 INFO L158 Benchmark]: Witness Printer took 4.31ms. Allocated memory is still 257.9MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-13 00:21:04,306 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 178.3MB. Free memory is still 143.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 431.66ms. Allocated memory is still 178.3MB. Free memory was 120.8MB in the beginning and 105.9MB in the end (delta: 14.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.71ms. Allocated memory is still 178.3MB. Free memory was 105.9MB in the beginning and 103.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.82ms. Allocated memory is still 178.3MB. Free memory was 103.5MB in the beginning and 100.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 562.34ms. Allocated memory is still 178.3MB. Free memory was 100.6MB in the beginning and 78.8MB in the end (delta: 21.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * TraceAbstraction took 2950.22ms. Allocated memory was 178.3MB in the beginning and 257.9MB in the end (delta: 79.7MB). Free memory was 78.4MB in the beginning and 142.0MB in the end (delta: -63.6MB). Peak memory consumption was 15.3MB. Max. memory is 16.1GB. * Witness Printer took 4.31ms. Allocated memory is still 257.9MB. Free memory is still 142.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 137, overapproximation of someBinaryArithmeticDOUBLEoperation at line 55, overapproximation of someUnaryDOUBLEoperation at line 55, overapproximation of someBinaryDOUBLEComparisonOperation at line 137. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = -10; [L23] float var_1_3 = 32.4; [L24] float var_1_4 = 49.2; [L25] signed short int var_1_7 = 10; [L26] signed short int var_1_8 = 64; [L27] signed short int var_1_9 = 256; [L28] signed char var_1_10 = -5; [L29] signed char var_1_11 = 5; [L30] double var_1_12 = 256.4; [L31] float var_1_13 = 2.6; [L32] float var_1_14 = 128.125; [L33] double var_1_15 = 32.5; [L34] double var_1_16 = 10000000000.25; [L35] signed char var_1_17 = -5; [L36] unsigned char var_1_19 = 0; [L37] unsigned char var_1_20 = 0; [L38] signed long int var_1_21 = 1; [L39] signed short int var_1_22 = 17178; [L40] signed short int var_1_23 = 5; [L41] signed long int var_1_25 = -4; [L42] signed char last_1_var_1_10 = -5; [L43] signed long int last_1_var_1_21 = 1; [L44] signed long int last_1_var_1_25 = -4; [L141] isInitial = 1 [L142] FCALL initially() [L143] COND TRUE 1 [L144] CALL updateLastVariables() [L132] last_1_var_1_10 = var_1_10 [L133] last_1_var_1_21 = var_1_21 [L134] last_1_var_1_25 = var_1_25 [L144] RET updateLastVariables() [L145] CALL updateVariables() [L97] var_1_3 = __VERIFIER_nondet_float() [L98] CALL assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L98] RET assume_abort_if_not((var_1_3 >= -922337.2036854776000e+13F && var_1_3 <= -1.0e-20F) || (var_1_3 <= 9223372.036854776000e+12F && var_1_3 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_4=246/5, var_1_7=10, var_1_8=64, var_1_9=256] [L99] var_1_4 = __VERIFIER_nondet_float() [L100] CALL assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=10, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=10, var_1_8=64, var_1_9=256] [L100] RET assume_abort_if_not((var_1_4 >= -922337.2036854776000e+13F && var_1_4 <= -1.0e-20F) || (var_1_4 <= 9223372.036854776000e+12F && var_1_4 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=10, var_1_8=64, var_1_9=256] [L101] var_1_7 = __VERIFIER_nondet_short() [L102] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=64, var_1_9=256] [L102] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=64, var_1_9=256] [L103] CALL assume_abort_if_not(var_1_7 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=64, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=64, var_1_9=256] [L103] RET assume_abort_if_not(var_1_7 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=64, var_1_9=256] [L104] var_1_8 = __VERIFIER_nondet_short() [L105] CALL assume_abort_if_not(var_1_8 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=256] [L105] RET assume_abort_if_not(var_1_8 >= -1) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=256] [L106] CALL assume_abort_if_not(var_1_8 <= 32766) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=256] [L106] RET assume_abort_if_not(var_1_8 <= 32766) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=256] [L107] var_1_9 = __VERIFIER_nondet_short() [L108] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L108] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L109] CALL assume_abort_if_not(var_1_9 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L109] RET assume_abort_if_not(var_1_9 <= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=5, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L110] var_1_11 = __VERIFIER_nondet_char() [L111] CALL assume_abort_if_not(var_1_11 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L111] RET assume_abort_if_not(var_1_11 >= -127) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L112] CALL assume_abort_if_not(var_1_11 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L112] RET assume_abort_if_not(var_1_11 <= 126) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_13=13/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L113] var_1_13 = __VERIFIER_nondet_float() [L114] CALL assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L114] RET assume_abort_if_not((var_1_13 >= -922337.2036854776000e+13F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854776000e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_14=1025/8, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L115] var_1_14 = __VERIFIER_nondet_float() [L116] CALL assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L116] RET assume_abort_if_not((var_1_14 >= -922337.2036854776000e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854776000e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_15=65/2, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L117] var_1_15 = __VERIFIER_nondet_double() [L118] CALL assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L118] RET assume_abort_if_not((var_1_15 >= 0.0F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_16=40000000001/4, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L119] var_1_16 = __VERIFIER_nondet_double() [L120] CALL assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L120] RET assume_abort_if_not((var_1_16 >= 0.0F && var_1_16 <= -1.0e-20F) || (var_1_16 <= 9223372.036854765600e+12F && var_1_16 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L121] var_1_20 = __VERIFIER_nondet_uchar() [L122] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L122] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L123] CALL assume_abort_if_not(var_1_20 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L123] RET assume_abort_if_not(var_1_20 <= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=17178, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L124] var_1_22 = __VERIFIER_nondet_short() [L125] CALL assume_abort_if_not(var_1_22 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L125] RET assume_abort_if_not(var_1_22 >= 16383) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L126] CALL assume_abort_if_not(var_1_22 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L126] RET assume_abort_if_not(var_1_22 <= 32767) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=5, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L127] var_1_23 = __VERIFIER_nondet_short() [L128] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=4, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=4, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L128] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=4, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L129] CALL assume_abort_if_not(var_1_23 <= 16384) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=4, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=4, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L129] RET assume_abort_if_not(var_1_23 <= 16384) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=4, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L145] RET updateVariables() [L146] CALL step() [L48] COND TRUE last_1_var_1_10 < last_1_var_1_25 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=4, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L49] COND TRUE var_1_11 <= last_1_var_1_25 [L50] var_1_19 = var_1_20 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-5, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=4, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L53] var_1_10 = var_1_11 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=1282/5, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=4, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L54] COND TRUE var_1_4 >= (var_1_3 * (var_1_13 + var_1_14)) [L55] var_1_12 = (((((var_1_15 - var_1_16)) < (-0.85)) ? ((var_1_15 - var_1_16)) : (-0.85))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=4, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L59] unsigned char stepLocal_1 = var_1_19; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=4, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L60] COND FALSE !(var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=4, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L67] COND FALSE !(\read(var_1_19)) [L70] var_1_25 = var_1_10 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=4, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L72] unsigned char stepLocal_0 = var_1_12 > var_1_12; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_0=1, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=4, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L73] COND TRUE var_1_19 || stepLocal_0 [L74] var_1_1 = (var_1_17 + var_1_17) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=4, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L78] signed long int stepLocal_3 = var_1_22 + var_1_11; [L79] signed long int stepLocal_2 = (var_1_22 - var_1_23) - var_1_9; VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-4, stepLocal_3=16379, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=1, var_1_22=16383, var_1_23=4, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L80] COND FALSE !(\read(var_1_20)) [L93] var_1_21 = var_1_9 VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, stepLocal_1=0, stepLocal_2=-4, stepLocal_3=16379, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=16383, var_1_23=4, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L146] RET step() [L147] CALL, EXPR property() [L137-L138] return (((((((var_1_19 || (var_1_12 > var_1_12)) ? (var_1_1 == ((signed short int) (var_1_17 + var_1_17))) : (var_1_1 == ((signed short int) ((((((var_1_7 + 1)) < (var_1_8)) ? ((var_1_7 + 1)) : (var_1_8))) - (24762 - var_1_9))))) && (var_1_10 == ((signed char) var_1_11))) && ((var_1_4 >= (var_1_3 * (var_1_13 + var_1_14))) ? (var_1_12 == ((double) (((((var_1_15 - var_1_16)) < (-0.85)) ? ((var_1_15 - var_1_16)) : (-0.85))))) : (var_1_12 == ((double) var_1_16)))) && ((var_1_12 <= ((((var_1_12) < (var_1_12)) ? (var_1_12) : (var_1_12)))) ? ((var_1_19 || var_1_19) ? (var_1_17 == ((signed char) var_1_11)) : (var_1_17 == ((signed char) var_1_11))) : 1)) && ((last_1_var_1_10 < last_1_var_1_25) ? ((var_1_11 <= last_1_var_1_25) ? (var_1_19 == ((unsigned char) var_1_20)) : 1) : 1)) && (var_1_20 ? ((var_1_10 < ((var_1_22 - var_1_23) - var_1_9)) ? (var_1_19 ? ((last_1_var_1_21 == (var_1_22 + var_1_11)) ? (var_1_21 == ((signed long int) var_1_1)) : 1) : (var_1_21 == ((signed long int) var_1_10))) : (var_1_21 == ((signed long int) var_1_11))) : (var_1_21 == ((signed long int) var_1_9)))) && (var_1_19 ? (var_1_25 == ((signed long int) (var_1_17 + ((((var_1_17) < (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))) ? (var_1_17) : (((((var_1_8) < (var_1_17)) ? (var_1_8) : (var_1_17))))))))) : (var_1_25 == ((signed long int) var_1_10))) ; [L147] RET, EXPR property() [L147] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=16383, var_1_23=4, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] [L19] reach_error() VAL [isInitial=1, last_1_var_1_10=-5, last_1_var_1_21=1, last_1_var_1_25=-4, var_1_10=-4, var_1_11=-4, var_1_12=10000000005, var_1_17=-5, var_1_19=0, var_1_1=-10, var_1_20=0, var_1_21=16383, var_1_22=16383, var_1_23=4, var_1_25=-4, var_1_7=16383, var_1_8=8383, var_1_9=16383] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 61 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.7s, OverallIterations: 4, TraceHistogramMax: 20, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 175 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 175 mSDsluCounter, 546 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 257 mSDsCounter, 70 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 91 IncrementalHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 70 mSolverCounterUnsat, 289 mSDtfsCounter, 91 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 153 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=152occurred in iteration=3, InterpolantAutomatonStates: 10, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 58 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 514 NumberOfCodeBlocks, 514 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 382 ConstructedInterpolants, 0 QuantifiedInterpolants, 662 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 2280/2280 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-13 00:21:04,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-15.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 2ea716fb2630a1d9252b5a1d3d2ae2b44ef6930d24c092b11ab3338ed01d5184 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 00:21:06,870 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 00:21:06,970 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-13 00:21:06,985 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 00:21:06,985 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 00:21:07,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 00:21:07,023 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 00:21:07,023 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 00:21:07,024 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 00:21:07,024 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 00:21:07,025 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 00:21:07,025 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 00:21:07,026 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 00:21:07,027 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 00:21:07,030 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 00:21:07,031 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 00:21:07,032 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-13 00:21:07,032 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 00:21:07,032 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 00:21:07,032 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 00:21:07,033 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-13 00:21:07,033 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 00:21:07,035 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-13 00:21:07,035 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 00:21:07,036 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-13 00:21:07,036 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 00:21:07,036 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-13 00:21:07,037 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 00:21:07,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-13 00:21:07,037 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 00:21:07,038 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 00:21:07,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 00:21:07,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 00:21:07,039 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 00:21:07,039 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:21:07,039 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 00:21:07,039 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 00:21:07,040 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-13 00:21:07,040 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-13 00:21:07,040 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-10-13 00:21:07,040 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 00:21:07,042 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 00:21:07,042 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 00:21:07,042 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 00:21:07,043 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-13 00:21:07,043 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 -> 2ea716fb2630a1d9252b5a1d3d2ae2b44ef6930d24c092b11ab3338ed01d5184 [2024-10-13 00:21:07,447 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 00:21:07,481 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 00:21:07,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 00:21:07,486 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 00:21:07,487 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 00:21:07,489 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-15.i [2024-10-13 00:21:09,226 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 00:21:09,504 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 00:21:09,505 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_normal_file-15.i [2024-10-13 00:21:09,527 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac3dc071/63f51c3cc6e342789f878c6490e4d48d/FLAG06c0d297d [2024-10-13 00:21:09,547 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9ac3dc071/63f51c3cc6e342789f878c6490e4d48d [2024-10-13 00:21:09,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 00:21:09,552 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 00:21:09,556 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 00:21:09,557 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 00:21:09,563 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 00:21:09,564 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:21:09" (1/1) ... [2024-10-13 00:21:09,565 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@497b7dfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:09, skipping insertion in model container [2024-10-13 00:21:09,565 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 12:21:09" (1/1) ... [2024-10-13 00:21:09,598 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 00:21:09,798 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_fillercode_fillercodesize_normal_file-15.i[913,926] [2024-10-13 00:21:09,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:21:09,912 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 00:21:09,928 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_fillercode_fillercodesize_normal_file-15.i[913,926] [2024-10-13 00:21:09,971 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 00:21:09,996 INFO L204 MainTranslator]: Completed translation [2024-10-13 00:21:09,997 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:09 WrapperNode [2024-10-13 00:21:09,998 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 00:21:09,999 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 00:21:09,999 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 00:21:09,999 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 00:21:10,006 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:09" (1/1) ... [2024-10-13 00:21:10,026 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:09" (1/1) ... [2024-10-13 00:21:10,059 INFO L138 Inliner]: procedures = 27, calls = 33, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 148 [2024-10-13 00:21:10,060 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 00:21:10,061 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 00:21:10,061 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 00:21:10,061 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 00:21:10,073 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:09" (1/1) ... [2024-10-13 00:21:10,074 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:09" (1/1) ... [2024-10-13 00:21:10,078 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:09" (1/1) ... [2024-10-13 00:21:10,097 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-13 00:21:10,097 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:09" (1/1) ... [2024-10-13 00:21:10,098 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:09" (1/1) ... [2024-10-13 00:21:10,114 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:09" (1/1) ... [2024-10-13 00:21:10,120 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:09" (1/1) ... [2024-10-13 00:21:10,126 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:09" (1/1) ... [2024-10-13 00:21:10,128 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:09" (1/1) ... [2024-10-13 00:21:10,138 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 00:21:10,140 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 00:21:10,143 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 00:21:10,143 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 00:21:10,144 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:09" (1/1) ... [2024-10-13 00:21:10,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 00:21:10,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 00:21:10,179 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-13 00:21:10,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-13 00:21:10,252 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-13 00:21:10,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-13 00:21:10,253 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-13 00:21:10,253 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-13 00:21:10,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 00:21:10,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 00:21:10,336 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 00:21:10,338 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 00:21:14,336 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-10-13 00:21:14,336 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 00:21:14,392 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 00:21:14,393 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 00:21:14,393 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:21:14 BoogieIcfgContainer [2024-10-13 00:21:14,393 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 00:21:14,396 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 00:21:14,397 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 00:21:14,401 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 00:21:14,401 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 12:21:09" (1/3) ... [2024-10-13 00:21:14,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d0bbfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:21:14, skipping insertion in model container [2024-10-13 00:21:14,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 12:21:09" (2/3) ... [2024-10-13 00:21:14,402 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30d0bbfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 12:21:14, skipping insertion in model container [2024-10-13 00:21:14,402 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 12:21:14" (3/3) ... [2024-10-13 00:21:14,403 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_normal_file-15.i [2024-10-13 00:21:14,423 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 00:21:14,424 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-13 00:21:14,491 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 00:21:14,501 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;@5bed54e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 00:21:14,503 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-13 00:21:14,511 INFO L276 IsEmpty]: Start isEmpty. Operand has 61 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 00:21:14,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 00:21:14,535 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:21:14,537 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:21:14,537 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:21:14,544 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:21:14,545 INFO L85 PathProgramCache]: Analyzing trace with hash 396515768, now seen corresponding path program 1 times [2024-10-13 00:21:14,563 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:21:14,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46419752] [2024-10-13 00:21:14,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:21:14,565 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:21:14,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:21:14,569 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:21:14,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-13 00:21:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:15,015 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-13 00:21:15,026 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:21:15,073 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 318 proven. 0 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2024-10-13 00:21:15,073 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:21:15,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:21:15,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46419752] [2024-10-13 00:21:15,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46419752] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:21:15,075 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:21:15,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 00:21:15,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [406660704] [2024-10-13 00:21:15,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:21:15,082 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-13 00:21:15,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:21:15,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-13 00:21:15,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:21:15,111 INFO L87 Difference]: Start difference. First operand has 61 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 39 states have internal predecessors, (54), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 00:21:17,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:21:17,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:21:17,496 INFO L93 Difference]: Finished difference Result 119 states and 206 transitions. [2024-10-13 00:21:17,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-13 00:21:17,522 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 128 [2024-10-13 00:21:17,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:21:17,529 INFO L225 Difference]: With dead ends: 119 [2024-10-13 00:21:17,529 INFO L226 Difference]: Without dead ends: 59 [2024-10-13 00:21:17,532 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-13 00:21:17,535 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2024-10-13 00:21:17,537 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 86 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2024-10-13 00:21:17,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-10-13 00:21:17,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2024-10-13 00:21:17,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 37 states have (on average 1.3243243243243243) internal successors, (49), 37 states have internal predecessors, (49), 20 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2024-10-13 00:21:17,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 89 transitions. [2024-10-13 00:21:17,583 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 89 transitions. Word has length 128 [2024-10-13 00:21:17,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:21:17,584 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 89 transitions. [2024-10-13 00:21:17,585 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 17.5) internal successors, (35), 2 states have internal predecessors, (35), 2 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2024-10-13 00:21:17,585 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 89 transitions. [2024-10-13 00:21:17,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2024-10-13 00:21:17,588 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:21:17,588 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:21:17,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-10-13 00:21:17,789 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:21:17,790 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:21:17,790 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:21:17,790 INFO L85 PathProgramCache]: Analyzing trace with hash -10624788, now seen corresponding path program 1 times [2024-10-13 00:21:17,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:21:17,791 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2039401417] [2024-10-13 00:21:17,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:21:17,792 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:21:17,792 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:21:17,795 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:21:17,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-13 00:21:18,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:18,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-10-13 00:21:18,177 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:21:19,768 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 00:21:19,769 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:21:19,769 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:21:19,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2039401417] [2024-10-13 00:21:19,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2039401417] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:21:19,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:21:19,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 00:21:19,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566349633] [2024-10-13 00:21:19,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:21:19,772 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 00:21:19,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:21:19,773 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 00:21:19,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:21:19,774 INFO L87 Difference]: Start difference. First operand 59 states and 89 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:21:22,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:21:25,329 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.88s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:21:25,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:21:25,331 INFO L93 Difference]: Finished difference Result 176 states and 266 transitions. [2024-10-13 00:21:25,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 00:21:25,355 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 128 [2024-10-13 00:21:25,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:21:25,358 INFO L225 Difference]: With dead ends: 176 [2024-10-13 00:21:25,358 INFO L226 Difference]: Without dead ends: 118 [2024-10-13 00:21:25,359 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:21:25,360 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 50 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2024-10-13 00:21:25,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 245 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2024-10-13 00:21:25,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2024-10-13 00:21:25,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 98. [2024-10-13 00:21:25,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 55 states have (on average 1.2181818181818183) internal successors, (67), 55 states have internal predecessors, (67), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 00:21:25,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 147 transitions. [2024-10-13 00:21:25,396 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 147 transitions. Word has length 128 [2024-10-13 00:21:25,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:21:25,399 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 147 transitions. [2024-10-13 00:21:25,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 3 states have internal predecessors, (31), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:21:25,399 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 147 transitions. [2024-10-13 00:21:25,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 00:21:25,401 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:21:25,402 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:21:25,420 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 (3)] Forceful destruction successful, exit code 0 [2024-10-13 00:21:25,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-13 00:21:25,603 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:21:25,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:21:25,607 INFO L85 PathProgramCache]: Analyzing trace with hash -695664293, now seen corresponding path program 1 times [2024-10-13 00:21:25,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:21:25,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [810200218] [2024-10-13 00:21:25,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:21:25,608 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:21:25,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:21:25,612 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-13 00:21:25,614 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-13 00:21:25,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:25,999 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 00:21:26,004 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:21:28,758 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 760 trivial. 0 not checked. [2024-10-13 00:21:28,759 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-13 00:21:28,759 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:21:28,759 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [810200218] [2024-10-13 00:21:28,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [810200218] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 00:21:28,760 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 00:21:28,760 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 00:21:28,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1785478357] [2024-10-13 00:21:28,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 00:21:28,761 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 00:21:28,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:21:28,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 00:21:28,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-13 00:21:28,762 INFO L87 Difference]: Start difference. First operand 98 states and 147 transitions. Second operand has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:21:30,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:21:33,097 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:21:36,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.55s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 00:21:38,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 00:21:39,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, RoundingMode, FloatingPoint, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 00:21:45,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 00:21:47,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.79s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-10-13 00:21:47,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:21:47,379 INFO L93 Difference]: Finished difference Result 214 states and 323 transitions. [2024-10-13 00:21:47,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 00:21:47,396 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) Word has length 129 [2024-10-13 00:21:47,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:21:47,399 INFO L225 Difference]: With dead ends: 214 [2024-10-13 00:21:47,399 INFO L226 Difference]: Without dead ends: 156 [2024-10-13 00:21:47,400 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 126 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-13 00:21:47,401 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 76 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2024-10-13 00:21:47,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 218 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 18.0s Time] [2024-10-13 00:21:47,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-10-13 00:21:47,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 100. [2024-10-13 00:21:47,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 57 states have (on average 1.2105263157894737) internal successors, (69), 57 states have internal predecessors, (69), 40 states have call successors, (40), 2 states have call predecessors, (40), 2 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 00:21:47,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 149 transitions. [2024-10-13 00:21:47,429 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 149 transitions. Word has length 129 [2024-10-13 00:21:47,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:21:47,432 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 149 transitions. [2024-10-13 00:21:47,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.0) internal successors, (32), 3 states have internal predecessors, (32), 1 states have call successors, (20), 1 states have call predecessors, (20), 1 states have return successors, (20), 1 states have call predecessors, (20), 1 states have call successors, (20) [2024-10-13 00:21:47,432 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 149 transitions. [2024-10-13 00:21:47,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-10-13 00:21:47,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:21:47,434 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:21:47,456 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-13 00:21:47,635 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-13 00:21:47,636 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:21:47,637 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:21:47,637 INFO L85 PathProgramCache]: Analyzing trace with hash 5400285, now seen corresponding path program 1 times [2024-10-13 00:21:47,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:21:47,638 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1033420556] [2024-10-13 00:21:47,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:21:47,638 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:21:47,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:21:47,641 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-13 00:21:47,643 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-13 00:21:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:47,989 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 00:21:47,994 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:21:49,264 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 39 proven. 336 refuted. 0 times theorem prover too weak. 385 trivial. 0 not checked. [2024-10-13 00:21:49,264 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:21:50,073 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 39 proven. 18 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-13 00:21:50,074 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:21:50,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1033420556] [2024-10-13 00:21:50,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1033420556] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 00:21:50,074 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 00:21:50,074 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2024-10-13 00:21:50,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857019866] [2024-10-13 00:21:50,075 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 00:21:50,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-13 00:21:50,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:21:50,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-13 00:21:50,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2024-10-13 00:21:50,080 INFO L87 Difference]: Start difference. First operand 100 states and 149 transitions. Second operand has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2024-10-13 00:21:54,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.67s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:21:58,121 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.68s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:21:59,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:21:59,376 INFO L93 Difference]: Finished difference Result 234 states and 339 transitions. [2024-10-13 00:21:59,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 00:21:59,392 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) Word has length 129 [2024-10-13 00:21:59,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:21:59,394 INFO L225 Difference]: With dead ends: 234 [2024-10-13 00:21:59,395 INFO L226 Difference]: Without dead ends: 174 [2024-10-13 00:21:59,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 272 GetRequests, 249 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=196, Invalid=404, Unknown=0, NotChecked=0, Total=600 [2024-10-13 00:21:59,396 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 236 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 406 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 219 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2024-10-13 00:21:59,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [236 Valid, 240 Invalid, 406 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [219 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2024-10-13 00:21:59,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-10-13 00:21:59,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 106. [2024-10-13 00:21:59,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 61 states have (on average 1.180327868852459) internal successors, (72), 61 states have internal predecessors, (72), 40 states have call successors, (40), 4 states have call predecessors, (40), 4 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 00:21:59,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 152 transitions. [2024-10-13 00:21:59,431 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 152 transitions. Word has length 129 [2024-10-13 00:21:59,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:21:59,432 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 152 transitions. [2024-10-13 00:21:59,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.909090909090909) internal successors, (65), 11 states have internal predecessors, (65), 4 states have call successors, (40), 3 states have call predecessors, (40), 5 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2024-10-13 00:21:59,433 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 152 transitions. [2024-10-13 00:21:59,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 00:21:59,434 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:21:59,435 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:21:59,454 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 (5)] Ended with exit code 0 [2024-10-13 00:21:59,635 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:21:59,636 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:21:59,638 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:21:59,638 INFO L85 PathProgramCache]: Analyzing trace with hash -613200700, now seen corresponding path program 1 times [2024-10-13 00:21:59,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:21:59,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2035282064] [2024-10-13 00:21:59,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:21:59,639 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:21:59,639 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:21:59,643 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:21:59,644 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 (6)] Waiting until timeout for monitored process [2024-10-13 00:21:59,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:21:59,945 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 00:21:59,949 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:22:00,164 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 289 proven. 12 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2024-10-13 00:22:00,165 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:22:00,910 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-13 00:22:00,911 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:22:00,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2035282064] [2024-10-13 00:22:00,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2035282064] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 00:22:00,911 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 00:22:00,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2024-10-13 00:22:00,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1293866470] [2024-10-13 00:22:00,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 00:22:00,912 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 00:22:00,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:22:00,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 00:22:00,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 00:22:00,914 INFO L87 Difference]: Start difference. First operand 106 states and 152 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-13 00:22:03,880 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:22:04,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:22:04,010 INFO L93 Difference]: Finished difference Result 181 states and 250 transitions. [2024-10-13 00:22:04,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 00:22:04,042 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 130 [2024-10-13 00:22:04,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:22:04,044 INFO L225 Difference]: With dead ends: 181 [2024-10-13 00:22:04,044 INFO L226 Difference]: Without dead ends: 119 [2024-10-13 00:22:04,045 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-13 00:22:04,046 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 102 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 100 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 100 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 00:22:04,046 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 126 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [100 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 00:22:04,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-13 00:22:04,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2024-10-13 00:22:04,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 64 states have (on average 1.078125) internal successors, (69), 64 states have internal predecessors, (69), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 00:22:04,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 149 transitions. [2024-10-13 00:22:04,071 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 149 transitions. Word has length 130 [2024-10-13 00:22:04,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:22:04,072 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 149 transitions. [2024-10-13 00:22:04,072 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-13 00:22:04,072 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 149 transitions. [2024-10-13 00:22:04,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 00:22:04,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:22:04,074 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:22:04,091 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 (6)] Forceful destruction successful, exit code 0 [2024-10-13 00:22:04,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:22:04,275 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:22:04,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:22:04,276 INFO L85 PathProgramCache]: Analyzing trace with hash -742488956, now seen corresponding path program 1 times [2024-10-13 00:22:04,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:22:04,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1819411775] [2024-10-13 00:22:04,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:22:04,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:22:04,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:22:04,280 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:22:04,283 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 (7)] Waiting until timeout for monitored process [2024-10-13 00:22:04,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:04,646 INFO L255 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-13 00:22:04,648 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 00:22:05,162 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 289 proven. 12 refuted. 0 times theorem prover too weak. 459 trivial. 0 not checked. [2024-10-13 00:22:05,163 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 00:22:05,692 INFO L134 CoverageAnalysis]: Checked inductivity of 760 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-10-13 00:22:05,693 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-13 00:22:05,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1819411775] [2024-10-13 00:22:05,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1819411775] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 00:22:05,693 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-13 00:22:05,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2024-10-13 00:22:05,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955333694] [2024-10-13 00:22:05,693 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-13 00:22:05,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 00:22:05,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-13 00:22:05,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 00:22:05,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 00:22:05,695 INFO L87 Difference]: Start difference. First operand 111 states and 149 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-13 00:22:08,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.94s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-13 00:22:08,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 00:22:08,696 INFO L93 Difference]: Finished difference Result 182 states and 241 transitions. [2024-10-13 00:22:08,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 00:22:08,720 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 130 [2024-10-13 00:22:08,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 00:22:08,722 INFO L225 Difference]: With dead ends: 182 [2024-10-13 00:22:08,722 INFO L226 Difference]: Without dead ends: 119 [2024-10-13 00:22:08,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 267 GetRequests, 251 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-10-13 00:22:08,723 INFO L432 NwaCegarLoop]: 48 mSDtfsCounter, 95 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 98 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 98 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-10-13 00:22:08,723 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 126 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [98 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-10-13 00:22:08,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-13 00:22:08,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 111. [2024-10-13 00:22:08,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 64 states have (on average 1.0625) internal successors, (68), 64 states have internal predecessors, (68), 40 states have call successors, (40), 6 states have call predecessors, (40), 6 states have return successors, (40), 40 states have call predecessors, (40), 40 states have call successors, (40) [2024-10-13 00:22:08,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 148 transitions. [2024-10-13 00:22:08,750 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 148 transitions. Word has length 130 [2024-10-13 00:22:08,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 00:22:08,750 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 148 transitions. [2024-10-13 00:22:08,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 9 states have internal predecessors, (42), 2 states have call successors, (24), 2 states have call predecessors, (24), 4 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2024-10-13 00:22:08,751 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 148 transitions. [2024-10-13 00:22:08,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2024-10-13 00:22:08,752 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 00:22:08,753 INFO L215 NwaCegarLoop]: trace histogram [20, 20, 20, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 00:22:08,769 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 (7)] Ended with exit code 0 [2024-10-13 00:22:08,953 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:22:08,954 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-13 00:22:08,954 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 00:22:08,954 INFO L85 PathProgramCache]: Analyzing trace with hash -685230654, now seen corresponding path program 1 times [2024-10-13 00:22:08,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-13 00:22:08,955 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [362469630] [2024-10-13 00:22:08,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 00:22:08,955 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-13 00:22:08,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-13 00:22:08,957 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-13 00:22:08,958 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 (8)] Waiting until timeout for monitored process [2024-10-13 00:22:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 00:22:09,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-13 00:22:09,256 INFO L278 TraceCheckSpWp]: Computing forward predicates...