./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-8.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 551b0097 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-8.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 6e4478c61eea43d9784f313f7c236e7053a2a6d056bacda633ebdbec5790a68f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:32:01,066 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:32:01,122 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 10:32:01,129 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:32:01,129 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:32:01,143 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:32:01,144 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:32:01,144 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:32:01,144 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:32:01,144 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:32:01,144 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:32:01,144 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:32:01,144 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:32:01,145 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:32:01,145 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:32:01,145 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:32:01,145 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:32:01,145 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:32:01,145 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 10:32:01,145 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:32:01,145 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:32:01,145 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:32:01,145 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:32:01,146 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:32:01,146 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:32:01,146 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:32:01,146 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:32:01,146 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:32:01,146 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:32:01,146 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:32:01,146 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:32:01,146 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:32:01,146 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:32:01,146 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:32:01,147 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:32:01,147 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:32:01,147 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:32:01,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:32:01,147 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:32:01,147 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:32:01,147 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:32:01,147 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:32:01,147 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 10:32:01,147 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 10:32:01,147 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:32:01,147 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:32:01,147 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:32:01,148 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:32:01,148 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 6e4478c61eea43d9784f313f7c236e7053a2a6d056bacda633ebdbec5790a68f [2025-01-09 10:32:01,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:32:01,320 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:32:01,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:32:01,321 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:32:01,322 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:32:01,322 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-8.i [2025-01-09 10:32:02,439 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/11b5be1b2/724799ef20614aa19b389a4e8276bd5d/FLAGde940476e [2025-01-09 10:32:02,664 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:32:02,665 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-8.i [2025-01-09 10:32:02,682 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/11b5be1b2/724799ef20614aa19b389a4e8276bd5d/FLAGde940476e [2025-01-09 10:32:02,999 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/11b5be1b2/724799ef20614aa19b389a4e8276bd5d [2025-01-09 10:32:03,001 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:32:03,002 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:32:03,007 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:32:03,007 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:32:03,010 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:32:03,013 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:32:03" (1/1) ... [2025-01-09 10:32:03,014 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ad74007 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:03, skipping insertion in model container [2025-01-09 10:32:03,014 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:32:03" (1/1) ... [2025-01-09 10:32:03,043 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:32:03,191 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-8.i[918,931] [2025-01-09 10:32:03,263 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:32:03,277 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:32:03,286 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-8.i[918,931] [2025-01-09 10:32:03,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:32:03,344 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:32:03,347 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:03 WrapperNode [2025-01-09 10:32:03,347 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:32:03,348 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:32:03,349 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:32:03,349 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:32:03,353 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:03" (1/1) ... [2025-01-09 10:32:03,359 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:03" (1/1) ... [2025-01-09 10:32:03,384 INFO L138 Inliner]: procedures = 26, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 179 [2025-01-09 10:32:03,384 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:32:03,385 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:32:03,385 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:32:03,385 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:32:03,395 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:03" (1/1) ... [2025-01-09 10:32:03,395 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:03" (1/1) ... [2025-01-09 10:32:03,397 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:03" (1/1) ... [2025-01-09 10:32:03,410 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]. [2025-01-09 10:32:03,410 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:03" (1/1) ... [2025-01-09 10:32:03,410 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:03" (1/1) ... [2025-01-09 10:32:03,417 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:03" (1/1) ... [2025-01-09 10:32:03,417 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:03" (1/1) ... [2025-01-09 10:32:03,419 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:03" (1/1) ... [2025-01-09 10:32:03,421 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:03" (1/1) ... [2025-01-09 10:32:03,422 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:03" (1/1) ... [2025-01-09 10:32:03,424 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:32:03,425 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:32:03,425 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:32:03,425 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:32:03,426 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:03" (1/1) ... [2025-01-09 10:32:03,429 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:32:03,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:32:03,448 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:32:03,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 10:32:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:32:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:32:03,467 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:32:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 10:32:03,467 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:32:03,467 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:32:03,524 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:32:03,525 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:32:03,784 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 10:32:03,784 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:32:03,798 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:32:03,800 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:32:03,800 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:32:03 BoogieIcfgContainer [2025-01-09 10:32:03,800 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:32:03,803 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:32:03,804 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:32:03,807 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:32:03,807 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:32:03" (1/3) ... [2025-01-09 10:32:03,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689c1a2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:32:03, skipping insertion in model container [2025-01-09 10:32:03,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:03" (2/3) ... [2025-01-09 10:32:03,808 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@689c1a2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:32:03, skipping insertion in model container [2025-01-09 10:32:03,808 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:32:03" (3/3) ... [2025-01-09 10:32:03,809 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-8.i [2025-01-09 10:32:03,818 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:32:03,820 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-8.i that has 2 procedures, 83 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:32:03,851 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:32:03,858 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;@4a0a25da, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:32:03,858 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:32:03,861 INFO L276 IsEmpty]: Start isEmpty. Operand has 83 states, 57 states have (on average 1.5614035087719298) internal successors, (89), 58 states have internal predecessors, (89), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 10:32:03,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 10:32:03,868 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:32:03,868 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:32:03,869 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:32:03,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:32:03,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1833890584, now seen corresponding path program 1 times [2025-01-09 10:32:03,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:32:03,877 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549507038] [2025-01-09 10:32:03,877 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:03,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:32:03,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 10:32:03,995 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 10:32:03,997 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:03,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:32:04,122 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 44 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-01-09 10:32:04,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:32:04,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549507038] [2025-01-09 10:32:04,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549507038] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:32:04,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1448914499] [2025-01-09 10:32:04,123 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:04,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:32:04,123 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:32:04,128 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:32:04,129 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-01-09 10:32:04,204 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 10:32:04,265 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 10:32:04,267 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:04,267 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:32:04,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 347 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:32:04,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:32:04,302 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 44 proven. 0 refuted. 0 times theorem prover too weak. 968 trivial. 0 not checked. [2025-01-09 10:32:04,302 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:32:04,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1448914499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:32:04,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:32:04,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 10:32:04,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699288922] [2025-01-09 10:32:04,304 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:32:04,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:32:04,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:32:04,327 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:32:04,327 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:32:04,329 INFO L87 Difference]: Start difference. First operand has 83 states, 57 states have (on average 1.5614035087719298) internal successors, (89), 58 states have internal predecessors, (89), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 10:32:04,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:32:04,357 INFO L93 Difference]: Finished difference Result 160 states and 288 transitions. [2025-01-09 10:32:04,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:32:04,359 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2025-01-09 10:32:04,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:32:04,366 INFO L225 Difference]: With dead ends: 160 [2025-01-09 10:32:04,366 INFO L226 Difference]: Without dead ends: 80 [2025-01-09 10:32:04,369 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:32:04,374 INFO L435 NwaCegarLoop]: 129 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 129 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:32:04,374 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:32:04,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2025-01-09 10:32:04,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2025-01-09 10:32:04,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 55 states have (on average 1.509090909090909) internal successors, (83), 55 states have internal predecessors, (83), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 10:32:04,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 129 transitions. [2025-01-09 10:32:04,410 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 129 transitions. Word has length 150 [2025-01-09 10:32:04,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:32:04,410 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 129 transitions. [2025-01-09 10:32:04,411 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 20.0) internal successors, (40), 2 states have internal predecessors, (40), 2 states have call successors, (23), 2 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 10:32:04,411 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 129 transitions. [2025-01-09 10:32:04,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 10:32:04,412 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:32:04,413 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:32:04,420 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-01-09 10:32:04,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2025-01-09 10:32:04,613 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:32:04,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:32:04,614 INFO L85 PathProgramCache]: Analyzing trace with hash 1339828766, now seen corresponding path program 1 times [2025-01-09 10:32:04,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:32:04,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246780634] [2025-01-09 10:32:04,614 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:04,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:32:04,636 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 10:32:04,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 10:32:04,723 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:04,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:32:05,237 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 10:32:05,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:32:05,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246780634] [2025-01-09 10:32:05,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246780634] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:32:05,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:32:05,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:32:05,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1710175945] [2025-01-09 10:32:05,237 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:32:05,240 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:32:05,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:32:05,240 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:32:05,241 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:32:05,241 INFO L87 Difference]: Start difference. First operand 80 states and 129 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 10:32:05,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:32:05,321 INFO L93 Difference]: Finished difference Result 234 states and 381 transitions. [2025-01-09 10:32:05,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:32:05,323 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 150 [2025-01-09 10:32:05,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:32:05,325 INFO L225 Difference]: With dead ends: 234 [2025-01-09 10:32:05,327 INFO L226 Difference]: Without dead ends: 157 [2025-01-09 10:32:05,328 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:32:05,328 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 80 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:32:05,328 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 247 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:32:05,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-01-09 10:32:05,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 154. [2025-01-09 10:32:05,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 105 states have (on average 1.5142857142857142) internal successors, (159), 105 states have internal predecessors, (159), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 10:32:05,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 251 transitions. [2025-01-09 10:32:05,369 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 251 transitions. Word has length 150 [2025-01-09 10:32:05,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:32:05,369 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 251 transitions. [2025-01-09 10:32:05,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 10:32:05,369 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 251 transitions. [2025-01-09 10:32:05,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 10:32:05,371 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:32:05,371 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:32:05,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 10:32:05,375 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:32:05,375 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:32:05,375 INFO L85 PathProgramCache]: Analyzing trace with hash 753022752, now seen corresponding path program 1 times [2025-01-09 10:32:05,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:32:05,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [954551289] [2025-01-09 10:32:05,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:05,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:32:05,396 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 10:32:05,445 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 10:32:05,446 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:05,446 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:32:05,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 10:32:05,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:32:05,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [954551289] [2025-01-09 10:32:05,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [954551289] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:32:05,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [945017222] [2025-01-09 10:32:05,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:05,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:32:05,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:32:05,679 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:32:05,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-01-09 10:32:05,738 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 10:32:05,787 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 10:32:05,788 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:05,788 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:32:05,789 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-01-09 10:32:05,792 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:32:05,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 33 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2025-01-09 10:32:05,968 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:32:06,172 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 33 proven. 33 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 10:32:06,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [945017222] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:32:06,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:32:06,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-01-09 10:32:06,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148985286] [2025-01-09 10:32:06,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:32:06,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 10:32:06,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:32:06,175 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 10:32:06,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2025-01-09 10:32:06,176 INFO L87 Difference]: Start difference. First operand 154 states and 251 transitions. Second operand has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2025-01-09 10:32:06,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:32:06,352 INFO L93 Difference]: Finished difference Result 317 states and 509 transitions. [2025-01-09 10:32:06,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-01-09 10:32:06,353 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) Word has length 150 [2025-01-09 10:32:06,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:32:06,355 INFO L225 Difference]: With dead ends: 317 [2025-01-09 10:32:06,355 INFO L226 Difference]: Without dead ends: 166 [2025-01-09 10:32:06,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 299 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=64, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:32:06,356 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 75 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 86 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 10:32:06,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [86 Valid, 248 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 10:32:06,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2025-01-09 10:32:06,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 162. [2025-01-09 10:32:06,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 111 states have (on average 1.4504504504504505) internal successors, (161), 111 states have internal predecessors, (161), 46 states have call successors, (46), 4 states have call predecessors, (46), 4 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 10:32:06,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 253 transitions. [2025-01-09 10:32:06,380 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 253 transitions. Word has length 150 [2025-01-09 10:32:06,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:32:06,380 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 253 transitions. [2025-01-09 10:32:06,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.625) internal successors, (61), 8 states have internal predecessors, (61), 3 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (46), 3 states have call predecessors, (46), 3 states have call successors, (46) [2025-01-09 10:32:06,380 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 253 transitions. [2025-01-09 10:32:06,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2025-01-09 10:32:06,382 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:32:06,382 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:32:06,388 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-01-09 10:32:06,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:32:06,586 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:32:06,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:32:06,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1449968008, now seen corresponding path program 1 times [2025-01-09 10:32:06,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:32:06,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816008699] [2025-01-09 10:32:06,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:06,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:32:06,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 10:32:06,632 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 10:32:06,633 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:06,633 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:32:06,854 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 10:32:06,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:32:06,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816008699] [2025-01-09 10:32:06,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816008699] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:32:06,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1614020406] [2025-01-09 10:32:06,854 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:06,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:32:06,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:32:06,858 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:32:06,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-01-09 10:32:06,903 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 151 statements into 1 equivalence classes. [2025-01-09 10:32:06,990 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 151 of 151 statements. [2025-01-09 10:32:06,990 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:06,990 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:32:06,993 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-01-09 10:32:06,995 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:32:07,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 148 proven. 3 refuted. 0 times theorem prover too weak. 861 trivial. 0 not checked. [2025-01-09 10:32:07,041 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:32:07,173 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 63 proven. 3 refuted. 0 times theorem prover too weak. 946 trivial. 0 not checked. [2025-01-09 10:32:07,173 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1614020406] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 10:32:07,173 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 10:32:07,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2025-01-09 10:32:07,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984791062] [2025-01-09 10:32:07,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 10:32:07,174 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-01-09 10:32:07,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:32:07,174 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-01-09 10:32:07,175 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2025-01-09 10:32:07,175 INFO L87 Difference]: Start difference. First operand 162 states and 253 transitions. Second operand has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-01-09 10:32:07,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:32:07,763 INFO L93 Difference]: Finished difference Result 646 states and 972 transitions. [2025-01-09 10:32:07,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-01-09 10:32:07,764 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) Word has length 151 [2025-01-09 10:32:07,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:32:07,767 INFO L225 Difference]: With dead ends: 646 [2025-01-09 10:32:07,767 INFO L226 Difference]: Without dead ends: 487 [2025-01-09 10:32:07,768 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 131 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=233, Invalid=523, Unknown=0, NotChecked=0, Total=756 [2025-01-09 10:32:07,768 INFO L435 NwaCegarLoop]: 149 mSDtfsCounter, 427 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 448 mSolverCounterSat, 136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 471 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 136 IncrementalHoareTripleChecker+Valid, 448 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 10:32:07,768 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [471 Valid, 554 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [136 Valid, 448 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 10:32:07,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 487 states. [2025-01-09 10:32:07,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 487 to 335. [2025-01-09 10:32:07,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 228 states have (on average 1.4035087719298245) internal successors, (320), 230 states have internal predecessors, (320), 92 states have call successors, (92), 14 states have call predecessors, (92), 14 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2025-01-09 10:32:07,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 504 transitions. [2025-01-09 10:32:07,828 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 504 transitions. Word has length 151 [2025-01-09 10:32:07,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:32:07,828 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 504 transitions. [2025-01-09 10:32:07,828 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 11 states have internal predecessors, (70), 3 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (26), 3 states have call predecessors, (26), 3 states have call successors, (26) [2025-01-09 10:32:07,828 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 504 transitions. [2025-01-09 10:32:07,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 10:32:07,830 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:32:07,830 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:32:07,836 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-01-09 10:32:08,034 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:32:08,034 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:32:08,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:32:08,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1088285618, now seen corresponding path program 1 times [2025-01-09 10:32:08,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:32:08,035 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592654401] [2025-01-09 10:32:08,035 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:08,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:32:08,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 10:32:08,088 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 10:32:08,089 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:08,089 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:32:08,681 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 177 proven. 51 refuted. 0 times theorem prover too weak. 784 trivial. 0 not checked. [2025-01-09 10:32:08,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:32:08,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592654401] [2025-01-09 10:32:08,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1592654401] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:32:08,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [646146220] [2025-01-09 10:32:08,682 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:08,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:32:08,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:32:08,685 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:32:08,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-01-09 10:32:08,731 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 10:32:09,002 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 10:32:09,002 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:09,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:32:09,007 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-01-09 10:32:09,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:32:09,832 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 602 proven. 66 refuted. 0 times theorem prover too weak. 344 trivial. 0 not checked. [2025-01-09 10:32:09,832 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:32:10,210 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [646146220] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:32:10,210 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 10:32:10,210 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 19] total 27 [2025-01-09 10:32:10,210 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505333382] [2025-01-09 10:32:10,210 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 10:32:10,210 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-01-09 10:32:10,210 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:32:10,211 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-01-09 10:32:10,211 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=742, Unknown=0, NotChecked=0, Total=870 [2025-01-09 10:32:10,211 INFO L87 Difference]: Start difference. First operand 335 states and 504 transitions. Second operand has 27 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 24 states have internal predecessors, (92), 12 states have call successors, (46), 6 states have call predecessors, (46), 8 states have return successors, (46), 12 states have call predecessors, (46), 12 states have call successors, (46) [2025-01-09 10:32:12,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:32:12,786 INFO L93 Difference]: Finished difference Result 1646 states and 2335 transitions. [2025-01-09 10:32:12,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2025-01-09 10:32:12,786 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 24 states have internal predecessors, (92), 12 states have call successors, (46), 6 states have call predecessors, (46), 8 states have return successors, (46), 12 states have call predecessors, (46), 12 states have call successors, (46) Word has length 152 [2025-01-09 10:32:12,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:32:12,796 INFO L225 Difference]: With dead ends: 1646 [2025-01-09 10:32:12,796 INFO L226 Difference]: Without dead ends: 1314 [2025-01-09 10:32:12,803 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 242 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1229 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=1017, Invalid=3675, Unknown=0, NotChecked=0, Total=4692 [2025-01-09 10:32:12,803 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 1085 mSDsluCounter, 1041 mSDsCounter, 0 mSdLazyCounter, 1702 mSolverCounterSat, 526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1098 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 2228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 526 IncrementalHoareTripleChecker+Valid, 1702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:32:12,804 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1098 Valid, 1178 Invalid, 2228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [526 Valid, 1702 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-01-09 10:32:12,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2025-01-09 10:32:12,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1086. [2025-01-09 10:32:12,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 773 states have (on average 1.3544631306597672) internal successors, (1047), 781 states have internal predecessors, (1047), 236 states have call successors, (236), 76 states have call predecessors, (236), 76 states have return successors, (236), 228 states have call predecessors, (236), 236 states have call successors, (236) [2025-01-09 10:32:12,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1519 transitions. [2025-01-09 10:32:12,898 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1519 transitions. Word has length 152 [2025-01-09 10:32:12,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:32:12,898 INFO L471 AbstractCegarLoop]: Abstraction has 1086 states and 1519 transitions. [2025-01-09 10:32:12,899 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 3.5384615384615383) internal successors, (92), 24 states have internal predecessors, (92), 12 states have call successors, (46), 6 states have call predecessors, (46), 8 states have return successors, (46), 12 states have call predecessors, (46), 12 states have call successors, (46) [2025-01-09 10:32:12,899 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1519 transitions. [2025-01-09 10:32:12,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 10:32:12,900 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:32:12,900 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:32:12,914 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-01-09 10:32:13,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:32:13,101 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:32:13,101 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:32:13,102 INFO L85 PathProgramCache]: Analyzing trace with hash -905859088, now seen corresponding path program 1 times [2025-01-09 10:32:13,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:32:13,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1526364645] [2025-01-09 10:32:13,102 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:13,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:32:13,111 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 10:32:13,122 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 10:32:13,122 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:13,122 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:32:13,162 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 10:32:13,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:32:13,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1526364645] [2025-01-09 10:32:13,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1526364645] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:32:13,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:32:13,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 10:32:13,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697929021] [2025-01-09 10:32:13,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:32:13,163 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:32:13,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:32:13,164 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:32:13,164 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:32:13,164 INFO L87 Difference]: Start difference. First operand 1086 states and 1519 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 10:32:13,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:32:13,328 INFO L93 Difference]: Finished difference Result 2530 states and 3564 transitions. [2025-01-09 10:32:13,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:32:13,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 152 [2025-01-09 10:32:13,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:32:13,338 INFO L225 Difference]: With dead ends: 2530 [2025-01-09 10:32:13,338 INFO L226 Difference]: Without dead ends: 1447 [2025-01-09 10:32:13,341 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:32:13,342 INFO L435 NwaCegarLoop]: 155 mSDtfsCounter, 62 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:32:13,342 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 265 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:32:13,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1447 states. [2025-01-09 10:32:13,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1447 to 1437. [2025-01-09 10:32:13,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1437 states, 1056 states have (on average 1.3409090909090908) internal successors, (1416), 1072 states have internal predecessors, (1416), 292 states have call successors, (292), 88 states have call predecessors, (292), 88 states have return successors, (292), 276 states have call predecessors, (292), 292 states have call successors, (292) [2025-01-09 10:32:13,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1437 states to 1437 states and 2000 transitions. [2025-01-09 10:32:13,506 INFO L78 Accepts]: Start accepts. Automaton has 1437 states and 2000 transitions. Word has length 152 [2025-01-09 10:32:13,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:32:13,507 INFO L471 AbstractCegarLoop]: Abstraction has 1437 states and 2000 transitions. [2025-01-09 10:32:13,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 10:32:13,507 INFO L276 IsEmpty]: Start isEmpty. Operand 1437 states and 2000 transitions. [2025-01-09 10:32:13,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 10:32:13,509 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:32:13,509 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:32:13,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 10:32:13,510 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:32:13,510 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:32:13,510 INFO L85 PathProgramCache]: Analyzing trace with hash -597821520, now seen corresponding path program 1 times [2025-01-09 10:32:13,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:32:13,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247097191] [2025-01-09 10:32:13,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:13,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:32:13,519 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 10:32:13,552 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 10:32:13,552 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:13,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:32:13,748 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 120 proven. 6 refuted. 0 times theorem prover too weak. 886 trivial. 0 not checked. [2025-01-09 10:32:13,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 10:32:13,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247097191] [2025-01-09 10:32:13,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247097191] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:32:13,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1561150945] [2025-01-09 10:32:13,749 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:13,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:32:13,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:32:13,753 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:32:13,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-01-09 10:32:13,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 10:32:13,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 10:32:13,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:13,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:32:13,940 INFO L256 TraceCheckSpWp]: Trace formula consists of 345 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-01-09 10:32:13,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:32:14,105 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 232 proven. 0 refuted. 0 times theorem prover too weak. 780 trivial. 0 not checked. [2025-01-09 10:32:14,106 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:32:14,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1561150945] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:32:14,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 10:32:14,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [7] total 14 [2025-01-09 10:32:14,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826679805] [2025-01-09 10:32:14,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:32:14,106 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-01-09 10:32:14,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 10:32:14,106 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-01-09 10:32:14,107 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-01-09 10:32:14,107 INFO L87 Difference]: Start difference. First operand 1437 states and 2000 transitions. Second operand has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 10:32:14,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:32:14,781 INFO L93 Difference]: Finished difference Result 3232 states and 4375 transitions. [2025-01-09 10:32:14,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-01-09 10:32:14,783 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) Word has length 152 [2025-01-09 10:32:14,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:32:14,790 INFO L225 Difference]: With dead ends: 3232 [2025-01-09 10:32:14,790 INFO L226 Difference]: Without dead ends: 1798 [2025-01-09 10:32:14,793 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 197 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=229, Invalid=701, Unknown=0, NotChecked=0, Total=930 [2025-01-09 10:32:14,794 INFO L435 NwaCegarLoop]: 165 mSDtfsCounter, 305 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 128 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 326 SdHoareTripleChecker+Valid, 604 SdHoareTripleChecker+Invalid, 643 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 128 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 10:32:14,794 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [326 Valid, 604 Invalid, 643 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [128 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 10:32:14,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1798 states. [2025-01-09 10:32:14,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1798 to 981. [2025-01-09 10:32:14,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 981 states, 752 states have (on average 1.3670212765957446) internal successors, (1028), 760 states have internal predecessors, (1028), 172 states have call successors, (172), 56 states have call predecessors, (172), 56 states have return successors, (172), 164 states have call predecessors, (172), 172 states have call successors, (172) [2025-01-09 10:32:14,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 981 states to 981 states and 1372 transitions. [2025-01-09 10:32:14,904 INFO L78 Accepts]: Start accepts. Automaton has 981 states and 1372 transitions. Word has length 152 [2025-01-09 10:32:14,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:32:14,904 INFO L471 AbstractCegarLoop]: Abstraction has 981 states and 1372 transitions. [2025-01-09 10:32:14,904 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.083333333333333) internal successors, (49), 11 states have internal predecessors, (49), 3 states have call successors, (23), 3 states have call predecessors, (23), 4 states have return successors, (23), 4 states have call predecessors, (23), 3 states have call successors, (23) [2025-01-09 10:32:14,904 INFO L276 IsEmpty]: Start isEmpty. Operand 981 states and 1372 transitions. [2025-01-09 10:32:14,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2025-01-09 10:32:14,905 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:32:14,905 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:32:14,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-01-09 10:32:15,110 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:32:15,110 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:32:15,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:32:15,110 INFO L85 PathProgramCache]: Analyzing trace with hash 965078936, now seen corresponding path program 1 times [2025-01-09 10:32:15,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 10:32:15,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [679660515] [2025-01-09 10:32:15,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:15,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 10:32:15,124 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 10:32:15,166 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 10:32:15,167 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:15,167 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 10:32:15,169 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1462714180] [2025-01-09 10:32:15,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:15,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 10:32:15,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:32:15,170 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-01-09 10:32:15,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-01-09 10:32:15,215 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 10:32:15,249 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 10:32:15,249 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:15,249 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 10:32:15,249 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 10:32:15,261 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 152 statements into 1 equivalence classes. [2025-01-09 10:32:15,279 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 152 of 152 statements. [2025-01-09 10:32:15,279 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:15,279 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 10:32:15,353 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 10:32:15,353 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 10:32:15,354 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 10:32:15,362 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-01-09 10:32:15,559 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-01-09 10:32:15,562 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:32:15,658 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 10:32:15,661 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 10:32:15 BoogieIcfgContainer [2025-01-09 10:32:15,662 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 10:32:15,663 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 10:32:15,663 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 10:32:15,663 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 10:32:15,663 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:32:03" (3/4) ... [2025-01-09 10:32:15,665 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 10:32:15,665 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 10:32:15,668 INFO L158 Benchmark]: Toolchain (without parser) took 12665.65ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 109.3MB in the beginning and 333.5MB in the end (delta: -224.2MB). Peak memory consumption was 112.3MB. Max. memory is 16.1GB. [2025-01-09 10:32:15,668 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 226.5MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 10:32:15,668 INFO L158 Benchmark]: CACSL2BoogieTranslator took 340.33ms. Allocated memory is still 142.6MB. Free memory was 109.3MB in the beginning and 94.4MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 10:32:15,668 INFO L158 Benchmark]: Boogie Procedure Inliner took 36.79ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 88.3MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 10:32:15,668 INFO L158 Benchmark]: Boogie Preprocessor took 39.53ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 81.0MB in the end (delta: 7.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 10:32:15,669 INFO L158 Benchmark]: RCFGBuilder took 375.52ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 50.1MB in the end (delta: 30.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-01-09 10:32:15,669 INFO L158 Benchmark]: TraceAbstraction took 11858.89ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 50.1MB in the beginning and 333.7MB in the end (delta: -283.5MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. [2025-01-09 10:32:15,669 INFO L158 Benchmark]: Witness Printer took 2.72ms. Allocated memory is still 478.2MB. Free memory was 333.7MB in the beginning and 333.5MB in the end (delta: 147.5kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 10:32:15,670 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.14ms. Allocated memory is still 226.5MB. Free memory is still 147.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 340.33ms. Allocated memory is still 142.6MB. Free memory was 109.3MB in the beginning and 94.4MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 36.79ms. Allocated memory is still 142.6MB. Free memory was 94.4MB in the beginning and 88.3MB in the end (delta: 6.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 39.53ms. Allocated memory is still 142.6MB. Free memory was 88.3MB in the beginning and 81.0MB in the end (delta: 7.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 375.52ms. Allocated memory is still 142.6MB. Free memory was 81.0MB in the beginning and 50.1MB in the end (delta: 30.9MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11858.89ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 50.1MB in the beginning and 333.7MB in the end (delta: -283.5MB). Peak memory consumption was 53.5MB. Max. memory is 16.1GB. * Witness Printer took 2.72ms. Allocated memory is still 478.2MB. Free memory was 333.7MB in the beginning and 333.5MB in the end (delta: 147.5kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 143, overapproximation of someBinaryFLOATComparisonOperation at line 145, overapproximation of someBinaryFLOATComparisonOperation at line 178, overapproximation of someBinaryFLOATComparisonOperation at line 71, overapproximation of someBinaryDOUBLEComparisonOperation at line 84, overapproximation of someBinaryDOUBLEComparisonOperation at line 148, overapproximation of someBinaryDOUBLEComparisonOperation at line 74, overapproximation of someBinaryDOUBLEComparisonOperation at line 178, overapproximation of someBinaryDOUBLEComparisonOperation at line 147, overapproximation of someBinaryDOUBLEComparisonOperation at line 55, overapproximation of someBinaryArithmeticFLOAToperation at line 53. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] float var_1_1 = 999999999.675; [L23] signed long int var_1_4 = -5; [L24] float var_1_5 = 7.875; [L25] float var_1_6 = 99.04; [L26] signed long int var_1_7 = -2; [L27] unsigned long int var_1_9 = 1; [L28] double var_1_10 = 63.25; [L29] unsigned char var_1_11 = 0; [L30] unsigned short int var_1_13 = 0; [L31] unsigned short int var_1_15 = 17766; [L32] unsigned short int var_1_16 = 28149; [L33] unsigned char var_1_19 = 4; [L34] unsigned char var_1_20 = 50; [L35] unsigned char var_1_21 = 64; [L36] unsigned char var_1_22 = 50; [L37] unsigned char var_1_23 = 5; [L38] unsigned char var_1_24 = 128; [L39] signed long int var_1_25 = -16; [L40] unsigned char var_1_26 = 0; [L41] signed short int var_1_27 = -4; [L42] unsigned short int var_1_33 = 2; [L43] signed long int var_1_36 = -1; [L44] float var_1_38 = 256.7; [L45] unsigned long int var_1_40 = 10; [L46] double var_1_42 = 100.5; [L47] signed char var_1_45 = 8; [L48] unsigned short int last_1_var_1_13 = 0; VAL [isInitial=0, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-5, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L182] isInitial = 1 [L183] FCALL initially() [L185] CALL updateLastVariables() [L175] last_1_var_1_13 = var_1_13 VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-5, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L185] RET updateLastVariables() [L186] CALL updateVariables() [L138] var_1_4 = __VERIFIER_nondet_long() [L139] CALL assume_abort_if_not(var_1_4 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L139] RET assume_abort_if_not(var_1_4 >= -2147483648) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L140] CALL assume_abort_if_not(var_1_4 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L140] RET assume_abort_if_not(var_1_4 <= 2147483647) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L141] CALL assume_abort_if_not(var_1_4 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L141] RET assume_abort_if_not(var_1_4 != 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=63/8, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L142] var_1_5 = __VERIFIER_nondet_float() [L143] CALL assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L143] RET assume_abort_if_not((var_1_5 >= 0.0F && var_1_5 <= -1.0e-20F) || (var_1_5 <= 9223372.036854765600e+12F && var_1_5 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_6=2476/25, var_1_7=-2, var_1_9=1] [L144] var_1_6 = __VERIFIER_nondet_float() [L145] CALL assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L145] RET assume_abort_if_not((var_1_6 >= 0.0F && var_1_6 <= -1.0e-20F) || (var_1_6 <= 9223372.036854765600e+12F && var_1_6 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_10=253/4, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L146] var_1_10 = __VERIFIER_nondet_double() [L147] CALL assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L147] RET assume_abort_if_not((var_1_10 >= -922337.2036854776000e+13F && var_1_10 <= -1.0e-20F) || (var_1_10 <= 9223372.036854776000e+12F && var_1_10 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L148] CALL assume_abort_if_not(var_1_10 != 0.0F) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L148] RET assume_abort_if_not(var_1_10 != 0.0F) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L149] var_1_11 = __VERIFIER_nondet_uchar() [L150] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L150] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L151] CALL assume_abort_if_not(var_1_11 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L151] RET assume_abort_if_not(var_1_11 <= 1) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=17766, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L152] var_1_15 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_15 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L153] RET assume_abort_if_not(var_1_15 >= 16383) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L154] CALL assume_abort_if_not(var_1_15 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L154] RET assume_abort_if_not(var_1_15 <= 32767) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=28149, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L155] var_1_16 = __VERIFIER_nondet_ushort() [L156] CALL assume_abort_if_not(var_1_16 >= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L156] RET assume_abort_if_not(var_1_16 >= 16383) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L157] CALL assume_abort_if_not(var_1_16 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L157] RET assume_abort_if_not(var_1_16 <= 32767) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=50, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L158] var_1_20 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_20 >= 32) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L159] RET assume_abort_if_not(var_1_20 >= 32) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L160] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L160] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L161] var_1_21 = __VERIFIER_nondet_uchar() [L162] CALL assume_abort_if_not(var_1_21 >= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L162] RET assume_abort_if_not(var_1_21 >= 64) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L163] CALL assume_abort_if_not(var_1_21 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L163] RET assume_abort_if_not(var_1_21 <= 127) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_22=50, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L164] var_1_22 = __VERIFIER_nondet_uchar() [L165] CALL assume_abort_if_not(var_1_22 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L165] RET assume_abort_if_not(var_1_22 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L166] CALL assume_abort_if_not(var_1_22 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L166] RET assume_abort_if_not(var_1_22 <= 64) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=5, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L167] var_1_23 = __VERIFIER_nondet_uchar() [L168] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L168] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L169] CALL assume_abort_if_not(var_1_23 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L169] RET assume_abort_if_not(var_1_23 <= 63) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=128, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L170] var_1_24 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_24 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L171] RET assume_abort_if_not(var_1_24 >= 127) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L172] CALL assume_abort_if_not(var_1_24 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L172] RET assume_abort_if_not(var_1_24 <= 254) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_1=39999999987/40, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L186] RET updateVariables() [L187] CALL step() [L52] COND TRUE last_1_var_1_13 == (last_1_var_1_13 % var_1_4) [L53] var_1_1 = (var_1_5 - var_1_6) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=4, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L55] COND FALSE !(var_1_10 == var_1_1) [L62] var_1_19 = var_1_24 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=127, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L64] COND FALSE !(var_1_19 < (var_1_21 / var_1_20)) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=127, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L71] COND FALSE !(var_1_1 >= var_1_6) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=127, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L74] COND FALSE !(((var_1_6 * var_1_5) / var_1_10) > var_1_1) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=127, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L81] COND FALSE !(var_1_7 < var_1_9) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=127, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=127, var_1_25=-16, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L84] COND FALSE !((25.3 * var_1_5) != var_1_1) [L93] var_1_25 = var_1_20 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=127, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=127, var_1_25=32, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L95] COND TRUE var_1_16 != (var_1_24 + var_1_21) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=127, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=127, var_1_25=32, var_1_26=0, var_1_27=-4, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L96] COND TRUE \read(var_1_11) [L97] var_1_27 = ((((var_1_19) < 0 ) ? -(var_1_19) : (var_1_19))) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=127, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=127, var_1_25=32, var_1_26=0, var_1_27=127, var_1_33=2, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L102] COND TRUE \read(var_1_11) [L103] var_1_33 = ((((var_1_16) > (var_1_26)) ? (var_1_16) : (var_1_26))) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=127, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=127, var_1_25=32, var_1_26=0, var_1_27=127, var_1_33=16383, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L105] COND TRUE 16 < var_1_19 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=127, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=127, var_1_25=32, var_1_26=0, var_1_27=127, var_1_33=16383, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L106] COND FALSE !(var_1_23 <= var_1_4) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=127, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=127, var_1_25=32, var_1_26=0, var_1_27=127, var_1_33=16383, var_1_36=-1, var_1_38=2567/10, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_7=-2, var_1_9=1] [L112] var_1_38 = var_1_5 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=127, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=127, var_1_25=32, var_1_26=0, var_1_27=127, var_1_33=16383, var_1_36=-1, var_1_38=2, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=2, var_1_7=-2, var_1_9=1] [L113] COND FALSE !(var_1_20 <= var_1_22) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=127, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=127, var_1_25=32, var_1_26=0, var_1_27=127, var_1_33=16383, var_1_36=-1, var_1_38=2, var_1_40=10, var_1_42=201/2, var_1_45=8, var_1_4=-1, var_1_5=2, var_1_7=-2, var_1_9=1] [L120] COND TRUE var_1_24 < ((((((((var_1_15) > (var_1_20)) ? (var_1_15) : (var_1_20)))) > (var_1_15)) ? (((((var_1_15) > (var_1_20)) ? (var_1_15) : (var_1_20)))) : (var_1_15))) [L121] var_1_42 = var_1_6 VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=127, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=127, var_1_25=32, var_1_26=0, var_1_27=127, var_1_33=16383, var_1_36=-1, var_1_38=2, var_1_40=10, var_1_42=3, var_1_45=8, var_1_4=-1, var_1_5=2, var_1_6=3, var_1_7=-2, var_1_9=1] [L131] COND TRUE (var_1_23 % var_1_20) < var_1_20 [L132] var_1_45 = ((var_1_20 - var_1_23) + var_1_20) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=127, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=127, var_1_25=32, var_1_26=0, var_1_27=127, var_1_33=16383, var_1_36=-1, var_1_38=2, var_1_40=10, var_1_42=3, var_1_45=64, var_1_4=-1, var_1_5=2, var_1_6=3, var_1_7=-2, var_1_9=1] [L187] RET step() [L188] CALL, EXPR property() [L178-L179] return (((((((last_1_var_1_13 == (last_1_var_1_13 % var_1_4)) ? (var_1_1 == ((float) (var_1_5 - var_1_6))) : 1) && ((var_1_1 >= var_1_6) ? (var_1_7 == ((signed long int) var_1_19)) : 1)) && ((((var_1_6 * var_1_5) / var_1_10) > var_1_1) ? (var_1_11 ? (var_1_9 == ((unsigned long int) var_1_26)) : (var_1_9 == ((unsigned long int) var_1_26))) : 1)) && ((var_1_7 < var_1_9) ? (var_1_13 == ((unsigned short int) (var_1_26 + (((((var_1_15) > (var_1_16)) ? (var_1_15) : (var_1_16))) - (var_1_19 + var_1_19))))) : 1)) && ((var_1_10 == var_1_1) ? (var_1_11 ? (var_1_19 == ((unsigned char) (((32 + var_1_20) + var_1_21) - (var_1_22 + var_1_23)))) : (var_1_19 == ((unsigned char) (var_1_24 - var_1_23)))) : (var_1_19 == ((unsigned char) var_1_24)))) && (((25.3 * var_1_5) != var_1_1) ? (var_1_11 ? ((var_1_15 <= var_1_13) ? (var_1_25 == ((signed long int) var_1_26)) : 1) : (var_1_25 == ((signed long int) var_1_22))) : (var_1_25 == ((signed long int) var_1_20)))) && ((var_1_19 < (var_1_21 / var_1_20)) ? ((var_1_19 > var_1_19) ? (var_1_26 == ((unsigned char) ((((((((var_1_22) < (var_1_24)) ? (var_1_22) : (var_1_24)))) > (var_1_23)) ? (((((var_1_22) < (var_1_24)) ? (var_1_22) : (var_1_24)))) : (var_1_23))))) : (var_1_26 == ((unsigned char) var_1_22))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=127, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=127, var_1_25=32, var_1_26=0, var_1_27=127, var_1_33=16383, var_1_36=-1, var_1_38=2, var_1_40=10, var_1_42=3, var_1_45=64, var_1_4=-1, var_1_5=2, var_1_6=3, var_1_7=-2, var_1_9=1] [L188] RET, EXPR property() [L188] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=127, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=127, var_1_25=32, var_1_26=0, var_1_27=127, var_1_33=16383, var_1_36=-1, var_1_38=2, var_1_40=10, var_1_42=3, var_1_45=64, var_1_4=-1, var_1_5=2, var_1_6=3, var_1_7=-2, var_1_9=1] [L19] reach_error() VAL [isInitial=1, last_1_var_1_13=0, var_1_11=1, var_1_13=0, var_1_15=32767, var_1_16=16383, var_1_19=127, var_1_20=288, var_1_21=64, var_1_22=-255, var_1_23=0, var_1_24=127, var_1_25=32, var_1_26=0, var_1_27=127, var_1_33=16383, var_1_36=-1, var_1_38=2, var_1_40=10, var_1_42=3, var_1_45=64, var_1_4=-1, var_1_5=2, var_1_6=3, var_1_7=-2, var_1_9=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 83 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.7s, OverallIterations: 8, TraceHistogramMax: 23, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2123 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2034 mSDsluCounter, 3225 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2265 mSDsCounter, 803 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2828 IncrementalHoareTripleChecker+Invalid, 3631 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 803 mSolverCounterUnsat, 960 mSDtfsCounter, 2828 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1215 GetRequests, 1082 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1558 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1437occurred in iteration=6, InterpolantAutomatonStates: 127, 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, 7 MinimizatonAttempts, 1214 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 2116 NumberOfCodeBlocks, 2116 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2099 ConstructedInterpolants, 0 QuantifiedInterpolants, 6388 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1728 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 14 InterpolantComputations, 4 PerfectInterpolantSequences, 13893/14168 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, ConComCheckerStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2025-01-09 10:32:15,693 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-8.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 6e4478c61eea43d9784f313f7c236e7053a2a6d056bacda633ebdbec5790a68f --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 10:32:17,469 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 10:32:17,561 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 10:32:17,567 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 10:32:17,567 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 10:32:17,590 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 10:32:17,590 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 10:32:17,591 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 10:32:17,591 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 10:32:17,591 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 10:32:17,591 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 10:32:17,591 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 10:32:17,592 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 10:32:17,592 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 10:32:17,592 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 10:32:17,592 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 10:32:17,593 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 10:32:17,593 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 10:32:17,593 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 10:32:17,593 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 10:32:17,593 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 10:32:17,593 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 10:32:17,593 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 10:32:17,593 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 10:32:17,593 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 10:32:17,593 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 10:32:17,593 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 10:32:17,593 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 10:32:17,594 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 10:32:17,594 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 10:32:17,594 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 10:32:17,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:32:17,594 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:32:17,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:32:17,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:32:17,594 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 10:32:17,594 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 10:32:17,594 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 10:32:17,594 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 10:32:17,594 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:32:17,594 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 10:32:17,594 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 10:32:17,594 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 10:32:17,594 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 10:32:17,594 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 10:32:17,594 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 10:32:17,594 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 10:32:17,594 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 10:32:17,594 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 10:32:17,594 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 10:32:17,594 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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-jdk21/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 -> 6e4478c61eea43d9784f313f7c236e7053a2a6d056bacda633ebdbec5790a68f [2025-01-09 10:32:17,796 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 10:32:17,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 10:32:17,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 10:32:17,802 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 10:32:17,803 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 10:32:17,803 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-8.i [2025-01-09 10:32:19,012 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4783ebe40/4be28c27f363446598be0971755bf120/FLAG30db5fcb8 [2025-01-09 10:32:19,244 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 10:32:19,251 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-8.i [2025-01-09 10:32:19,257 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4783ebe40/4be28c27f363446598be0971755bf120/FLAG30db5fcb8 [2025-01-09 10:32:19,606 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/4783ebe40/4be28c27f363446598be0971755bf120 [2025-01-09 10:32:19,608 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 10:32:19,610 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 10:32:19,615 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 10:32:19,615 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 10:32:19,618 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 10:32:19,618 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:32:19" (1/1) ... [2025-01-09 10:32:19,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3abb5934 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:19, skipping insertion in model container [2025-01-09 10:32:19,619 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 10:32:19" (1/1) ... [2025-01-09 10:32:19,636 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 10:32:19,726 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-8.i[918,931] [2025-01-09 10:32:19,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:32:19,798 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 10:32:19,807 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-8.i[918,931] [2025-01-09 10:32:19,836 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 10:32:19,854 INFO L204 MainTranslator]: Completed translation [2025-01-09 10:32:19,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:19 WrapperNode [2025-01-09 10:32:19,855 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 10:32:19,859 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 10:32:19,859 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 10:32:19,859 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 10:32:19,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:19" (1/1) ... [2025-01-09 10:32:19,873 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:19" (1/1) ... [2025-01-09 10:32:19,908 INFO L138 Inliner]: procedures = 27, calls = 36, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 167 [2025-01-09 10:32:19,908 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 10:32:19,913 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 10:32:19,913 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 10:32:19,913 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 10:32:19,930 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:19" (1/1) ... [2025-01-09 10:32:19,930 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:19" (1/1) ... [2025-01-09 10:32:19,934 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:19" (1/1) ... [2025-01-09 10:32:19,953 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]. [2025-01-09 10:32:19,954 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:19" (1/1) ... [2025-01-09 10:32:19,954 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:19" (1/1) ... [2025-01-09 10:32:19,968 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:19" (1/1) ... [2025-01-09 10:32:19,969 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:19" (1/1) ... [2025-01-09 10:32:19,976 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:19" (1/1) ... [2025-01-09 10:32:19,978 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:19" (1/1) ... [2025-01-09 10:32:19,984 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:19" (1/1) ... [2025-01-09 10:32:19,991 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 10:32:19,992 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 10:32:19,992 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 10:32:19,992 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 10:32:19,996 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:19" (1/1) ... [2025-01-09 10:32:20,002 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 10:32:20,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 10:32:20,031 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-01-09 10:32:20,036 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-01-09 10:32:20,060 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 10:32:20,060 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 10:32:20,060 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 10:32:20,060 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 10:32:20,060 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 10:32:20,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 10:32:20,124 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 10:32:20,125 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 10:32:42,251 INFO L? ?]: Removed 8 outVars from TransFormulas that were not future-live. [2025-01-09 10:32:42,251 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 10:32:42,258 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 10:32:42,258 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 10:32:42,259 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:32:42 BoogieIcfgContainer [2025-01-09 10:32:42,259 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 10:32:42,260 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 10:32:42,260 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 10:32:42,264 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 10:32:42,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 10:32:19" (1/3) ... [2025-01-09 10:32:42,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2691d9ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:32:42, skipping insertion in model container [2025-01-09 10:32:42,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 10:32:19" (2/3) ... [2025-01-09 10:32:42,264 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2691d9ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 10:32:42, skipping insertion in model container [2025-01-09 10:32:42,264 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 10:32:42" (3/3) ... [2025-01-09 10:32:42,265 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-8.i [2025-01-09 10:32:42,275 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 10:32:42,276 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-8.i that has 2 procedures, 79 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 10:32:42,320 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 10:32:42,328 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;@7d09f346, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 10:32:42,328 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 10:32:42,331 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 54 states have internal predecessors, (82), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 10:32:42,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 10:32:42,340 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:32:42,340 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:32:42,340 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:32:42,344 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:32:42,344 INFO L85 PathProgramCache]: Analyzing trace with hash 1537377236, now seen corresponding path program 1 times [2025-01-09 10:32:42,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:32:42,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [649016697] [2025-01-09 10:32:42,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:42,353 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 [2025-01-09 10:32:42,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:32:42,357 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/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) [2025-01-09 10:32:42,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 10:32:42,434 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 10:32:43,560 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 10:32:43,561 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:43,561 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:32:43,594 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 10:32:43,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:32:43,639 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 428 proven. 0 refuted. 0 times theorem prover too weak. 584 trivial. 0 not checked. [2025-01-09 10:32:43,639 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:32:43,639 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:32:43,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [649016697] [2025-01-09 10:32:43,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [649016697] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:32:43,640 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:32:43,640 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 10:32:43,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055235256] [2025-01-09 10:32:43,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:32:43,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 10:32:43,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:32:43,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 10:32:43,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:32:43,673 INFO L87 Difference]: Start difference. First operand has 79 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 54 states have internal predecessors, (82), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 10:32:43,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:32:43,700 INFO L93 Difference]: Finished difference Result 152 states and 274 transitions. [2025-01-09 10:32:43,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 10:32:43,703 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 150 [2025-01-09 10:32:43,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:32:43,709 INFO L225 Difference]: With dead ends: 152 [2025-01-09 10:32:43,710 INFO L226 Difference]: Without dead ends: 76 [2025-01-09 10:32:43,716 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 149 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 10:32:43,718 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 10:32:43,718 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 10:32:43,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2025-01-09 10:32:43,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2025-01-09 10:32:43,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 51 states have (on average 1.4901960784313726) internal successors, (76), 51 states have internal predecessors, (76), 23 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2025-01-09 10:32:43,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 122 transitions. [2025-01-09 10:32:43,751 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 122 transitions. Word has length 150 [2025-01-09 10:32:43,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:32:43,751 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 122 transitions. [2025-01-09 10:32:43,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.0) internal successors, (42), 2 states have internal predecessors, (42), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2025-01-09 10:32:43,751 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 122 transitions. [2025-01-09 10:32:43,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 10:32:43,754 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:32:43,754 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:32:43,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2025-01-09 10:32:43,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate-jdk21/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 [2025-01-09 10:32:43,963 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:32:43,964 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:32:43,964 INFO L85 PathProgramCache]: Analyzing trace with hash 1043315418, now seen corresponding path program 1 times [2025-01-09 10:32:43,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:32:43,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2033401376] [2025-01-09 10:32:43,964 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:32:43,964 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 [2025-01-09 10:32:43,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:32:43,966 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/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) [2025-01-09 10:32:43,967 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 10:32:44,009 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 10:32:44,831 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 10:32:44,831 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:32:44,831 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:32:44,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 10:32:44,867 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:32:56,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1012 trivial. 0 not checked. [2025-01-09 10:32:56,017 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 10:32:56,017 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:32:56,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2033401376] [2025-01-09 10:32:56,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2033401376] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 10:32:56,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 10:32:56,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 10:32:56,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106077824] [2025-01-09 10:32:56,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 10:32:56,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 10:32:56,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:32:56,019 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 10:32:56,019 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:32:56,019 INFO L87 Difference]: Start difference. First operand 76 states and 122 transitions. Second operand has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 10:33:00,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.41s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:33:04,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:33:04,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 10:33:04,578 INFO L93 Difference]: Finished difference Result 222 states and 360 transitions. [2025-01-09 10:33:04,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 10:33:04,789 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) Word has length 150 [2025-01-09 10:33:04,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 10:33:04,790 INFO L225 Difference]: With dead ends: 222 [2025-01-09 10:33:04,791 INFO L226 Difference]: Without dead ends: 149 [2025-01-09 10:33:04,791 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 148 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 10:33:04,792 INFO L435 NwaCegarLoop]: 121 mSDtfsCounter, 47 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-01-09 10:33:04,792 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 234 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 2 Unknown, 0 Unchecked, 8.5s Time] [2025-01-09 10:33:04,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2025-01-09 10:33:04,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 146. [2025-01-09 10:33:04,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 97 states have (on average 1.4948453608247423) internal successors, (145), 97 states have internal predecessors, (145), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 46 states have call predecessors, (46), 46 states have call successors, (46) [2025-01-09 10:33:04,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 237 transitions. [2025-01-09 10:33:04,814 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 237 transitions. Word has length 150 [2025-01-09 10:33:04,814 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 10:33:04,814 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 237 transitions. [2025-01-09 10:33:04,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 2 states have internal predecessors, (38), 1 states have call successors, (23), 1 states have call predecessors, (23), 1 states have return successors, (23), 1 states have call predecessors, (23), 1 states have call successors, (23) [2025-01-09 10:33:04,815 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 237 transitions. [2025-01-09 10:33:04,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2025-01-09 10:33:04,816 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 10:33:04,816 INFO L218 NwaCegarLoop]: trace histogram [23, 23, 23, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 10:33:04,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 10:33:05,021 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate-jdk21/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 [2025-01-09 10:33:05,021 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 10:33:05,021 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 10:33:05,022 INFO L85 PathProgramCache]: Analyzing trace with hash 456509404, now seen corresponding path program 1 times [2025-01-09 10:33:05,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 10:33:05,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [289784346] [2025-01-09 10:33:05,022 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:33:05,022 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 [2025-01-09 10:33:05,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 10:33:05,024 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/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) [2025-01-09 10:33:05,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/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 [2025-01-09 10:33:05,052 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 10:33:06,022 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 10:33:06,023 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:33:06,023 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:33:06,060 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 10:33:06,063 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:33:13,064 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 541 proven. 60 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2025-01-09 10:33:13,064 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:33:14,188 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 10:33:14,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [289784346] [2025-01-09 10:33:14,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [289784346] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:33:14,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1403656218] [2025-01-09 10:33:14,188 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 10:33:14,191 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2025-01-09 10:33:14,191 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 [2025-01-09 10:33:14,222 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2025-01-09 10:33:14,225 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2025-01-09 10:33:14,279 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 150 statements into 1 equivalence classes. [2025-01-09 10:33:15,757 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 150 of 150 statements. [2025-01-09 10:33:15,757 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 10:33:15,757 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 10:33:15,791 INFO L256 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 10:33:15,797 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 10:33:18,495 INFO L134 CoverageAnalysis]: Checked inductivity of 1012 backedges. 528 proven. 33 refuted. 0 times theorem prover too weak. 451 trivial. 0 not checked. [2025-01-09 10:33:18,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 10:33:19,011 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1403656218] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 10:33:19,011 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 10:33:19,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 5] total 8 [2025-01-09 10:33:19,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692592655] [2025-01-09 10:33:19,011 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 10:33:19,012 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-01-09 10:33:19,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 10:33:19,013 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-01-09 10:33:19,013 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-01-09 10:33:19,013 INFO L87 Difference]: Start difference. First operand 146 states and 237 transitions. Second operand has 8 states, 8 states have (on average 8.0) internal successors, (64), 8 states have internal predecessors, (64), 3 states have call successors, (33), 3 states have call predecessors, (33), 5 states have return successors, (34), 3 states have call predecessors, (34), 3 states have call successors, (34) [2025-01-09 10:33:28,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.39s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:33:32,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2025-01-09 10:33:36,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, FloatingPoint, RoundingMode, Real, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers []