./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 61a67961 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.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 f95659a8fc1e04f167ecdb4d0123e1d69ef966390fa6f196f3801f7a0fa3ea55 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:40:54,813 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:40:54,877 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-14 09:40:54,882 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:40:54,883 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:40:54,914 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:40:54,915 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:40:54,915 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:40:54,916 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:40:54,917 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:40:54,918 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:40:54,918 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:40:54,918 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:40:54,919 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:40:54,919 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:40:54,921 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:40:54,921 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:40:54,921 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:40:54,922 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-14 09:40:54,922 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:40:54,925 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:40:54,925 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:40:54,925 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:40:54,926 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:40:54,926 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:40:54,926 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:40:54,926 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:40:54,927 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:40:54,927 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:40:54,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:40:54,927 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:40:54,928 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:40:54,928 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:40:54,931 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:40:54,931 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:40:54,931 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:40:54,931 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-14 09:40:54,932 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-14 09:40:54,932 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:40:54,932 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:40:54,932 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:40:54,933 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:40:54,933 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 -> f95659a8fc1e04f167ecdb4d0123e1d69ef966390fa6f196f3801f7a0fa3ea55 [2024-10-14 09:40:55,185 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:40:55,214 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:40:55,217 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:40:55,218 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:40:55,219 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:40:55,220 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i [2024-10-14 09:40:56,676 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:40:56,913 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:40:56,913 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i [2024-10-14 09:40:56,929 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91f5cb694/80ed8dc112c24766ad88f148a88fb69b/FLAG36a7ab6f9 [2024-10-14 09:40:56,943 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/91f5cb694/80ed8dc112c24766ad88f148a88fb69b [2024-10-14 09:40:56,946 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:40:56,947 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:40:56,950 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:40:56,950 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:40:56,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:40:56,956 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:40:56" (1/1) ... [2024-10-14 09:40:56,959 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@10b5d597 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:56, skipping insertion in model container [2024-10-14 09:40:56,960 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:40:56" (1/1) ... [2024-10-14 09:40:56,995 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:40:57,172 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i[919,932] [2024-10-14 09:40:57,282 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:40:57,312 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:40:57,326 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i[919,932] [2024-10-14 09:40:57,362 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:40:57,384 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:40:57,388 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:57 WrapperNode [2024-10-14 09:40:57,388 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:40:57,389 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:40:57,389 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:40:57,390 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:40:57,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:57" (1/1) ... [2024-10-14 09:40:57,405 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:57" (1/1) ... [2024-10-14 09:40:57,453 INFO L138 Inliner]: procedures = 26, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 226 [2024-10-14 09:40:57,453 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:40:57,454 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:40:57,454 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:40:57,454 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:40:57,467 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:57" (1/1) ... [2024-10-14 09:40:57,468 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:57" (1/1) ... [2024-10-14 09:40:57,472 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:57" (1/1) ... [2024-10-14 09:40:57,500 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 09:40:57,500 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:57" (1/1) ... [2024-10-14 09:40:57,500 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:57" (1/1) ... [2024-10-14 09:40:57,514 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:57" (1/1) ... [2024-10-14 09:40:57,519 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:57" (1/1) ... [2024-10-14 09:40:57,525 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:57" (1/1) ... [2024-10-14 09:40:57,531 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:57" (1/1) ... [2024-10-14 09:40:57,541 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:40:57,542 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:40:57,542 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:40:57,542 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:40:57,543 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:57" (1/1) ... [2024-10-14 09:40:57,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:40:57,561 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:40:57,578 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 09:40:57,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 09:40:57,632 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:40:57,633 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:40:57,633 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:40:57,633 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-14 09:40:57,633 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:40:57,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:40:57,727 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:40:57,729 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:40:58,178 INFO L? ?]: Removed 24 outVars from TransFormulas that were not future-live. [2024-10-14 09:40:58,179 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:40:58,225 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:40:58,226 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:40:58,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:40:58 BoogieIcfgContainer [2024-10-14 09:40:58,226 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:40:58,229 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:40:58,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:40:58,233 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:40:58,233 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:40:56" (1/3) ... [2024-10-14 09:40:58,234 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40643cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:40:58, skipping insertion in model container [2024-10-14 09:40:58,234 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:40:57" (2/3) ... [2024-10-14 09:40:58,235 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40643cd4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:40:58, skipping insertion in model container [2024-10-14 09:40:58,236 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:40:58" (3/3) ... [2024-10-14 09:40:58,237 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i [2024-10-14 09:40:58,250 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:40:58,251 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:40:58,306 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:40:58,313 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;@19902583, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:40:58,313 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:40:58,317 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 67 states have (on average 1.537313432835821) internal successors, (103), 68 states have internal predecessors, (103), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 09:40:58,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 09:40:58,331 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:40:58,332 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:40:58,332 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:40:58,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:40:58,338 INFO L85 PathProgramCache]: Analyzing trace with hash 49411275, now seen corresponding path program 1 times [2024-10-14 09:40:58,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:40:58,348 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524468274] [2024-10-14 09:40:58,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:40:58,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:40:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:58,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:40:58,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:58,666 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:40:58,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:58,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:40:58,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:58,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:40:58,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:58,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:40:58,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:58,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:40:58,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:58,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:40:58,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:58,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:40:58,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:58,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:40:58,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:58,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:40:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:58,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:40:58,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:58,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:40:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:58,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:40:58,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:58,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:40:58,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:58,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:40:58,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:58,744 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:40:58,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:58,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:40:58,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:58,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:40:58,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:58,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:40:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:58,767 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:40:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:58,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 09:40:58,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:58,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 09:40:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:58,793 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 09:40:58,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:40:58,794 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524468274] [2024-10-14 09:40:58,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524468274] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:40:58,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:40:58,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:40:58,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298839330] [2024-10-14 09:40:58,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:40:58,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:40:58,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:40:58,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:40:58,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:40:58,834 INFO L87 Difference]: Start difference. First operand has 92 states, 67 states have (on average 1.537313432835821) internal successors, (103), 68 states have internal predecessors, (103), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 09:40:58,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:40:58,907 INFO L93 Difference]: Finished difference Result 180 states and 312 transitions. [2024-10-14 09:40:58,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:40:58,911 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) Word has length 150 [2024-10-14 09:40:58,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:40:58,923 INFO L225 Difference]: With dead ends: 180 [2024-10-14 09:40:58,923 INFO L226 Difference]: Without dead ends: 89 [2024-10-14 09:40:58,928 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:40:58,933 INFO L432 NwaCegarLoop]: 131 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:40:58,935 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 131 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-14 09:40:58,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-14 09:40:58,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-14 09:40:58,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 65 states have (on average 1.4) internal successors, (91), 65 states have internal predecessors, (91), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 09:40:58,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 135 transitions. [2024-10-14 09:40:58,991 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 135 transitions. Word has length 150 [2024-10-14 09:40:58,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:40:58,992 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 135 transitions. [2024-10-14 09:40:58,992 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 09:40:58,992 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 135 transitions. [2024-10-14 09:40:58,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 09:40:58,996 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:40:58,996 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:40:58,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-14 09:40:58,996 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:40:58,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:40:58,997 INFO L85 PathProgramCache]: Analyzing trace with hash -379982339, now seen corresponding path program 1 times [2024-10-14 09:40:58,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:40:58,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82862424] [2024-10-14 09:40:58,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:40:58,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:40:59,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:40:59,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:40:59,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:40:59,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:40:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:40:59,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:40:59,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:40:59,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:40:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:40:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:40:59,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:40:59,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:40:59,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:40:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:40:59,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:40:59,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:40:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:40:59,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:40:59,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:40:59,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:40:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,245 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 09:40:59,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 09:40:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,254 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 09:40:59,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:40:59,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82862424] [2024-10-14 09:40:59,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82862424] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:40:59,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:40:59,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:40:59,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2046883320] [2024-10-14 09:40:59,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:40:59,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:40:59,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:40:59,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:40:59,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:40:59,262 INFO L87 Difference]: Start difference. First operand 89 states and 135 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 09:40:59,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:40:59,349 INFO L93 Difference]: Finished difference Result 232 states and 347 transitions. [2024-10-14 09:40:59,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:40:59,350 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2024-10-14 09:40:59,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:40:59,353 INFO L225 Difference]: With dead ends: 232 [2024-10-14 09:40:59,354 INFO L226 Difference]: Without dead ends: 144 [2024-10-14 09:40:59,354 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:40:59,358 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 71 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:40:59,359 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 278 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:40:59,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-10-14 09:40:59,382 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 141. [2024-10-14 09:40:59,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 108 states have (on average 1.3703703703703705) internal successors, (148), 109 states have internal predecessors, (148), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 09:40:59,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 208 transitions. [2024-10-14 09:40:59,390 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 208 transitions. Word has length 150 [2024-10-14 09:40:59,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:40:59,391 INFO L471 AbstractCegarLoop]: Abstraction has 141 states and 208 transitions. [2024-10-14 09:40:59,391 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 09:40:59,391 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 208 transitions. [2024-10-14 09:40:59,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2024-10-14 09:40:59,394 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:40:59,394 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:40:59,394 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-14 09:40:59,395 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:40:59,395 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:40:59,395 INFO L85 PathProgramCache]: Analyzing trace with hash 300076031, now seen corresponding path program 1 times [2024-10-14 09:40:59,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:40:59,396 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431351982] [2024-10-14 09:40:59,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:40:59,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:40:59,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:40:59,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:40:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:40:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:40:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:40:59,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:40:59,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:40:59,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:40:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,759 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:40:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:40:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:40:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:40:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:40:59,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:40:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:40:59,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:40:59,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:40:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:40:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:40:59,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:40:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 09:40:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 09:40:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:40:59,818 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 09:40:59,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:40:59,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431351982] [2024-10-14 09:40:59,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431351982] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:40:59,819 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:40:59,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-14 09:40:59,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118014165] [2024-10-14 09:40:59,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:40:59,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-14 09:40:59,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:40:59,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-14 09:40:59,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:40:59,823 INFO L87 Difference]: Start difference. First operand 141 states and 208 transitions. Second operand has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 09:40:59,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:40:59,921 INFO L93 Difference]: Finished difference Result 283 states and 419 transitions. [2024-10-14 09:40:59,922 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-14 09:40:59,923 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 150 [2024-10-14 09:40:59,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:40:59,930 INFO L225 Difference]: With dead ends: 283 [2024-10-14 09:40:59,930 INFO L226 Difference]: Without dead ends: 143 [2024-10-14 09:40:59,931 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-14 09:40:59,936 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:40:59,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 230 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:40:59,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-14 09:40:59,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-10-14 09:40:59,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 110 states have (on average 1.3636363636363635) internal successors, (150), 111 states have internal predecessors, (150), 30 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 29 states have call predecessors, (30), 30 states have call successors, (30) [2024-10-14 09:40:59,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 210 transitions. [2024-10-14 09:40:59,966 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 210 transitions. Word has length 150 [2024-10-14 09:40:59,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:40:59,967 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 210 transitions. [2024-10-14 09:40:59,967 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.333333333333334) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 09:40:59,967 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 210 transitions. [2024-10-14 09:40:59,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2024-10-14 09:40:59,973 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:40:59,973 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:40:59,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-14 09:40:59,974 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:40:59,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:40:59,974 INFO L85 PathProgramCache]: Analyzing trace with hash -899813429, now seen corresponding path program 1 times [2024-10-14 09:40:59,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:40:59,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126969533] [2024-10-14 09:40:59,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:40:59,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:41:00,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:00,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:41:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:00,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:41:00,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:00,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:41:00,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:00,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:41:00,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:00,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:41:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:00,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:41:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:00,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:41:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:00,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:41:00,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:00,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:41:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:00,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:41:00,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:00,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:41:00,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:00,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:41:00,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:00,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:41:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:00,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:41:00,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:00,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:41:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:00,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:41:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:00,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:41:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:00,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:41:00,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:00,786 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:41:00,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:00,795 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:41:00,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:00,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 09:41:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:00,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 09:41:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:00,835 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 09:41:00,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:41:00,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126969533] [2024-10-14 09:41:00,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126969533] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:41:00,836 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:41:00,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 09:41:00,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098425364] [2024-10-14 09:41:00,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:41:00,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:41:00,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:41:00,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:41:00,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:41:00,838 INFO L87 Difference]: Start difference. First operand 143 states and 210 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 09:41:01,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:41:01,215 INFO L93 Difference]: Finished difference Result 417 states and 610 transitions. [2024-10-14 09:41:01,216 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 09:41:01,216 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 152 [2024-10-14 09:41:01,218 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:41:01,222 INFO L225 Difference]: With dead ends: 417 [2024-10-14 09:41:01,222 INFO L226 Difference]: Without dead ends: 275 [2024-10-14 09:41:01,224 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:41:01,225 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 115 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 09:41:01,225 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 429 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 09:41:01,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2024-10-14 09:41:01,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 189. [2024-10-14 09:41:01,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 132 states have (on average 1.303030303030303) internal successors, (172), 133 states have internal predecessors, (172), 52 states have call successors, (52), 4 states have call predecessors, (52), 4 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 09:41:01,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 276 transitions. [2024-10-14 09:41:01,276 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 276 transitions. Word has length 152 [2024-10-14 09:41:01,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:41:01,277 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 276 transitions. [2024-10-14 09:41:01,277 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 09:41:01,277 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 276 transitions. [2024-10-14 09:41:01,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-14 09:41:01,279 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:41:01,279 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:41:01,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-14 09:41:01,279 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:41:01,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:41:01,280 INFO L85 PathProgramCache]: Analyzing trace with hash 1576955979, now seen corresponding path program 1 times [2024-10-14 09:41:01,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:41:01,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342896768] [2024-10-14 09:41:01,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:41:01,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:41:01,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:02,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:41:02,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:02,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:41:02,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:02,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:41:02,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:02,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:41:02,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:02,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:41:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:02,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:41:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:02,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:41:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:02,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:41:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:02,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:41:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:02,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:41:02,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:02,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:41:02,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:02,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:41:02,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:02,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:41:02,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:02,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:41:02,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:02,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:41:02,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:02,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:41:02,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:02,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:41:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:02,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:41:02,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:02,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:41:02,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:02,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:41:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:02,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 09:41:02,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:02,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 09:41:02,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:02,128 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 09:41:02,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:41:02,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [342896768] [2024-10-14 09:41:02,129 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [342896768] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:41:02,129 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:41:02,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-14 09:41:02,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902428567] [2024-10-14 09:41:02,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:41:02,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-14 09:41:02,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:41:02,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-14 09:41:02,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-14 09:41:02,133 INFO L87 Difference]: Start difference. First operand 189 states and 276 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 09:41:02,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:41:02,889 INFO L93 Difference]: Finished difference Result 517 states and 743 transitions. [2024-10-14 09:41:02,890 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-14 09:41:02,891 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 153 [2024-10-14 09:41:02,891 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:41:02,893 INFO L225 Difference]: With dead ends: 517 [2024-10-14 09:41:02,895 INFO L226 Difference]: Without dead ends: 375 [2024-10-14 09:41:02,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-10-14 09:41:02,896 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 187 mSDsluCounter, 391 mSDsCounter, 0 mSdLazyCounter, 263 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 09:41:02,898 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [187 Valid, 527 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 263 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 09:41:02,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2024-10-14 09:41:02,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 312. [2024-10-14 09:41:02,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 235 states have (on average 1.3063829787234043) internal successors, (307), 238 states have internal predecessors, (307), 70 states have call successors, (70), 6 states have call predecessors, (70), 6 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 09:41:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 447 transitions. [2024-10-14 09:41:02,952 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 447 transitions. Word has length 153 [2024-10-14 09:41:02,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:41:02,952 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 447 transitions. [2024-10-14 09:41:02,953 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 6 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 09:41:02,953 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 447 transitions. [2024-10-14 09:41:02,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-14 09:41:02,955 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:41:02,955 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:41:02,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-14 09:41:02,956 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:41:02,957 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:41:02,957 INFO L85 PathProgramCache]: Analyzing trace with hash -943003955, now seen corresponding path program 1 times [2024-10-14 09:41:02,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:41:02,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722552578] [2024-10-14 09:41:02,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:41:02,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:41:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:03,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:41:03,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:03,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:41:03,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:03,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:41:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:03,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:41:03,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:03,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:41:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:03,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:41:03,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:03,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:41:03,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:03,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:41:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:03,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:41:03,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:03,419 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:41:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:03,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:41:03,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:03,430 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:41:03,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:03,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:41:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:03,439 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:41:03,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:03,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:41:03,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:03,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:41:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:03,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:41:03,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:03,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:41:03,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:03,464 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:41:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:03,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:41:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:03,474 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 09:41:03,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:03,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 09:41:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:03,485 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 09:41:03,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:41:03,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722552578] [2024-10-14 09:41:03,485 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1722552578] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:41:03,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:41:03,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-14 09:41:03,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98176495] [2024-10-14 09:41:03,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:41:03,486 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:41:03,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:41:03,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:41:03,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:41:03,488 INFO L87 Difference]: Start difference. First operand 312 states and 447 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 09:41:03,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:41:03,797 INFO L93 Difference]: Finished difference Result 753 states and 1073 transitions. [2024-10-14 09:41:03,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 09:41:03,798 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 153 [2024-10-14 09:41:03,798 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:41:03,802 INFO L225 Difference]: With dead ends: 753 [2024-10-14 09:41:03,802 INFO L226 Difference]: Without dead ends: 488 [2024-10-14 09:41:03,803 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:41:03,805 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 113 mSDsluCounter, 309 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 67 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 430 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 67 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:41:03,806 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 430 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [67 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 09:41:03,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 488 states. [2024-10-14 09:41:03,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 488 to 313. [2024-10-14 09:41:03,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 236 states have (on average 1.305084745762712) internal successors, (308), 239 states have internal predecessors, (308), 70 states have call successors, (70), 6 states have call predecessors, (70), 6 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 09:41:03,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 448 transitions. [2024-10-14 09:41:03,855 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 448 transitions. Word has length 153 [2024-10-14 09:41:03,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:41:03,856 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 448 transitions. [2024-10-14 09:41:03,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 09:41:03,857 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 448 transitions. [2024-10-14 09:41:03,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2024-10-14 09:41:03,858 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:41:03,859 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:41:03,859 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-14 09:41:03,859 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:41:03,859 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:41:03,860 INFO L85 PathProgramCache]: Analyzing trace with hash -880964341, now seen corresponding path program 1 times [2024-10-14 09:41:03,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:41:03,860 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208661888] [2024-10-14 09:41:03,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:41:03,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:41:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:41:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:41:04,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:41:04,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:41:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:41:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,351 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:41:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:41:04,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:41:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:41:04,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:41:04,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:41:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:41:04,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:41:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:41:04,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:41:04,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:41:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:41:04,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:41:04,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:41:04,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:41:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 09:41:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 09:41:04,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,385 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 09:41:04,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:41:04,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208661888] [2024-10-14 09:41:04,386 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208661888] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:41:04,386 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:41:04,386 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:41:04,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031369638] [2024-10-14 09:41:04,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:41:04,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-14 09:41:04,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:41:04,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-14 09:41:04,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-14 09:41:04,388 INFO L87 Difference]: Start difference. First operand 313 states and 448 transitions. Second operand has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 09:41:04,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:41:04,536 INFO L93 Difference]: Finished difference Result 598 states and 862 transitions. [2024-10-14 09:41:04,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-14 09:41:04,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 153 [2024-10-14 09:41:04,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:41:04,539 INFO L225 Difference]: With dead ends: 598 [2024-10-14 09:41:04,540 INFO L226 Difference]: Without dead ends: 333 [2024-10-14 09:41:04,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:41:04,544 INFO L432 NwaCegarLoop]: 201 mSDtfsCounter, 104 mSDsluCounter, 289 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 490 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:41:04,544 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 490 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-14 09:41:04,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2024-10-14 09:41:04,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 313. [2024-10-14 09:41:04,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 313 states, 236 states have (on average 1.2881355932203389) internal successors, (304), 239 states have internal predecessors, (304), 70 states have call successors, (70), 6 states have call predecessors, (70), 6 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 09:41:04,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 313 states to 313 states and 444 transitions. [2024-10-14 09:41:04,605 INFO L78 Accepts]: Start accepts. Automaton has 313 states and 444 transitions. Word has length 153 [2024-10-14 09:41:04,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:41:04,605 INFO L471 AbstractCegarLoop]: Abstraction has 313 states and 444 transitions. [2024-10-14 09:41:04,605 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.5) internal successors, (46), 4 states have internal predecessors, (46), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 09:41:04,606 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 444 transitions. [2024-10-14 09:41:04,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-14 09:41:04,607 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:41:04,607 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:41:04,607 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-14 09:41:04,608 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:41:04,608 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:41:04,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1058947206, now seen corresponding path program 1 times [2024-10-14 09:41:04,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:41:04,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678822974] [2024-10-14 09:41:04,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:41:04,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:41:04,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:41:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:41:04,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:41:04,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:41:04,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,826 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:41:04,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:41:04,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:41:04,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:41:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:41:04,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:41:04,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:41:04,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:41:04,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:41:04,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,864 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:41:04,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:41:04,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,871 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:41:04,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,874 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:41:04,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:41:04,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:41:04,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,882 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:41:04,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 09:41:04,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,887 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 09:41:04,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:04,891 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-14 09:41:04,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:41:04,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678822974] [2024-10-14 09:41:04,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678822974] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 09:41:04,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [875952017] [2024-10-14 09:41:04,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:41:04,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:41:04,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:41:04,895 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 09:41:04,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-14 09:41:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:05,026 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 09:41:05,036 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:41:05,187 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 481 proven. 33 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-10-14 09:41:05,187 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:41:05,478 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-14 09:41:05,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [875952017] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:41:05,479 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 09:41:05,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2024-10-14 09:41:05,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883638854] [2024-10-14 09:41:05,479 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 09:41:05,480 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 09:41:05,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:41:05,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 09:41:05,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2024-10-14 09:41:05,481 INFO L87 Difference]: Start difference. First operand 313 states and 444 transitions. Second operand has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2024-10-14 09:41:05,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:41:05,742 INFO L93 Difference]: Finished difference Result 567 states and 799 transitions. [2024-10-14 09:41:05,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-14 09:41:05,743 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) Word has length 155 [2024-10-14 09:41:05,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:41:05,746 INFO L225 Difference]: With dead ends: 567 [2024-10-14 09:41:05,746 INFO L226 Difference]: Without dead ends: 302 [2024-10-14 09:41:05,747 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2024-10-14 09:41:05,748 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 76 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-14 09:41:05,748 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 201 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-14 09:41:05,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-10-14 09:41:05,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 290. [2024-10-14 09:41:05,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 211 states have (on average 1.2464454976303319) internal successors, (263), 214 states have internal predecessors, (263), 70 states have call successors, (70), 8 states have call predecessors, (70), 8 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 09:41:05,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 403 transitions. [2024-10-14 09:41:05,801 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 403 transitions. Word has length 155 [2024-10-14 09:41:05,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:41:05,802 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 403 transitions. [2024-10-14 09:41:05,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.5) internal successors, (76), 8 states have internal predecessors, (76), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2024-10-14 09:41:05,802 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 403 transitions. [2024-10-14 09:41:05,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-14 09:41:05,803 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:41:05,804 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:41:05,823 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-14 09:41:06,004 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:41:06,005 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:41:06,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:41:06,005 INFO L85 PathProgramCache]: Analyzing trace with hash 618589385, now seen corresponding path program 1 times [2024-10-14 09:41:06,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:41:06,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93173409] [2024-10-14 09:41:06,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:41:06,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:41:06,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:06,442 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:41:06,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:06,445 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:41:06,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:06,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:41:06,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:06,449 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:41:06,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:06,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:41:06,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:06,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:41:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:06,454 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:41:06,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:06,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:41:06,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:06,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:41:06,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:06,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:41:06,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:06,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:41:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:06,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:41:06,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:06,466 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:41:06,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:06,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:41:06,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:06,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:41:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:06,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:41:06,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:06,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:41:06,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:06,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:41:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:06,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:41:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:06,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:41:06,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:06,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 09:41:06,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:06,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 09:41:06,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:06,499 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 09:41:06,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:41:06,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93173409] [2024-10-14 09:41:06,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93173409] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:41:06,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:41:06,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-14 09:41:06,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425806210] [2024-10-14 09:41:06,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:41:06,501 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-14 09:41:06,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:41:06,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-14 09:41:06,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-10-14 09:41:06,502 INFO L87 Difference]: Start difference. First operand 290 states and 403 transitions. Second operand has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 09:41:07,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:41:07,127 INFO L93 Difference]: Finished difference Result 683 states and 949 transitions. [2024-10-14 09:41:07,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-14 09:41:07,127 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 155 [2024-10-14 09:41:07,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:41:07,130 INFO L225 Difference]: With dead ends: 683 [2024-10-14 09:41:07,131 INFO L226 Difference]: Without dead ends: 445 [2024-10-14 09:41:07,132 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2024-10-14 09:41:07,132 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 163 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 407 SdHoareTripleChecker+Invalid, 513 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-14 09:41:07,133 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 407 Invalid, 513 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-14 09:41:07,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 445 states. [2024-10-14 09:41:07,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 445 to 309. [2024-10-14 09:41:07,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 230 states have (on average 1.2521739130434784) internal successors, (288), 233 states have internal predecessors, (288), 70 states have call successors, (70), 8 states have call predecessors, (70), 8 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 09:41:07,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 428 transitions. [2024-10-14 09:41:07,209 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 428 transitions. Word has length 155 [2024-10-14 09:41:07,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:41:07,209 INFO L471 AbstractCegarLoop]: Abstraction has 309 states and 428 transitions. [2024-10-14 09:41:07,210 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.0) internal successors, (48), 8 states have internal predecessors, (48), 2 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 09:41:07,210 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 428 transitions. [2024-10-14 09:41:07,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2024-10-14 09:41:07,211 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:41:07,211 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:41:07,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-14 09:41:07,212 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:41:07,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:41:07,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1298647755, now seen corresponding path program 1 times [2024-10-14 09:41:07,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:41:07,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002620680] [2024-10-14 09:41:07,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:41:07,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:41:07,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:07,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:41:07,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:07,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:41:07,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:07,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:41:07,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:07,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:41:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:07,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:41:07,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:07,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:41:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:07,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:41:07,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:07,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:41:07,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:07,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:41:07,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:07,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:41:07,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:07,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:41:07,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:07,521 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:41:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:07,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:41:07,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:07,528 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:41:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:07,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:41:07,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:07,533 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:41:07,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:07,536 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:41:07,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:07,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:41:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:07,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:41:07,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:07,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:41:07,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:07,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 09:41:07,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:07,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 09:41:07,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:07,552 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-14 09:41:07,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:41:07,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002620680] [2024-10-14 09:41:07,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002620680] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 09:41:07,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1752315002] [2024-10-14 09:41:07,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:41:07,553 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:41:07,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:41:07,555 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 09:41:07,556 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-14 09:41:07,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:07,704 INFO L255 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-10-14 09:41:07,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:41:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 481 proven. 33 refuted. 0 times theorem prover too weak. 410 trivial. 0 not checked. [2024-10-14 09:41:07,834 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:41:08,024 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-14 09:41:08,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1752315002] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:41:08,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 09:41:08,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-10-14 09:41:08,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [786675080] [2024-10-14 09:41:08,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 09:41:08,025 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-14 09:41:08,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:41:08,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-14 09:41:08,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2024-10-14 09:41:08,027 INFO L87 Difference]: Start difference. First operand 309 states and 428 transitions. Second operand has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2024-10-14 09:41:08,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:41:08,391 INFO L93 Difference]: Finished difference Result 559 states and 772 transitions. [2024-10-14 09:41:08,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 09:41:08,392 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) Word has length 155 [2024-10-14 09:41:08,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:41:08,394 INFO L225 Difference]: With dead ends: 559 [2024-10-14 09:41:08,394 INFO L226 Difference]: Without dead ends: 302 [2024-10-14 09:41:08,396 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 361 GetRequests, 350 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2024-10-14 09:41:08,396 INFO L432 NwaCegarLoop]: 81 mSDtfsCounter, 133 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 310 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-14 09:41:08,397 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 310 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-14 09:41:08,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2024-10-14 09:41:08,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 290. [2024-10-14 09:41:08,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 211 states have (on average 1.2274881516587677) internal successors, (259), 214 states have internal predecessors, (259), 70 states have call successors, (70), 8 states have call predecessors, (70), 8 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 09:41:08,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 399 transitions. [2024-10-14 09:41:08,453 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 399 transitions. Word has length 155 [2024-10-14 09:41:08,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:41:08,454 INFO L471 AbstractCegarLoop]: Abstraction has 290 states and 399 transitions. [2024-10-14 09:41:08,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.9) internal successors, (79), 10 states have internal predecessors, (79), 3 states have call successors, (44), 2 states have call predecessors, (44), 4 states have return successors, (45), 3 states have call predecessors, (45), 3 states have call successors, (45) [2024-10-14 09:41:08,454 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 399 transitions. [2024-10-14 09:41:08,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-14 09:41:08,457 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:41:08,457 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:41:08,476 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-14 09:41:08,660 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,SelfDestructingSolverStorable9 [2024-10-14 09:41:08,661 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:41:08,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:41:08,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1146594606, now seen corresponding path program 1 times [2024-10-14 09:41:08,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:41:08,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1499150461] [2024-10-14 09:41:08,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:41:08,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:41:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:09,228 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-10-14 09:41:09,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:09,231 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-14 09:41:09,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:09,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-10-14 09:41:09,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:09,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-10-14 09:41:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:09,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-10-14 09:41:09,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:09,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-10-14 09:41:09,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:09,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-10-14 09:41:09,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:09,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-10-14 09:41:09,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:09,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-10-14 09:41:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:09,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-10-14 09:41:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:09,249 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-10-14 09:41:09,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:09,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-10-14 09:41:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:09,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-10-14 09:41:09,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:09,286 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-10-14 09:41:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:09,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-10-14 09:41:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:09,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-10-14 09:41:09,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:09,300 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-10-14 09:41:09,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:09,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-10-14 09:41:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:09,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-10-14 09:41:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:09,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2024-10-14 09:41:09,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:09,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2024-10-14 09:41:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:09,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-10-14 09:41:09,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:09,323 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-14 09:41:09,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-14 09:41:09,323 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1499150461] [2024-10-14 09:41:09,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1499150461] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-14 09:41:09,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710247749] [2024-10-14 09:41:09,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:41:09,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:41:09,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:41:09,326 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 09:41:09,328 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-14 09:41:09,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:09,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 369 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-14 09:41:09,726 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:41:10,165 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 494 proven. 60 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-14 09:41:10,165 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:41:10,957 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 60 proven. 63 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2024-10-14 09:41:10,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710247749] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:41:10,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-14 09:41:10,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 25 [2024-10-14 09:41:10,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847849110] [2024-10-14 09:41:10,958 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-14 09:41:10,959 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-14 09:41:10,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-14 09:41:10,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-14 09:41:10,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=169, Invalid=431, Unknown=0, NotChecked=0, Total=600 [2024-10-14 09:41:10,961 INFO L87 Difference]: Start difference. First operand 290 states and 399 transitions. Second operand has 25 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 7 states have call successors, (45), 3 states have call predecessors, (45), 6 states have return successors, (46), 6 states have call predecessors, (46), 7 states have call successors, (46) [2024-10-14 09:41:11,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:41:11,935 INFO L93 Difference]: Finished difference Result 551 states and 747 transitions. [2024-10-14 09:41:11,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-14 09:41:11,936 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 7 states have call successors, (45), 3 states have call predecessors, (45), 6 states have return successors, (46), 6 states have call predecessors, (46), 7 states have call successors, (46) Word has length 159 [2024-10-14 09:41:11,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:41:11,941 INFO L225 Difference]: With dead ends: 551 [2024-10-14 09:41:11,941 INFO L226 Difference]: Without dead ends: 313 [2024-10-14 09:41:11,943 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 381 GetRequests, 347 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 246 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=364, Invalid=896, Unknown=0, NotChecked=0, Total=1260 [2024-10-14 09:41:11,943 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 429 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 449 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-14 09:41:11,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [449 Valid, 423 Invalid, 787 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-14 09:41:11,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-10-14 09:41:11,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 298. [2024-10-14 09:41:11,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 217 states have (on average 1.1889400921658986) internal successors, (258), 220 states have internal predecessors, (258), 70 states have call successors, (70), 10 states have call predecessors, (70), 10 states have return successors, (70), 67 states have call predecessors, (70), 70 states have call successors, (70) [2024-10-14 09:41:11,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 398 transitions. [2024-10-14 09:41:11,994 INFO L78 Accepts]: Start accepts. Automaton has 298 states and 398 transitions. Word has length 159 [2024-10-14 09:41:11,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:41:11,994 INFO L471 AbstractCegarLoop]: Abstraction has 298 states and 398 transitions. [2024-10-14 09:41:11,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 5.913043478260869) internal successors, (136), 23 states have internal predecessors, (136), 7 states have call successors, (45), 3 states have call predecessors, (45), 6 states have return successors, (46), 6 states have call predecessors, (46), 7 states have call successors, (46) [2024-10-14 09:41:11,995 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 398 transitions. [2024-10-14 09:41:11,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2024-10-14 09:41:11,997 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:41:11,997 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:41:12,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-14 09:41:12,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:41:12,199 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:41:12,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:41:12,200 INFO L85 PathProgramCache]: Analyzing trace with hash -466536236, now seen corresponding path program 1 times [2024-10-14 09:41:12,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-14 09:41:12,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929781282] [2024-10-14 09:41:12,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:41:12,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-14 09:41:12,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-10-14 09:41:12,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1232965605] [2024-10-14 09:41:12,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:41:12,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:41:12,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:41:12,296 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-14 09:41:12,297 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-14 09:41:13,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:41:13,018 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-10-14 09:41:13,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-10-14 09:41:13,225 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-10-14 09:41:13,225 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-10-14 09:41:13,226 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-14 09:41:13,248 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-14 09:41:13,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-14 09:41:13,437 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:41:13,553 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-14 09:41:13,556 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 09:41:13 BoogieIcfgContainer [2024-10-14 09:41:13,556 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-14 09:41:13,557 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-14 09:41:13,557 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-14 09:41:13,557 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-14 09:41:13,558 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:40:58" (3/4) ... [2024-10-14 09:41:13,560 INFO L142 WitnessPrinter]: No result that supports witness generation found [2024-10-14 09:41:13,561 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-14 09:41:13,561 INFO L158 Benchmark]: Toolchain (without parser) took 16614.40ms. Allocated memory was 163.6MB in the beginning and 314.6MB in the end (delta: 151.0MB). Free memory was 96.8MB in the beginning and 242.4MB in the end (delta: -145.5MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2024-10-14 09:41:13,561 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:41:13,561 INFO L158 Benchmark]: CACSL2BoogieTranslator took 438.85ms. Allocated memory is still 163.6MB. Free memory was 96.5MB in the beginning and 132.1MB in the end (delta: -35.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-14 09:41:13,562 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.81ms. Allocated memory is still 163.6MB. Free memory was 132.1MB in the beginning and 127.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-14 09:41:13,562 INFO L158 Benchmark]: Boogie Preprocessor took 87.50ms. Allocated memory is still 163.6MB. Free memory was 127.9MB in the beginning and 121.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-10-14 09:41:13,562 INFO L158 Benchmark]: RCFGBuilder took 684.24ms. Allocated memory is still 163.6MB. Free memory was 121.6MB in the beginning and 88.0MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2024-10-14 09:41:13,562 INFO L158 Benchmark]: TraceAbstraction took 15326.74ms. Allocated memory was 163.6MB in the beginning and 314.6MB in the end (delta: 151.0MB). Free memory was 86.7MB in the beginning and 242.4MB in the end (delta: -155.6MB). There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:41:13,563 INFO L158 Benchmark]: Witness Printer took 3.92ms. Allocated memory is still 314.6MB. Free memory is still 242.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-14 09:41:13,564 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 109.1MB. Free memory is still 70.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 438.85ms. Allocated memory is still 163.6MB. Free memory was 96.5MB in the beginning and 132.1MB in the end (delta: -35.6MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.81ms. Allocated memory is still 163.6MB. Free memory was 132.1MB in the beginning and 127.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 87.50ms. Allocated memory is still 163.6MB. Free memory was 127.9MB in the beginning and 121.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 684.24ms. Allocated memory is still 163.6MB. Free memory was 121.6MB in the beginning and 88.0MB in the end (delta: 33.6MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 15326.74ms. Allocated memory was 163.6MB in the beginning and 314.6MB in the end (delta: 151.0MB). Free memory was 86.7MB in the beginning and 242.4MB in the end (delta: -155.6MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.92ms. Allocated memory is still 314.6MB. Free memory is still 242.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 178, overapproximation of bitwiseOr at line 98, overapproximation of someBinaryDOUBLEComparisonOperation at line 178, overapproximation of someBinaryArithmeticFLOAToperation at line 124. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned long int var_1_1 = 64; [L23] unsigned char var_1_4 = 0; [L24] unsigned long int var_1_5 = 3914692693; [L25] unsigned long int var_1_7 = 1; [L26] unsigned char var_1_8 = 0; [L27] unsigned char var_1_9 = 0; [L28] unsigned char var_1_10 = 0; [L29] unsigned char var_1_11 = 50; [L30] signed long int var_1_12 = 25; [L31] signed long int var_1_13 = 1; [L32] float var_1_15 = 4.75; [L33] unsigned char var_1_16 = 100; [L34] float var_1_17 = 50.1; [L35] float var_1_18 = 100.9; [L36] float var_1_19 = 8.5; [L37] float var_1_20 = 10.625; [L38] float var_1_21 = 0.0; [L39] float var_1_22 = 7.8; [L40] float var_1_23 = 8.25; [L41] double var_1_24 = 5.5; [L42] signed char var_1_25 = -16; [L43] float var_1_28 = 3.5; [L44] signed short int var_1_29 = -8; [L45] signed char var_1_31 = -32; [L46] signed char var_1_32 = 2; [L47] signed long int var_1_34 = -4; [L48] double var_1_38 = 0.5; [L49] unsigned long int last_1_var_1_1 = 64; [L50] unsigned char last_1_var_1_11 = 50; [L182] isInitial = 1 [L183] FCALL initially() [L184] COND TRUE 1 [L185] CALL updateLastVariables() [L174] last_1_var_1_1 = var_1_1 [L175] last_1_var_1_11 = var_1_11 [L185] RET updateLastVariables() [L186] CALL updateVariables() [L136] var_1_4 = __VERIFIER_nondet_uchar() [L137] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L137] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L138] CALL assume_abort_if_not(var_1_4 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L138] RET assume_abort_if_not(var_1_4 <= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3914692693, var_1_7=1, var_1_8=0, var_1_9=0] [L139] var_1_5 = __VERIFIER_nondet_ulong() [L140] CALL assume_abort_if_not(var_1_5 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=1, var_1_8=0, var_1_9=0] [L140] RET assume_abort_if_not(var_1_5 >= 3221225470) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=1, var_1_8=0, var_1_9=0] [L141] CALL assume_abort_if_not(var_1_5 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=1, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=1, var_1_8=0, var_1_9=0] [L141] RET assume_abort_if_not(var_1_5 <= 4294967294) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=1, var_1_8=0, var_1_9=0] [L142] var_1_7 = __VERIFIER_nondet_ulong() [L143] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_8=0, var_1_9=0] [L143] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_8=0, var_1_9=0] [L144] CALL assume_abort_if_not(var_1_7 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L144] RET assume_abort_if_not(var_1_7 <= 2147483647) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L145] var_1_9 = __VERIFIER_nondet_uchar() [L146] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0] [L146] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0] [L147] CALL assume_abort_if_not(var_1_9 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L147] RET assume_abort_if_not(var_1_9 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L148] var_1_10 = __VERIFIER_nondet_uchar() [L149] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L149] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L150] CALL assume_abort_if_not(var_1_10 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L150] RET assume_abort_if_not(var_1_10 <= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=25, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L151] var_1_12 = __VERIFIER_nondet_long() [L152] CALL assume_abort_if_not(var_1_12 >= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L152] RET assume_abort_if_not(var_1_12 >= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L153] CALL assume_abort_if_not(var_1_12 <= 29) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L153] RET assume_abort_if_not(var_1_12 <= 29) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=1, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L154] var_1_13 = __VERIFIER_nondet_long() [L155] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L155] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L156] CALL assume_abort_if_not(var_1_13 <= 14) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L156] RET assume_abort_if_not(var_1_13 <= 14) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=100, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L157] var_1_16 = __VERIFIER_nondet_uchar() [L158] CALL assume_abort_if_not(var_1_16 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L158] RET assume_abort_if_not(var_1_16 >= 1) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L159] CALL assume_abort_if_not(var_1_16 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L159] RET assume_abort_if_not(var_1_16 <= 127) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_17=501/10, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L160] var_1_17 = __VERIFIER_nondet_float() [L161] CALL assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L161] RET assume_abort_if_not((var_1_17 >= -922337.2036854765600e+13F && var_1_17 <= -1.0e-20F) || (var_1_17 <= 9223372.036854765600e+12F && var_1_17 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_19=17/2, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L162] var_1_19 = __VERIFIER_nondet_float() [L163] CALL assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L163] RET assume_abort_if_not((var_1_19 >= -461168.6018427382800e+13F && var_1_19 <= -1.0e-20F) || (var_1_19 <= 4611686.018427382800e+12F && var_1_19 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_20=85/8, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L164] var_1_20 = __VERIFIER_nondet_float() [L165] CALL assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L165] RET assume_abort_if_not((var_1_20 >= -461168.6018427382800e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 4611686.018427382800e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_21=0, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L166] var_1_21 = __VERIFIER_nondet_float() [L167] CALL assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L167] RET assume_abort_if_not((var_1_21 >= 2305843.009213691390e+12F && var_1_21 <= -1.0e-20F) || (var_1_21 <= 4611686.018427382800e+12F && var_1_21 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=39/5, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L168] var_1_22 = __VERIFIER_nondet_float() [L169] CALL assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L169] RET assume_abort_if_not((var_1_22 >= 0.0F && var_1_22 <= -1.0e-20F) || (var_1_22 <= 2305843.009213691390e+12F && var_1_22 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_23=33/4, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L170] var_1_23 = __VERIFIER_nondet_float() [L171] CALL assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L171] RET assume_abort_if_not((var_1_23 >= 0.0F && var_1_23 <= -1.0e-20F) || (var_1_23 <= 4611686.018427382800e+12F && var_1_23 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L186] RET updateVariables() [L187] CALL step() [L54] signed long int stepLocal_1 = last_1_var_1_11; [L55] signed long int stepLocal_0 = last_1_var_1_11; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, stepLocal_1=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L56] COND TRUE stepLocal_1 < last_1_var_1_1 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_0=50, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L57] COND FALSE !(last_1_var_1_1 <= stepLocal_0) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L61] COND TRUE ((((var_1_7) < (var_1_13)) ? (var_1_7) : (var_1_13))) <= var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L62] COND FALSE !(\read(var_1_8)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L78] unsigned long int stepLocal_3 = var_1_7; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=29, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L79] EXPR 5u << (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_3=29, var_1_10=0, var_1_11=50, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L79] unsigned long int stepLocal_2 = 5u << (var_1_12 - var_1_13); [L80] COND FALSE !(! ((var_1_5 > var_1_7) || var_1_8)) [L91] var_1_11 = var_1_12 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=29, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=-8, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L93] COND TRUE (~ (5 + var_1_12)) >= 10000u [L94] var_1_29 = (((((var_1_1 + var_1_12)) > (((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12))))) ? ((var_1_1 + var_1_12)) : (((((var_1_12) < 0 ) ? -(var_1_12) : (var_1_12)))))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=29, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L98] EXPR var_1_12 | -5 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=29, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L98] EXPR ((var_1_12) < ((var_1_12 | -5))) ? (var_1_12) : ((var_1_12 | -5)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=29, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L98] EXPR var_1_12 | -5 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=29, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L98] EXPR ((var_1_12) < ((var_1_12 | -5))) ? (var_1_12) : ((var_1_12 | -5)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=29, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=1/2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L98] COND FALSE !(var_1_11 <= ((((var_1_12) < ((var_1_12 | -5))) ? (var_1_12) : ((var_1_12 | -5))))) [L103] var_1_38 = var_1_22 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=29, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=64, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L104] COND FALSE !(! (var_1_11 >= var_1_11)) [L111] var_1_1 = var_1_11 VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=29, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L113] COND FALSE !(\read(var_1_10)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=29, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L118] COND FALSE !((~ (var_1_5 % 200u)) < 32u) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=29, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_18=1009/10, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L121] COND FALSE !(\read(var_1_10)) [L124] var_1_18 = (((var_1_21 - var_1_22) - var_1_23) + var_1_20) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=29, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L126] unsigned long int stepLocal_4 = ~ var_1_1; VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=29, stepLocal_4=4294967281, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L127] COND FALSE !(stepLocal_4 <= (var_1_12 - var_1_11)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=29, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L130] COND FALSE !(var_1_12 > var_1_12) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, stepLocal_2=5, stepLocal_3=29, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=-32, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L133] var_1_31 = var_1_12 [L187] RET step() [L188] CALL, EXPR property() [L178] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L178] EXPR (! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L178] EXPR (((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L178-L179] return ((((((! (var_1_11 >= var_1_11)) ? (var_1_8 ? (var_1_1 == ((unsigned long int) ((var_1_5 - var_1_11) - var_1_11))) : (var_1_1 == ((unsigned long int) var_1_5))) : (var_1_1 == ((unsigned long int) var_1_11))) && ((last_1_var_1_11 < last_1_var_1_1) ? ((last_1_var_1_1 <= last_1_var_1_11) ? (var_1_8 == ((unsigned char) ((var_1_4 && var_1_9) || var_1_10))) : 1) : 1)) && ((! ((var_1_5 > var_1_7) || var_1_8)) ? (((5u << (var_1_12 - var_1_13)) > (var_1_5 / 25u)) ? (((-64 * var_1_5) != var_1_7) ? (var_1_11 == ((unsigned char) ((((var_1_13) < (var_1_12)) ? (var_1_13) : (var_1_12))))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12))) : (var_1_11 == ((unsigned char) var_1_12)))) && (var_1_10 ? ((var_1_1 > (var_1_11 / (var_1_12 + var_1_16))) ? (var_1_15 == ((float) var_1_17)) : 1) : 1)) && (var_1_10 ? (var_1_18 == ((float) (var_1_19 + var_1_20))) : (var_1_18 == ((float) (((var_1_21 - var_1_22) - var_1_23) + var_1_20))))) && (((~ var_1_1) <= (var_1_12 - var_1_11)) ? (var_1_24 == ((double) var_1_22)) : 1) ; [L188] RET, EXPR property() [L188] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_11=50, last_1_var_1_1=64, var_1_10=0, var_1_11=14, var_1_12=14, var_1_13=14, var_1_15=19/4, var_1_16=1, var_1_1=14, var_1_22=2, var_1_24=11/2, var_1_25=-16, var_1_28=7/2, var_1_29=78, var_1_31=14, var_1_32=2, var_1_34=-4, var_1_38=2, var_1_4=0, var_1_5=3221225600, var_1_7=29, var_1_8=0, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 92 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 15.1s, OverallIterations: 12, TraceHistogramMax: 22, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1431 SdHoareTripleChecker+Valid, 2.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1391 mSDsluCounter, 3856 SdHoareTripleChecker+Invalid, 2.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2474 mSDsCounter, 414 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2261 IncrementalHoareTripleChecker+Invalid, 2675 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 414 mSolverCounterUnsat, 1382 mSDtfsCounter, 2261 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1531 GetRequests, 1447 SyntacticMatches, 0 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=313occurred in iteration=6, InterpolantAutomatonStates: 70, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 11 MinimizatonAttempts, 522 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 6.7s InterpolantComputationTime, 2472 NumberOfCodeBlocks, 2472 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2606 ConstructedInterpolants, 0 QuantifiedInterpolants, 7772 SizeOfPredicates, 4 NumberOfNonLiveVariables, 1088 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 17 InterpolantComputations, 8 PerfectInterpolantSequences, 15354/15708 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-10-14 09:41:13,602 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_fillercode_fillercodestructure_filler-pr-ci_file-74.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 f95659a8fc1e04f167ecdb4d0123e1d69ef966390fa6f196f3801f7a0fa3ea55 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.fs.cvc5-61a6796-m [2024-10-14 09:41:15,909 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-14 09:41:15,987 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-10-14 09:41:15,997 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-14 09:41:15,997 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-14 09:41:16,034 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-14 09:41:16,035 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-14 09:41:16,035 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-14 09:41:16,036 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-14 09:41:16,037 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-14 09:41:16,037 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-14 09:41:16,037 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-14 09:41:16,038 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-14 09:41:16,039 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-14 09:41:16,040 INFO L153 SettingsManager]: * Use SBE=true [2024-10-14 09:41:16,040 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-14 09:41:16,040 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-14 09:41:16,041 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-14 09:41:16,043 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-14 09:41:16,043 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-14 09:41:16,044 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-14 09:41:16,046 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-14 09:41:16,047 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-14 09:41:16,047 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-14 09:41:16,047 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-10-14 09:41:16,047 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-14 09:41:16,048 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-10-14 09:41:16,048 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-14 09:41:16,048 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-14 09:41:16,048 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-14 09:41:16,049 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-14 09:41:16,049 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-14 09:41:16,049 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-14 09:41:16,050 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-14 09:41:16,050 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:41:16,051 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-14 09:41:16,052 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-14 09:41:16,053 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-14 09:41:16,053 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-10-14 09:41:16,053 INFO L153 SettingsManager]: * Command for external solver=cvc5 --incremental --print-success --lang smt [2024-10-14 09:41:16,053 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-14 09:41:16,054 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-14 09:41:16,055 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-14 09:41:16,055 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-14 09:41:16,055 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2024-10-14 09:41:16,055 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 -> f95659a8fc1e04f167ecdb4d0123e1d69ef966390fa6f196f3801f7a0fa3ea55 [2024-10-14 09:41:16,361 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-14 09:41:16,387 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-14 09:41:16,390 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-14 09:41:16,391 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-14 09:41:16,392 INFO L274 PluginConnector]: CDTParser initialized [2024-10-14 09:41:16,395 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i [2024-10-14 09:41:18,024 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-14 09:41:18,248 INFO L384 CDTParser]: Found 1 translation units. [2024-10-14 09:41:18,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i [2024-10-14 09:41:18,262 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ea7f5520/040a88e7a22e4003973278f7dfad074c/FLAG5f676b5df [2024-10-14 09:41:18,274 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ea7f5520/040a88e7a22e4003973278f7dfad074c [2024-10-14 09:41:18,276 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-14 09:41:18,278 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-14 09:41:18,279 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-14 09:41:18,279 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-14 09:41:18,284 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-14 09:41:18,285 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:41:18" (1/1) ... [2024-10-14 09:41:18,286 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14feada and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:18, skipping insertion in model container [2024-10-14 09:41:18,286 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 09:41:18" (1/1) ... [2024-10-14 09:41:18,317 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-14 09:41:18,507 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i[919,932] [2024-10-14 09:41:18,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:41:18,631 INFO L200 MainTranslator]: Completed pre-run [2024-10-14 09:41:18,643 WARN L248 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i[919,932] [2024-10-14 09:41:18,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-14 09:41:18,717 INFO L204 MainTranslator]: Completed translation [2024-10-14 09:41:18,717 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:18 WrapperNode [2024-10-14 09:41:18,717 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-14 09:41:18,718 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-14 09:41:18,718 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-14 09:41:18,718 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-14 09:41:18,725 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:18" (1/1) ... [2024-10-14 09:41:18,745 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:18" (1/1) ... [2024-10-14 09:41:18,784 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 178 [2024-10-14 09:41:18,784 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-14 09:41:18,785 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-14 09:41:18,785 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-14 09:41:18,785 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-14 09:41:18,795 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:18" (1/1) ... [2024-10-14 09:41:18,795 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:18" (1/1) ... [2024-10-14 09:41:18,801 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:18" (1/1) ... [2024-10-14 09:41:18,825 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-10-14 09:41:18,826 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:18" (1/1) ... [2024-10-14 09:41:18,826 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:18" (1/1) ... [2024-10-14 09:41:18,841 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:18" (1/1) ... [2024-10-14 09:41:18,845 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:18" (1/1) ... [2024-10-14 09:41:18,853 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:18" (1/1) ... [2024-10-14 09:41:18,857 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:18" (1/1) ... [2024-10-14 09:41:18,864 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-14 09:41:18,865 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-14 09:41:18,865 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-14 09:41:18,866 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-14 09:41:18,866 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:18" (1/1) ... [2024-10-14 09:41:18,875 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-14 09:41:18,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-14 09:41:18,902 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-14 09:41:18,909 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-14 09:41:18,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-14 09:41:18,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-10-14 09:41:18,954 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-10-14 09:41:18,954 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-10-14 09:41:18,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-14 09:41:18,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-14 09:41:19,036 INFO L238 CfgBuilder]: Building ICFG [2024-10-14 09:41:19,038 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-14 09:41:21,302 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-10-14 09:41:21,303 INFO L287 CfgBuilder]: Performing block encoding [2024-10-14 09:41:21,379 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-14 09:41:21,380 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-14 09:41:21,380 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:41:21 BoogieIcfgContainer [2024-10-14 09:41:21,380 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-14 09:41:21,382 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-14 09:41:21,382 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-14 09:41:21,385 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-14 09:41:21,385 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 09:41:18" (1/3) ... [2024-10-14 09:41:21,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@240e12eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:41:21, skipping insertion in model container [2024-10-14 09:41:21,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 09:41:18" (2/3) ... [2024-10-14 09:41:21,386 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@240e12eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 09:41:21, skipping insertion in model container [2024-10-14 09:41:21,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 09:41:21" (3/3) ... [2024-10-14 09:41:21,387 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-74.i [2024-10-14 09:41:21,402 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-14 09:41:21,402 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-14 09:41:21,477 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-14 09:41:21,484 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;@706c9da1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-14 09:41:21,484 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-14 09:41:21,489 INFO L276 IsEmpty]: Start isEmpty. Operand has 74 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 50 states have internal predecessors, (76), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 09:41:21,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-14 09:41:21,504 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:41:21,505 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:41:21,506 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:41:21,513 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:41:21,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1720166959, now seen corresponding path program 1 times [2024-10-14 09:41:21,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:41:21,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561753002] [2024-10-14 09:41:21,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:41:21,531 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:41:21,531 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:41:21,534 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:41:21,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-10-14 09:41:21,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:21,900 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-10-14 09:41:21,908 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:41:21,978 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 474 proven. 0 refuted. 0 times theorem prover too weak. 450 trivial. 0 not checked. [2024-10-14 09:41:21,979 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:41:21,979 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:41:21,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561753002] [2024-10-14 09:41:21,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561753002] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:41:21,980 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:41:21,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-14 09:41:21,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968649504] [2024-10-14 09:41:21,983 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:41:21,987 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-10-14 09:41:21,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:41:22,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-10-14 09:41:22,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:41:22,014 INFO L87 Difference]: Start difference. First operand has 74 states, 49 states have (on average 1.5510204081632653) internal successors, (76), 50 states have internal predecessors, (76), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 09:41:24,166 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:41:24,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:41:24,167 INFO L93 Difference]: Finished difference Result 143 states and 256 transitions. [2024-10-14 09:41:24,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-10-14 09:41:24,189 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 144 [2024-10-14 09:41:24,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:41:24,196 INFO L225 Difference]: With dead ends: 143 [2024-10-14 09:41:24,196 INFO L226 Difference]: Without dead ends: 70 [2024-10-14 09:41:24,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-10-14 09:41:24,204 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:41:24,205 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 104 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2024-10-14 09:41:24,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2024-10-14 09:41:24,248 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2024-10-14 09:41:24,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 46 states have (on average 1.3695652173913044) internal successors, (63), 46 states have internal predecessors, (63), 22 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2024-10-14 09:41:24,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 107 transitions. [2024-10-14 09:41:24,256 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 107 transitions. Word has length 144 [2024-10-14 09:41:24,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:41:24,259 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 107 transitions. [2024-10-14 09:41:24,259 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.5) internal successors, (41), 2 states have internal predecessors, (41), 2 states have call successors, (22), 2 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2024-10-14 09:41:24,259 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 107 transitions. [2024-10-14 09:41:24,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2024-10-14 09:41:24,263 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:41:24,263 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:41:24,274 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-10-14 09:41:24,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:41:24,465 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:41:24,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:41:24,465 INFO L85 PathProgramCache]: Analyzing trace with hash 598297247, now seen corresponding path program 1 times [2024-10-14 09:41:24,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:41:24,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [633157369] [2024-10-14 09:41:24,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:41:24,467 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:41:24,467 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:41:24,470 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:41:24,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-10-14 09:41:24,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:24,827 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 09:41:24,833 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:41:26,300 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 09:41:26,300 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:41:26,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:41:26,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [633157369] [2024-10-14 09:41:26,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [633157369] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:41:26,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:41:26,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:41:26,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114097472] [2024-10-14 09:41:26,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:41:26,303 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:41:26,303 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:41:26,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:41:26,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:41:26,304 INFO L87 Difference]: Start difference. First operand 70 states and 107 transitions. Second operand has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 09:41:29,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:41:30,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:41:30,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:41:30,893 INFO L93 Difference]: Finished difference Result 209 states and 320 transitions. [2024-10-14 09:41:30,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 09:41:30,915 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 144 [2024-10-14 09:41:30,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:41:30,920 INFO L225 Difference]: With dead ends: 209 [2024-10-14 09:41:30,920 INFO L226 Difference]: Without dead ends: 140 [2024-10-14 09:41:30,921 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 145 GetRequests, 140 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:41:30,923 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 80 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-14 09:41:30,924 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 324 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-14 09:41:30,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-14 09:41:30,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 112. [2024-10-14 09:41:30,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 65 states have internal predecessors, (82), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-14 09:41:30,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 170 transitions. [2024-10-14 09:41:30,965 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 170 transitions. Word has length 144 [2024-10-14 09:41:30,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:41:30,966 INFO L471 AbstractCegarLoop]: Abstraction has 112 states and 170 transitions. [2024-10-14 09:41:30,966 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.4) internal successors, (37), 4 states have internal predecessors, (37), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 09:41:30,967 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 170 transitions. [2024-10-14 09:41:30,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-14 09:41:30,968 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:41:30,969 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:41:30,984 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-10-14 09:41:31,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:41:31,170 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:41:31,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:41:31,174 INFO L85 PathProgramCache]: Analyzing trace with hash 559895069, now seen corresponding path program 1 times [2024-10-14 09:41:31,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:41:31,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936100799] [2024-10-14 09:41:31,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:41:31,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:41:31,177 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:41:31,180 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:41:31,186 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-10-14 09:41:31,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:31,521 INFO L255 TraceCheckSpWp]: Trace formula consists of 241 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-14 09:41:31,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:41:32,681 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 924 trivial. 0 not checked. [2024-10-14 09:41:32,681 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-14 09:41:32,681 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:41:32,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936100799] [2024-10-14 09:41:32,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [936100799] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-14 09:41:32,682 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-14 09:41:32,682 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-14 09:41:32,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334764342] [2024-10-14 09:41:32,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-14 09:41:32,683 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-14 09:41:32,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:41:32,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-14 09:41:32,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-14 09:41:32,684 INFO L87 Difference]: Start difference. First operand 112 states and 170 transitions. Second operand has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 09:41:34,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.74s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:41:36,844 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.81s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:41:36,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:41:36,845 INFO L93 Difference]: Finished difference Result 209 states and 319 transitions. [2024-10-14 09:41:36,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-14 09:41:36,867 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 145 [2024-10-14 09:41:36,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:41:36,869 INFO L225 Difference]: With dead ends: 209 [2024-10-14 09:41:36,870 INFO L226 Difference]: Without dead ends: 140 [2024-10-14 09:41:36,871 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 141 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:41:36,872 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 78 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2024-10-14 09:41:36,872 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 325 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2024-10-14 09:41:36,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-10-14 09:41:36,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 113. [2024-10-14 09:41:36,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 66 states have (on average 1.2575757575757576) internal successors, (83), 66 states have internal predecessors, (83), 44 states have call successors, (44), 2 states have call predecessors, (44), 2 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-14 09:41:36,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 171 transitions. [2024-10-14 09:41:36,895 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 171 transitions. Word has length 145 [2024-10-14 09:41:36,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:41:36,895 INFO L471 AbstractCegarLoop]: Abstraction has 113 states and 171 transitions. [2024-10-14 09:41:36,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.6) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (22), 1 states have call predecessors, (22), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2024-10-14 09:41:36,896 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 171 transitions. [2024-10-14 09:41:36,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-14 09:41:36,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:41:36,899 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:41:36,916 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-10-14 09:41:37,099 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:41:37,100 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:41:37,100 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:41:37,101 INFO L85 PathProgramCache]: Analyzing trace with hash -1434249637, now seen corresponding path program 1 times [2024-10-14 09:41:37,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:41:37,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1691588744] [2024-10-14 09:41:37,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:41:37,102 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:41:37,102 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:41:37,106 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:41:37,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-10-14 09:41:37,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:37,397 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-10-14 09:41:37,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:41:37,650 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 471 proven. 36 refuted. 0 times theorem prover too weak. 417 trivial. 0 not checked. [2024-10-14 09:41:37,650 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:41:37,972 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 27 proven. 36 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-14 09:41:37,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:41:37,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1691588744] [2024-10-14 09:41:37,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1691588744] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:41:37,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 09:41:37,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2024-10-14 09:41:37,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375952989] [2024-10-14 09:41:37,973 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 09:41:37,974 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-14 09:41:37,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:41:37,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-14 09:41:37,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-14 09:41:37,978 INFO L87 Difference]: Start difference. First operand 113 states and 171 transitions. Second operand has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-14 09:41:39,991 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:41:40,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:41:40,087 INFO L93 Difference]: Finished difference Result 197 states and 289 transitions. [2024-10-14 09:41:40,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-14 09:41:40,088 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 145 [2024-10-14 09:41:40,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:41:40,090 INFO L225 Difference]: With dead ends: 197 [2024-10-14 09:41:40,090 INFO L226 Difference]: Without dead ends: 128 [2024-10-14 09:41:40,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-10-14 09:41:40,096 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 74 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2024-10-14 09:41:40,096 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 168 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2024-10-14 09:41:40,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-14 09:41:40,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 120. [2024-10-14 09:41:40,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 71 states have internal predecessors, (85), 44 states have call successors, (44), 4 states have call predecessors, (44), 4 states have return successors, (44), 44 states have call predecessors, (44), 44 states have call successors, (44) [2024-10-14 09:41:40,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 173 transitions. [2024-10-14 09:41:40,129 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 173 transitions. Word has length 145 [2024-10-14 09:41:40,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:41:40,132 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 173 transitions. [2024-10-14 09:41:40,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.714285714285714) internal successors, (47), 7 states have internal predecessors, (47), 2 states have call successors, (34), 2 states have call predecessors, (34), 4 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2024-10-14 09:41:40,133 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 173 transitions. [2024-10-14 09:41:40,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-14 09:41:40,135 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:41:40,135 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:41:40,159 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 (5)] Forceful destruction successful, exit code 0 [2024-10-14 09:41:40,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:41:40,336 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:41:40,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:41:40,337 INFO L85 PathProgramCache]: Analyzing trace with hash 340757725, now seen corresponding path program 1 times [2024-10-14 09:41:40,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:41:40,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [98999174] [2024-10-14 09:41:40,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:41:40,337 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:41:40,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:41:40,339 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:41:40,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-10-14 09:41:40,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:40,656 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-10-14 09:41:40,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-14 09:41:41,481 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 494 proven. 60 refuted. 0 times theorem prover too weak. 370 trivial. 0 not checked. [2024-10-14 09:41:41,482 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-14 09:41:42,246 INFO L134 CoverageAnalysis]: Checked inductivity of 924 backedges. 30 proven. 33 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2024-10-14 09:41:42,247 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-10-14 09:41:42,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [98999174] [2024-10-14 09:41:42,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [98999174] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-14 09:41:42,247 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-14 09:41:42,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8] total 17 [2024-10-14 09:41:42,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589094291] [2024-10-14 09:41:42,248 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-14 09:41:42,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-14 09:41:42,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-10-14 09:41:42,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-14 09:41:42,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2024-10-14 09:41:42,250 INFO L87 Difference]: Start difference. First operand 120 states and 173 transitions. Second operand has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 16 states have internal predecessors, (74), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-10-14 09:41:44,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:41:46,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result INVALID. Formula has sorts [Bool, FloatingPoint, RoundingMode, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2024-10-14 09:41:47,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-14 09:41:47,037 INFO L93 Difference]: Finished difference Result 259 states and 351 transitions. [2024-10-14 09:41:47,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-14 09:41:47,038 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 16 states have internal predecessors, (74), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) Word has length 145 [2024-10-14 09:41:47,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-14 09:41:47,040 INFO L225 Difference]: With dead ends: 259 [2024-10-14 09:41:47,041 INFO L226 Difference]: Without dead ends: 187 [2024-10-14 09:41:47,041 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 295 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=171, Invalid=381, Unknown=0, NotChecked=0, Total=552 [2024-10-14 09:41:47,042 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 237 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2024-10-14 09:41:47,042 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 309 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2024-10-14 09:41:47,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2024-10-14 09:41:47,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 165. [2024-10-14 09:41:47,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 104 states have internal predecessors, (117), 52 states have call successors, (52), 9 states have call predecessors, (52), 9 states have return successors, (52), 51 states have call predecessors, (52), 52 states have call successors, (52) [2024-10-14 09:41:47,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 221 transitions. [2024-10-14 09:41:47,070 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 221 transitions. Word has length 145 [2024-10-14 09:41:47,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-14 09:41:47,071 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 221 transitions. [2024-10-14 09:41:47,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.352941176470588) internal successors, (74), 16 states have internal predecessors, (74), 4 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 4 states have call predecessors, (34), 4 states have call successors, (34) [2024-10-14 09:41:47,072 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 221 transitions. [2024-10-14 09:41:47,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2024-10-14 09:41:47,075 INFO L207 NwaCegarLoop]: Found error trace [2024-10-14 09:41:47,075 INFO L215 NwaCegarLoop]: trace histogram [22, 22, 22, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-14 09:41:47,093 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 (6)] Ended with exit code 0 [2024-10-14 09:41:47,275 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:41:47,276 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-14 09:41:47,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-14 09:41:47,277 INFO L85 PathProgramCache]: Analyzing trace with hash 342604767, now seen corresponding path program 1 times [2024-10-14 09:41:47,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-10-14 09:41:47,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [947908862] [2024-10-14 09:41:47,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-14 09:41:47,277 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-10-14 09:41:47,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-10-14 09:41:47,278 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-10-14 09:41:47,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-10-14 09:41:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-14 09:41:47,676 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-14 09:41:47,682 INFO L278 TraceCheckSpWp]: Computing forward predicates...