./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_operatoramount_amount50_file-88.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 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_operatoramount_amount50_file-88.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 a455b61fe113f47d14217d396c2a515531f7c318e642948056697e83622a1761 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:08:51,906 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:08:51,988 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 08:08:51,993 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:08:51,994 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:08:52,020 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:08:52,021 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:08:52,021 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:08:52,022 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:08:52,023 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:08:52,024 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:08:52,024 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:08:52,025 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:08:52,025 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:08:52,027 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:08:52,027 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:08:52,028 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:08:52,028 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:08:52,028 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 08:08:52,028 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:08:52,029 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:08:52,032 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:08:52,033 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:08:52,033 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:08:52,033 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:08:52,033 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:08:52,033 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:08:52,033 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:08:52,034 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:08:52,034 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:08:52,034 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:08:52,034 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:08:52,034 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:08:52,035 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:08:52,035 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:08:52,035 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:08:52,035 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 08:08:52,036 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 08:08:52,036 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:08:52,036 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:08:52,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:08:52,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:08:52,038 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 -> a455b61fe113f47d14217d396c2a515531f7c318e642948056697e83622a1761 [2024-11-20 08:08:52,332 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:08:52,360 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:08:52,363 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:08:52,364 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:08:52,365 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:08:52,366 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-88.i [2024-11-20 08:08:53,861 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:08:54,067 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:08:54,071 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-88.i [2024-11-20 08:08:54,082 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bce04d25/2fa04eebdfcc4fcdb5158e0d8d0f8cdf/FLAG94e0e4858 [2024-11-20 08:08:54,095 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1bce04d25/2fa04eebdfcc4fcdb5158e0d8d0f8cdf [2024-11-20 08:08:54,097 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:08:54,098 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:08:54,099 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:08:54,100 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:08:54,105 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:08:54,108 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:08:54" (1/1) ... [2024-11-20 08:08:54,109 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3544ded1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:08:54, skipping insertion in model container [2024-11-20 08:08:54,109 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:08:54" (1/1) ... [2024-11-20 08:08:54,143 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:08:54,310 WARN L250 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_operatoramount_amount50_file-88.i[915,928] [2024-11-20 08:08:54,390 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:08:54,402 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:08:54,416 WARN L250 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_operatoramount_amount50_file-88.i[915,928] [2024-11-20 08:08:54,457 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:08:54,477 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:08:54,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:08:54 WrapperNode [2024-11-20 08:08:54,478 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:08:54,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:08:54,479 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:08:54,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:08:54,487 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:08:54" (1/1) ... [2024-11-20 08:08:54,502 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:08:54" (1/1) ... [2024-11-20 08:08:54,547 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2024-11-20 08:08:54,547 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:08:54,548 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:08:54,548 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:08:54,548 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:08:54,562 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:08:54" (1/1) ... [2024-11-20 08:08:54,563 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:08:54" (1/1) ... [2024-11-20 08:08:54,569 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:08:54" (1/1) ... [2024-11-20 08:08:54,591 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-11-20 08:08:54,592 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:08:54" (1/1) ... [2024-11-20 08:08:54,592 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:08:54" (1/1) ... [2024-11-20 08:08:54,618 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:08:54" (1/1) ... [2024-11-20 08:08:54,622 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:08:54" (1/1) ... [2024-11-20 08:08:54,625 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:08:54" (1/1) ... [2024-11-20 08:08:54,630 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:08:54" (1/1) ... [2024-11-20 08:08:54,645 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:08:54,646 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:08:54,646 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:08:54,647 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:08:54,647 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:08:54" (1/1) ... [2024-11-20 08:08:54,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:08:54,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:08:54,740 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-11-20 08:08:54,745 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-11-20 08:08:54,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:08:54,793 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:08:54,795 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:08:54,795 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 08:08:54,795 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:08:54,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:08:54,892 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:08:54,898 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:08:55,326 INFO L? ?]: Removed 21 outVars from TransFormulas that were not future-live. [2024-11-20 08:08:55,327 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:08:55,342 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:08:55,342 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:08:55,343 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:08:55 BoogieIcfgContainer [2024-11-20 08:08:55,343 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:08:55,345 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:08:55,345 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:08:55,349 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:08:55,349 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:08:54" (1/3) ... [2024-11-20 08:08:55,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3d1ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:08:55, skipping insertion in model container [2024-11-20 08:08:55,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:08:54" (2/3) ... [2024-11-20 08:08:55,350 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b3d1ebb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:08:55, skipping insertion in model container [2024-11-20 08:08:55,350 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:08:55" (3/3) ... [2024-11-20 08:08:55,352 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-88.i [2024-11-20 08:08:55,366 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:08:55,366 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:08:55,422 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:08:55,429 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;@243b0892, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:08:55,429 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:08:55,433 INFO L276 IsEmpty]: Start isEmpty. Operand has 86 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 60 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 08:08:55,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-20 08:08:55,448 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:08:55,449 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 08:08:55,450 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:08:55,455 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:08:55,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1599671645, now seen corresponding path program 1 times [2024-11-20 08:08:55,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:08:55,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624061282] [2024-11-20 08:08:55,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:08:55,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:08:55,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:55,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:08:55,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:55,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:08:55,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:55,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:08:55,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:55,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:08:55,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:55,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:08:55,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:55,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:08:55,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:55,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 08:08:55,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:55,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-20 08:08:55,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:55,860 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 08:08:55,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:55,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 08:08:55,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:55,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 08:08:55,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:55,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:08:55,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:55,891 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 08:08:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:55,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 08:08:55,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:55,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 08:08:55,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:55,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:08:55,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:55,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:08:55,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:55,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 08:08:55,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:55,917 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 08:08:55,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:55,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 08:08:55,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:55,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 08:08:55,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:55,936 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:08:55,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:55,944 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:08:55,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:55,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 08:08:55,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:55,960 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2024-11-20 08:08:55,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:08:55,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624061282] [2024-11-20 08:08:55,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624061282] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:08:55,963 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:08:55,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:08:55,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472870891] [2024-11-20 08:08:55,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:08:55,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:08:55,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:08:56,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:08:56,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:08:56,006 INFO L87 Difference]: Start difference. First operand has 86 states, 59 states have (on average 1.4067796610169492) internal successors, (83), 60 states have internal predecessors, (83), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-20 08:08:56,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:08:56,047 INFO L93 Difference]: Finished difference Result 165 states and 280 transitions. [2024-11-20 08:08:56,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:08:56,051 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 156 [2024-11-20 08:08:56,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:08:56,061 INFO L225 Difference]: With dead ends: 165 [2024-11-20 08:08:56,061 INFO L226 Difference]: Without dead ends: 82 [2024-11-20 08:08:56,064 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 74 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-11-20 08:08:56,068 INFO L432 NwaCegarLoop]: 124 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:08:56,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:08:56,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-20 08:08:56,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-11-20 08:08:56,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 56 states have (on average 1.3571428571428572) internal successors, (76), 56 states have internal predecessors, (76), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 08:08:56,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 124 transitions. [2024-11-20 08:08:56,124 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 124 transitions. Word has length 156 [2024-11-20 08:08:56,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:08:56,124 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 124 transitions. [2024-11-20 08:08:56,125 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-20 08:08:56,125 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 124 transitions. [2024-11-20 08:08:56,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-20 08:08:56,130 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:08:56,130 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 08:08:56,130 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 08:08:56,131 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:08:56,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:08:56,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1941485015, now seen corresponding path program 1 times [2024-11-20 08:08:56,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:08:56,133 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320420669] [2024-11-20 08:08:56,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:08:56,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:08:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:56,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:08:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:57,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:08:57,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:57,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:08:57,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:57,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:08:57,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:57,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:08:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:57,020 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:08:57,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:57,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 08:08:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:57,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-20 08:08:57,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:57,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 08:08:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:57,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 08:08:57,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:57,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 08:08:57,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:57,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:08:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:57,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 08:08:57,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:57,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 08:08:57,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:57,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 08:08:57,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:57,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:08:57,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:57,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:08:57,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:57,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 08:08:57,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:57,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 08:08:57,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:57,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 08:08:57,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:57,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 08:08:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:57,160 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:08:57,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:57,167 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:08:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:57,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 08:08:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:57,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-20 08:08:57,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:08:57,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320420669] [2024-11-20 08:08:57,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320420669] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:08:57,185 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [369354792] [2024-11-20 08:08:57,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:08:57,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:08:57,185 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:08:57,188 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 08:08:57,190 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-20 08:08:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:57,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 08:08:57,348 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:08:57,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 519 proven. 45 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-11-20 08:08:57,647 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:08:57,958 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-20 08:08:57,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [369354792] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 08:08:57,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 08:08:57,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-20 08:08:57,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601847910] [2024-11-20 08:08:57,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 08:08:57,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 08:08:57,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:08:57,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 08:08:57,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-20 08:08:57,965 INFO L87 Difference]: Start difference. First operand 82 states and 124 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-20 08:08:58,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:08:58,240 INFO L93 Difference]: Finished difference Result 169 states and 252 transitions. [2024-11-20 08:08:58,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 08:08:58,246 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 156 [2024-11-20 08:08:58,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:08:58,249 INFO L225 Difference]: With dead ends: 169 [2024-11-20 08:08:58,250 INFO L226 Difference]: Without dead ends: 90 [2024-11-20 08:08:58,250 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 356 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-20 08:08:58,252 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 113 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:08:58,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 325 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 08:08:58,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-20 08:08:58,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 86. [2024-11-20 08:08:58,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 59 states have internal predecessors, (78), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 08:08:58,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 126 transitions. [2024-11-20 08:08:58,270 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 126 transitions. Word has length 156 [2024-11-20 08:08:58,272 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:08:58,273 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 126 transitions. [2024-11-20 08:08:58,274 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-20 08:08:58,274 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 126 transitions. [2024-11-20 08:08:58,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-20 08:08:58,278 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:08:58,278 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 08:08:58,289 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-20 08:08:58,479 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:08:58,479 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:08:58,480 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:08:58,480 INFO L85 PathProgramCache]: Analyzing trace with hash -166477653, now seen corresponding path program 1 times [2024-11-20 08:08:58,480 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:08:58,480 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112515578] [2024-11-20 08:08:58,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:08:58,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:08:58,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:59,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 08:08:59,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:59,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-20 08:08:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:59,288 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-20 08:08:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:59,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-20 08:08:59,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:59,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-20 08:08:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:59,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-20 08:08:59,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:59,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-20 08:08:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:59,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-20 08:08:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:59,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-20 08:08:59,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:59,305 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-20 08:08:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:59,306 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-20 08:08:59,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:59,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-20 08:08:59,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:59,310 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-20 08:08:59,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:59,313 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-20 08:08:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:59,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-20 08:08:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:59,317 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-20 08:08:59,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:59,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-20 08:08:59,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:59,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-20 08:08:59,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:59,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-20 08:08:59,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:59,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-20 08:08:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:59,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-20 08:08:59,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:59,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-20 08:08:59,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:59,384 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-20 08:08:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:59,389 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-20 08:08:59,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:59,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 162 proven. 27 refuted. 0 times theorem prover too weak. 915 trivial. 0 not checked. [2024-11-20 08:08:59,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 08:08:59,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112515578] [2024-11-20 08:08:59,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112515578] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 08:08:59,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [197829615] [2024-11-20 08:08:59,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:08:59,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:08:59,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:08:59,397 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 08:08:59,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-20 08:08:59,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:08:59,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 350 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-20 08:08:59,522 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:09:00,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 516 proven. 66 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2024-11-20 08:09:00,096 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:09:01,295 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 162 proven. 36 refuted. 0 times theorem prover too weak. 906 trivial. 0 not checked. [2024-11-20 08:09:01,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [197829615] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 08:09:01,295 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 08:09:01,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15, 15] total 34 [2024-11-20 08:09:01,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336197385] [2024-11-20 08:09:01,296 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 08:09:01,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-20 08:09:01,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 08:09:01,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-20 08:09:01,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=919, Unknown=0, NotChecked=0, Total=1122 [2024-11-20 08:09:01,301 INFO L87 Difference]: Start difference. First operand 86 states and 126 transitions. Second operand has 34 states, 34 states have (on average 2.5) internal successors, (85), 34 states have internal predecessors, (85), 9 states have call successors, (36), 4 states have call predecessors, (36), 10 states have return successors, (38), 9 states have call predecessors, (38), 9 states have call successors, (38) [2024-11-20 08:09:05,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:09:05,656 INFO L93 Difference]: Finished difference Result 516 states and 752 transitions. [2024-11-20 08:09:05,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2024-11-20 08:09:05,657 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 34 states have (on average 2.5) internal successors, (85), 34 states have internal predecessors, (85), 9 states have call successors, (36), 4 states have call predecessors, (36), 10 states have return successors, (38), 9 states have call predecessors, (38), 9 states have call successors, (38) Word has length 156 [2024-11-20 08:09:05,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:09:05,661 INFO L225 Difference]: With dead ends: 516 [2024-11-20 08:09:05,662 INFO L226 Difference]: Without dead ends: 433 [2024-11-20 08:09:05,664 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 344 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 684 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=844, Invalid=2696, Unknown=0, NotChecked=0, Total=3540 [2024-11-20 08:09:05,665 INFO L432 NwaCegarLoop]: 199 mSDtfsCounter, 1001 mSDsluCounter, 1119 mSDsCounter, 0 mSdLazyCounter, 1491 mSolverCounterSat, 766 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1017 SdHoareTripleChecker+Valid, 1318 SdHoareTripleChecker+Invalid, 2257 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 766 IncrementalHoareTripleChecker+Valid, 1491 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2024-11-20 08:09:05,665 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1017 Valid, 1318 Invalid, 2257 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [766 Valid, 1491 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2024-11-20 08:09:05,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2024-11-20 08:09:05,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 164. [2024-11-20 08:09:05,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 116 states have (on average 1.3103448275862069) internal successors, (152), 117 states have internal predecessors, (152), 40 states have call successors, (40), 7 states have call predecessors, (40), 7 states have return successors, (40), 39 states have call predecessors, (40), 40 states have call successors, (40) [2024-11-20 08:09:05,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 232 transitions. [2024-11-20 08:09:05,718 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 232 transitions. Word has length 156 [2024-11-20 08:09:05,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:09:05,719 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 232 transitions. [2024-11-20 08:09:05,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 34 states have (on average 2.5) internal successors, (85), 34 states have internal predecessors, (85), 9 states have call successors, (36), 4 states have call predecessors, (36), 10 states have return successors, (38), 9 states have call predecessors, (38), 9 states have call successors, (38) [2024-11-20 08:09:05,722 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 232 transitions. [2024-11-20 08:09:05,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2024-11-20 08:09:05,728 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:09:05,728 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 08:09:05,739 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 08:09:05,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-20 08:09:05,929 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:09:05,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:09:05,930 INFO L85 PathProgramCache]: Analyzing trace with hash -1754825555, now seen corresponding path program 1 times [2024-11-20 08:09:05,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 08:09:05,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690072968] [2024-11-20 08:09:05,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:09:05,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 08:09:05,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 08:09:05,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [472911346] [2024-11-20 08:09:05,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:09:05,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:09:05,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:09:05,997 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 08:09:06,000 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 08:09:06,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:09:06,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 08:09:06,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 08:09:06,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 08:09:06,265 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 08:09:06,266 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 08:09:06,279 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-20 08:09:06,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 08:09:06,472 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2024-11-20 08:09:06,573 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 08:09:06,578 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 08:09:06 BoogieIcfgContainer [2024-11-20 08:09:06,578 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 08:09:06,579 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 08:09:06,579 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 08:09:06,579 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 08:09:06,579 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:08:55" (3/4) ... [2024-11-20 08:09:06,582 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 08:09:06,583 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 08:09:06,583 INFO L158 Benchmark]: Toolchain (without parser) took 12484.90ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 125.2MB in the beginning and 63.0MB in the end (delta: 62.2MB). Peak memory consumption was 97.9MB. Max. memory is 16.1GB. [2024-11-20 08:09:06,583 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 100.7MB. Free memory was 65.8MB in the beginning and 65.7MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:09:06,584 INFO L158 Benchmark]: CACSL2BoogieTranslator took 378.46ms. Allocated memory is still 176.2MB. Free memory was 124.6MB in the beginning and 108.7MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-11-20 08:09:06,584 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.87ms. Allocated memory is still 176.2MB. Free memory was 108.7MB in the beginning and 104.2MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 08:09:06,584 INFO L158 Benchmark]: Boogie Preprocessor took 97.49ms. Allocated memory is still 176.2MB. Free memory was 104.2MB in the beginning and 142.9MB in the end (delta: -38.7MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. [2024-11-20 08:09:06,584 INFO L158 Benchmark]: RCFGBuilder took 696.69ms. Allocated memory is still 176.2MB. Free memory was 142.9MB in the beginning and 116.7MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2024-11-20 08:09:06,585 INFO L158 Benchmark]: TraceAbstraction took 11233.29ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 115.6MB in the beginning and 63.0MB in the end (delta: 52.7MB). Peak memory consumption was 90.4MB. Max. memory is 16.1GB. [2024-11-20 08:09:06,585 INFO L158 Benchmark]: Witness Printer took 4.22ms. Allocated memory is still 211.8MB. Free memory is still 63.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 08:09:06,586 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.19ms. Allocated memory is still 100.7MB. Free memory was 65.8MB in the beginning and 65.7MB in the end (delta: 77.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 378.46ms. Allocated memory is still 176.2MB. Free memory was 124.6MB in the beginning and 108.7MB in the end (delta: 15.9MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.87ms. Allocated memory is still 176.2MB. Free memory was 108.7MB in the beginning and 104.2MB in the end (delta: 4.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 97.49ms. Allocated memory is still 176.2MB. Free memory was 104.2MB in the beginning and 142.9MB in the end (delta: -38.7MB). Peak memory consumption was 9.5MB. Max. memory is 16.1GB. * RCFGBuilder took 696.69ms. Allocated memory is still 176.2MB. Free memory was 142.9MB in the beginning and 116.7MB in the end (delta: 26.2MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. * TraceAbstraction took 11233.29ms. Allocated memory was 176.2MB in the beginning and 211.8MB in the end (delta: 35.7MB). Free memory was 115.6MB in the beginning and 63.0MB in the end (delta: 52.7MB). Peak memory consumption was 90.4MB. Max. memory is 16.1GB. * Witness Printer took 4.22ms. Allocated memory is still 211.8MB. Free memory is still 63.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 143, overapproximation of someBinaryDOUBLEComparisonOperation at line 143. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] double var_1_1 = 15.8; [L23] float var_1_2 = 9.5; [L24] float var_1_4 = 127.6; [L25] double var_1_5 = 100000000000000.5; [L26] double var_1_6 = 100000000000000.7; [L27] double var_1_7 = 256.75; [L28] unsigned char var_1_8 = 0; [L29] unsigned char var_1_9 = 1; [L30] unsigned char var_1_10 = 0; [L31] unsigned char var_1_11 = 0; [L32] signed char var_1_12 = 0; [L33] signed char var_1_13 = 2; [L34] unsigned char var_1_14 = 1; [L35] unsigned char var_1_16 = 10; [L36] unsigned char var_1_18 = 4; [L37] unsigned char var_1_19 = 8; [L38] unsigned char var_1_20 = 8; [L39] unsigned short int var_1_21 = 128; [L40] unsigned char var_1_22 = 0; [L41] unsigned short int var_1_24 = 34649; [L42] unsigned char last_1_var_1_8 = 0; [L43] unsigned short int last_1_var_1_21 = 128; [L44] unsigned char last_1_var_1_22 = 0; VAL [isInitial=0, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_2=19/2, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L147] isInitial = 1 [L148] FCALL initially() [L149] COND TRUE 1 [L150] CALL updateLastVariables() [L138] last_1_var_1_8 = var_1_8 [L139] last_1_var_1_21 = var_1_21 [L140] last_1_var_1_22 = var_1_22 VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_2=19/2, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L150] RET updateLastVariables() [L151] CALL updateVariables() [L98] var_1_2 = __VERIFIER_nondet_float() [L99] CALL assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L99] RET assume_abort_if_not((var_1_2 >= -922337.2036854776000e+13F && var_1_2 <= -1.0e-20F) || (var_1_2 <= 9223372.036854776000e+12F && var_1_2 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_4=638/5, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L100] var_1_4 = __VERIFIER_nondet_float() [L101] 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_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L101] 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_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_5=200000000000001/2, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L102] var_1_5 = __VERIFIER_nondet_double() [L103] CALL assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L103] RET assume_abort_if_not((var_1_5 >= -461168.6018427382800e+13F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 4611686.018427382800e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_6=1000000000000007/10, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L104] var_1_6 = __VERIFIER_nondet_double() [L105] CALL assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L105] RET assume_abort_if_not((var_1_6 >= -461168.6018427382800e+13F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 4611686.018427382800e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_7=1027/4, var_1_8=0, var_1_9=1] [L106] var_1_7 = __VERIFIER_nondet_double() [L107] CALL assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L107] RET assume_abort_if_not((var_1_7 >= -461168.6018427382800e+13F && var_1_7 <= -1.0e-20F) || (var_1_7 <= 4611686.018427382800e+12F && var_1_7 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L108] var_1_9 = __VERIFIER_nondet_uchar() [L109] CALL assume_abort_if_not(var_1_9 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L109] RET assume_abort_if_not(var_1_9 >= 1) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L110] CALL assume_abort_if_not(var_1_9 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L110] RET assume_abort_if_not(var_1_9 <= 1) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L111] var_1_10 = __VERIFIER_nondet_uchar() [L112] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L112] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L113] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L113] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L114] var_1_11 = __VERIFIER_nondet_uchar() [L115] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L115] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L116] CALL assume_abort_if_not(var_1_11 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L116] RET assume_abort_if_not(var_1_11 <= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=2, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L117] var_1_13 = __VERIFIER_nondet_char() [L118] CALL assume_abort_if_not(var_1_13 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L118] RET assume_abort_if_not(var_1_13 >= -127) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L119] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L119] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=10, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L120] var_1_16 = __VERIFIER_nondet_uchar() [L121] CALL assume_abort_if_not(var_1_16 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L121] RET assume_abort_if_not(var_1_16 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L122] CALL assume_abort_if_not(var_1_16 <= 255) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L122] RET assume_abort_if_not(var_1_16 <= 255) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L123] CALL assume_abort_if_not(var_1_16 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L123] RET assume_abort_if_not(var_1_16 != 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_18=4, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L124] var_1_18 = __VERIFIER_nondet_uchar() [L125] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L125] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L126] CALL assume_abort_if_not(var_1_18 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L126] RET assume_abort_if_not(var_1_18 <= 64) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=8, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L127] var_1_19 = __VERIFIER_nondet_uchar() [L128] CALL assume_abort_if_not(var_1_19 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L128] RET assume_abort_if_not(var_1_19 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L129] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L129] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_20=8, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L130] var_1_20 = __VERIFIER_nondet_uchar() [L131] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L131] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L132] CALL assume_abort_if_not(var_1_20 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L132] RET assume_abort_if_not(var_1_20 <= 127) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=34649, var_1_8=0, var_1_9=1] [L133] var_1_24 = __VERIFIER_nondet_ushort() [L134] CALL assume_abort_if_not(var_1_24 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L134] RET assume_abort_if_not(var_1_24 >= 32767) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L135] CALL assume_abort_if_not(var_1_24 <= 65535) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L135] RET assume_abort_if_not(var_1_24 <= 65535) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L151] RET updateVariables() [L152] CALL step() [L48] signed long int stepLocal_0 = (last_1_var_1_22 / var_1_16) * last_1_var_1_21; VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_0=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=1, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L49] COND FALSE !(last_1_var_1_21 < stepLocal_0) [L52] var_1_14 = var_1_18 VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=0, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L54] EXPR var_1_18 << var_1_14 VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=0, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L54] signed long int stepLocal_3 = var_1_18 << var_1_14; [L55] EXPR var_1_14 | var_1_18 VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_3=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=0, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=0, var_1_24=32767, var_1_8=0, var_1_9=1] [L55] signed long int stepLocal_2 = (var_1_14 | var_1_18) / (var_1_24 - 1); [L56] COND FALSE !(var_1_19 == stepLocal_3) [L63] var_1_22 = 64 VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=0, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=1] [L65] COND FALSE !(64.5f <= var_1_2) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=0, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=1] [L76] COND FALSE !(var_1_1 > ((var_1_1 * var_1_5) + 5.3)) [L83] var_1_8 = var_1_11 VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=0, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=1] [L85] COND FALSE !(((- var_1_1) / 24.75) < var_1_6) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=0, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=1] [L92] unsigned char stepLocal_1 = var_1_10; VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_1=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=0, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=1] [L93] COND FALSE !(var_1_8 && stepLocal_1) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, stepLocal_2=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=0, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=1] [L152] RET step() [L153] CALL, EXPR property() [L143] EXPR ((((((64.5f <= var_1_2) ? (last_1_var_1_8 ? ((var_1_2 == var_1_4) ? (var_1_1 == ((double) (var_1_5 + ((((((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))) < (50.25)) ? (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))) : (50.25)))))) : (var_1_1 == ((double) var_1_7))) : (var_1_1 == ((double) var_1_5))) : 1) && ((var_1_1 > ((var_1_1 * var_1_5) + 5.3)) ? (((var_1_7 + var_1_1) < var_1_6) ? (var_1_8 == ((unsigned char) var_1_9)) : (var_1_8 == ((unsigned char) var_1_10))) : (var_1_8 == ((unsigned char) var_1_11)))) && ((((- var_1_1) / 24.75) < var_1_6) ? ((var_1_7 >= var_1_1) ? (var_1_12 == ((signed char) var_1_13)) : (var_1_12 == ((signed char) var_1_13))) : 1)) && ((last_1_var_1_21 < ((last_1_var_1_22 / var_1_16) * last_1_var_1_21)) ? (var_1_14 == ((unsigned char) ((var_1_18 + var_1_19) + var_1_20))) : (var_1_14 == ((unsigned char) var_1_18)))) && ((var_1_8 && var_1_10) ? (var_1_21 == ((unsigned short int) ((((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) > (2)) ? (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) : (2))))) : 1)) && ((var_1_19 == (var_1_18 << var_1_14)) ? ((last_1_var_1_22 >= ((var_1_14 | var_1_18) / (var_1_24 - 1))) ? (var_1_22 == ((unsigned char) 2)) : (var_1_22 == ((unsigned char) var_1_20))) : (var_1_22 == ((unsigned char) 64))) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=0, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=1] [L143-L144] return ((((((64.5f <= var_1_2) ? (last_1_var_1_8 ? ((var_1_2 == var_1_4) ? (var_1_1 == ((double) (var_1_5 + ((((((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))) < (50.25)) ? (((((var_1_6) > (var_1_7)) ? (var_1_6) : (var_1_7)))) : (50.25)))))) : (var_1_1 == ((double) var_1_7))) : (var_1_1 == ((double) var_1_5))) : 1) && ((var_1_1 > ((var_1_1 * var_1_5) + 5.3)) ? (((var_1_7 + var_1_1) < var_1_6) ? (var_1_8 == ((unsigned char) var_1_9)) : (var_1_8 == ((unsigned char) var_1_10))) : (var_1_8 == ((unsigned char) var_1_11)))) && ((((- var_1_1) / 24.75) < var_1_6) ? ((var_1_7 >= var_1_1) ? (var_1_12 == ((signed char) var_1_13)) : (var_1_12 == ((signed char) var_1_13))) : 1)) && ((last_1_var_1_21 < ((last_1_var_1_22 / var_1_16) * last_1_var_1_21)) ? (var_1_14 == ((unsigned char) ((var_1_18 + var_1_19) + var_1_20))) : (var_1_14 == ((unsigned char) var_1_18)))) && ((var_1_8 && var_1_10) ? (var_1_21 == ((unsigned short int) ((((((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) > (2)) ? (((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19)))) : (2))))) : 1)) && ((var_1_19 == (var_1_18 << var_1_14)) ? ((last_1_var_1_22 >= ((var_1_14 | var_1_18) / (var_1_24 - 1))) ? (var_1_22 == ((unsigned char) 2)) : (var_1_22 == ((unsigned char) var_1_20))) : (var_1_22 == ((unsigned char) 64))) ; [L153] RET, EXPR property() [L153] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=0, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_21=128, last_1_var_1_22=0, last_1_var_1_8=0, var_1_10=0, var_1_11=0, var_1_12=0, var_1_13=-127, var_1_14=0, var_1_16=-1, var_1_18=0, var_1_19=-255, var_1_1=79/5, var_1_20=0, var_1_21=128, var_1_22=64, var_1_24=32767, var_1_8=0, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 86 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.1s, OverallIterations: 4, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1137 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1114 mSDsluCounter, 1767 SdHoareTripleChecker+Invalid, 3.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1350 mSDsCounter, 791 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1664 IncrementalHoareTripleChecker+Invalid, 2455 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 791 mSolverCounterUnsat, 417 mSDtfsCounter, 1664 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 844 GetRequests, 774 SyntacticMatches, 1 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 696 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=164occurred in iteration=3, InterpolantAutomatonStates: 49, 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, 273 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 1092 NumberOfCodeBlocks, 1092 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 1085 ConstructedInterpolants, 0 QuantifiedInterpolants, 3040 SizeOfPredicates, 10 NumberOfNonLiveVariables, 703 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 7 InterpolantComputations, 1 PerfectInterpolantSequences, 7464/7728 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-11-20 08:09:06,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-88.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 a455b61fe113f47d14217d396c2a515531f7c318e642948056697e83622a1761 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 08:09:08,794 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 08:09:08,865 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 08:09:08,869 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 08:09:08,870 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 08:09:08,895 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 08:09:08,897 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 08:09:08,898 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 08:09:08,898 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 08:09:08,899 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 08:09:08,899 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 08:09:08,899 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 08:09:08,900 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 08:09:08,901 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 08:09:08,902 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 08:09:08,902 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 08:09:08,905 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 08:09:08,905 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 08:09:08,905 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 08:09:08,905 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 08:09:08,906 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 08:09:08,906 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 08:09:08,906 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 08:09:08,907 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 08:09:08,907 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 08:09:08,907 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 08:09:08,907 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 08:09:08,907 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 08:09:08,908 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 08:09:08,908 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 08:09:08,908 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 08:09:08,908 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 08:09:08,909 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 08:09:08,909 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 08:09:08,910 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:09:08,911 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 08:09:08,911 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 08:09:08,912 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 08:09:08,912 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 08:09:08,912 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 08:09:08,912 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 08:09:08,913 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 08:09:08,913 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 08:09:08,913 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 08:09:08,913 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 -> a455b61fe113f47d14217d396c2a515531f7c318e642948056697e83622a1761 [2024-11-20 08:09:09,260 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 08:09:09,283 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 08:09:09,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 08:09:09,287 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 08:09:09,287 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 08:09:09,288 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-88.i [2024-11-20 08:09:10,856 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 08:09:11,056 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 08:09:11,056 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount50_file-88.i [2024-11-20 08:09:11,068 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d82719849/1d536af9980c4a1ba35ba8b0cd65ef57/FLAG4edf5bf84 [2024-11-20 08:09:11,083 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d82719849/1d536af9980c4a1ba35ba8b0cd65ef57 [2024-11-20 08:09:11,085 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 08:09:11,087 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 08:09:11,088 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 08:09:11,088 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 08:09:11,094 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 08:09:11,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:09:11" (1/1) ... [2024-11-20 08:09:11,096 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@703c8a0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:11, skipping insertion in model container [2024-11-20 08:09:11,096 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 08:09:11" (1/1) ... [2024-11-20 08:09:11,122 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 08:09:11,327 WARN L250 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_operatoramount_amount50_file-88.i[915,928] [2024-11-20 08:09:11,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:09:11,421 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 08:09:11,433 WARN L250 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_operatoramount_amount50_file-88.i[915,928] [2024-11-20 08:09:11,475 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 08:09:11,501 INFO L204 MainTranslator]: Completed translation [2024-11-20 08:09:11,501 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:11 WrapperNode [2024-11-20 08:09:11,501 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 08:09:11,502 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 08:09:11,503 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 08:09:11,503 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 08:09:11,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:11" (1/1) ... [2024-11-20 08:09:11,529 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:11" (1/1) ... [2024-11-20 08:09:11,565 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 155 [2024-11-20 08:09:11,567 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 08:09:11,568 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 08:09:11,569 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 08:09:11,569 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 08:09:11,580 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:11" (1/1) ... [2024-11-20 08:09:11,580 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:11" (1/1) ... [2024-11-20 08:09:11,586 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:11" (1/1) ... [2024-11-20 08:09:11,608 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-11-20 08:09:11,609 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:11" (1/1) ... [2024-11-20 08:09:11,609 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:11" (1/1) ... [2024-11-20 08:09:11,624 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:11" (1/1) ... [2024-11-20 08:09:11,632 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:11" (1/1) ... [2024-11-20 08:09:11,634 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:11" (1/1) ... [2024-11-20 08:09:11,636 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:11" (1/1) ... [2024-11-20 08:09:11,642 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 08:09:11,647 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 08:09:11,647 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 08:09:11,647 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 08:09:11,648 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:11" (1/1) ... [2024-11-20 08:09:11,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 08:09:11,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 08:09:11,684 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-11-20 08:09:11,687 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-11-20 08:09:11,731 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 08:09:11,732 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 08:09:11,732 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 08:09:11,732 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 08:09:11,732 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 08:09:11,733 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 08:09:11,838 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 08:09:11,841 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 08:09:24,977 INFO L? ?]: Removed 16 outVars from TransFormulas that were not future-live. [2024-11-20 08:09:24,978 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 08:09:24,994 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 08:09:24,994 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 08:09:24,994 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:09:24 BoogieIcfgContainer [2024-11-20 08:09:24,994 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 08:09:24,996 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 08:09:24,996 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 08:09:24,999 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 08:09:24,999 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 08:09:11" (1/3) ... [2024-11-20 08:09:25,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66dd8726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:09:25, skipping insertion in model container [2024-11-20 08:09:25,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 08:09:11" (2/3) ... [2024-11-20 08:09:25,000 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66dd8726 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 08:09:25, skipping insertion in model container [2024-11-20 08:09:25,000 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 08:09:24" (3/3) ... [2024-11-20 08:09:25,003 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount50_file-88.i [2024-11-20 08:09:25,017 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 08:09:25,017 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 08:09:25,089 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 08:09:25,096 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;@47f652ec, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 08:09:25,098 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 08:09:25,102 INFO L276 IsEmpty]: Start isEmpty. Operand has 70 states, 43 states have (on average 1.372093023255814) internal successors, (59), 44 states have internal predecessors, (59), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 08:09:25,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-20 08:09:25,114 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:09:25,115 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 08:09:25,115 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:09:25,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:09:25,119 INFO L85 PathProgramCache]: Analyzing trace with hash 535919197, now seen corresponding path program 1 times [2024-11-20 08:09:25,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:09:25,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [446286348] [2024-11-20 08:09:25,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:09:25,132 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-11-20 08:09:25,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:09:25,135 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-11-20 08:09:25,136 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-11-20 08:09:25,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:25,814 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 08:09:25,827 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:09:25,894 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 574 proven. 0 refuted. 0 times theorem prover too weak. 530 trivial. 0 not checked. [2024-11-20 08:09:25,895 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 08:09:25,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:09:25,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [446286348] [2024-11-20 08:09:25,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [446286348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 08:09:25,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 08:09:25,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 08:09:25,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610758791] [2024-11-20 08:09:25,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 08:09:25,907 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 08:09:25,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:09:25,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 08:09:25,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 08:09:25,937 INFO L87 Difference]: Start difference. First operand has 70 states, 43 states have (on average 1.372093023255814) internal successors, (59), 44 states have internal predecessors, (59), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-20 08:09:25,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:09:25,979 INFO L93 Difference]: Finished difference Result 133 states and 232 transitions. [2024-11-20 08:09:25,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 08:09:25,981 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 151 [2024-11-20 08:09:25,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:09:25,990 INFO L225 Difference]: With dead ends: 133 [2024-11-20 08:09:25,991 INFO L226 Difference]: Without dead ends: 66 [2024-11-20 08:09:25,994 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 150 GetRequests, 150 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-11-20 08:09:25,999 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 08:09:26,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 08:09:26,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2024-11-20 08:09:26,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2024-11-20 08:09:26,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.3) internal successors, (52), 40 states have internal predecessors, (52), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 08:09:26,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 100 transitions. [2024-11-20 08:09:26,051 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 100 transitions. Word has length 151 [2024-11-20 08:09:26,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:09:26,051 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 100 transitions. [2024-11-20 08:09:26,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.0) internal successors, (38), 2 states have internal predecessors, (38), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2024-11-20 08:09:26,052 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 100 transitions. [2024-11-20 08:09:26,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-20 08:09:26,056 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:09:26,056 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 08:09:26,080 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 08:09:26,257 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-11-20 08:09:26,257 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:09:26,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:09:26,258 INFO L85 PathProgramCache]: Analyzing trace with hash 325807633, now seen corresponding path program 1 times [2024-11-20 08:09:26,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:09:26,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300179635] [2024-11-20 08:09:26,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:09:26,260 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-11-20 08:09:26,260 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:09:26,262 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-11-20 08:09:26,263 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-11-20 08:09:26,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:26,905 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-20 08:09:26,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:09:29,125 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 519 proven. 45 refuted. 0 times theorem prover too weak. 540 trivial. 0 not checked. [2024-11-20 08:09:29,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 08:09:31,296 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 24 proven. 45 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2024-11-20 08:09:31,297 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 08:09:31,297 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300179635] [2024-11-20 08:09:31,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300179635] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 08:09:31,298 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 08:09:31,298 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 8 [2024-11-20 08:09:31,298 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [276055870] [2024-11-20 08:09:31,298 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 08:09:31,300 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 08:09:31,300 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 08:09:31,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 08:09:31,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2024-11-20 08:09:31,302 INFO L87 Difference]: Start difference. First operand 66 states and 100 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-20 08:09:37,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.19s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 08:09:41,970 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 08:09:45,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 08:09:49,987 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-11-20 08:09:49,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 08:09:49,990 INFO L93 Difference]: Finished difference Result 137 states and 204 transitions. [2024-11-20 08:09:50,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 08:09:50,078 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 151 [2024-11-20 08:09:50,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 08:09:50,081 INFO L225 Difference]: With dead ends: 137 [2024-11-20 08:09:50,082 INFO L226 Difference]: Without dead ends: 74 [2024-11-20 08:09:50,082 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 293 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2024-11-20 08:09:50,083 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 40 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 10 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.2s IncrementalHoareTripleChecker+Time [2024-11-20 08:09:50,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 228 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 170 Invalid, 4 Unknown, 0 Unchecked, 18.2s Time] [2024-11-20 08:09:50,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-11-20 08:09:50,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 70. [2024-11-20 08:09:50,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.255813953488372) internal successors, (54), 43 states have internal predecessors, (54), 24 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2024-11-20 08:09:50,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 102 transitions. [2024-11-20 08:09:50,097 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 102 transitions. Word has length 151 [2024-11-20 08:09:50,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 08:09:50,098 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 102 transitions. [2024-11-20 08:09:50,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 8 states have internal predecessors, (43), 2 states have call successors, (39), 2 states have call predecessors, (39), 4 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2024-11-20 08:09:50,098 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 102 transitions. [2024-11-20 08:09:50,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2024-11-20 08:09:50,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 08:09:50,101 INFO L215 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-11-20 08:09:50,123 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-11-20 08:09:50,301 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-11-20 08:09:50,302 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 08:09:50,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 08:09:50,303 INFO L85 PathProgramCache]: Analyzing trace with hash 327654675, now seen corresponding path program 1 times [2024-11-20 08:09:50,303 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 08:09:50,303 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [791336930] [2024-11-20 08:09:50,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 08:09:50,304 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-11-20 08:09:50,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 08:09:50,307 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-11-20 08:09:50,309 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-11-20 08:09:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 08:09:50,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 243 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-20 08:09:50,926 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 08:10:05,634 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 740 proven. 66 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2024-11-20 08:10:05,635 INFO L311 TraceCheckSpWp]: Computing backward predicates...