./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.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-ps-co_file-66.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 ee1d4ab2254e09ab1c7ffa7d0c8fe840fd7239014a5c1c2ca5c976023f5a71b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:08:36,949 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:08:37,009 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-01-09 12:08:37,014 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:08:37,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:08:37,032 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:08:37,033 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:08:37,033 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:08:37,034 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:08:37,034 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:08:37,035 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:08:37,035 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:08:37,035 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:08:37,035 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:08:37,035 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:08:37,036 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:08:37,036 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:08:37,036 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:08:37,036 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-01-09 12:08:37,036 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:08:37,036 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:08:37,036 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:08:37,036 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:08:37,037 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:08:37,037 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:08:37,037 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:08:37,037 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:08:37,037 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:08:37,037 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:08:37,037 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:08:37,037 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:08:37,037 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:08:37,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:08:37,038 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:08:37,038 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:08:37,038 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:08:37,038 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:08:37,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:08:37,038 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:08:37,038 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:08:37,038 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:08:37,038 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:08:37,038 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-01-09 12:08:37,038 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-01-09 12:08:37,038 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:08:37,038 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:08:37,038 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:08:37,038 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:08:37,038 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 -> ee1d4ab2254e09ab1c7ffa7d0c8fe840fd7239014a5c1c2ca5c976023f5a71b5 [2025-01-09 12:08:37,293 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:08:37,302 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:08:37,304 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:08:37,306 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:08:37,306 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:08:37,308 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-ps-co_file-66.i [2025-01-09 12:08:38,508 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b68b7de0c/06f7022457584b84af99e542f04206ec/FLAGacf6cfc06 [2025-01-09 12:08:38,762 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:08:38,772 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2025-01-09 12:08:38,803 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b68b7de0c/06f7022457584b84af99e542f04206ec/FLAGacf6cfc06 [2025-01-09 12:08:38,824 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/b68b7de0c/06f7022457584b84af99e542f04206ec [2025-01-09 12:08:38,827 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:08:38,828 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:08:38,829 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:08:38,829 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:08:38,832 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:08:38,833 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:08:38" (1/1) ... [2025-01-09 12:08:38,833 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b0a8f4a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:08:38, skipping insertion in model container [2025-01-09 12:08:38,833 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:08:38" (1/1) ... [2025-01-09 12:08:38,850 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:08:38,959 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-ps-co_file-66.i[919,932] [2025-01-09 12:08:39,013 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:08:39,022 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:08:39,030 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-ps-co_file-66.i[919,932] [2025-01-09 12:08:39,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:08:39,089 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:08:39,092 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:08:39 WrapperNode [2025-01-09 12:08:39,092 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:08:39,092 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:08:39,093 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:08:39,093 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:08:39,100 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:08:39" (1/1) ... [2025-01-09 12:08:39,111 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:08:39" (1/1) ... [2025-01-09 12:08:39,136 INFO L138 Inliner]: procedures = 26, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 183 [2025-01-09 12:08:39,136 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:08:39,137 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:08:39,137 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:08:39,137 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:08:39,149 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:08:39" (1/1) ... [2025-01-09 12:08:39,149 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:08:39" (1/1) ... [2025-01-09 12:08:39,151 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:08:39" (1/1) ... [2025-01-09 12:08:39,159 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 12:08:39,159 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:08:39" (1/1) ... [2025-01-09 12:08:39,159 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:08:39" (1/1) ... [2025-01-09 12:08:39,169 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:08:39" (1/1) ... [2025-01-09 12:08:39,170 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:08:39" (1/1) ... [2025-01-09 12:08:39,181 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:08:39" (1/1) ... [2025-01-09 12:08:39,188 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:08:39" (1/1) ... [2025-01-09 12:08:39,189 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:08:39" (1/1) ... [2025-01-09 12:08:39,194 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:08:39,195 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:08:39,195 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:08:39,195 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:08:39,196 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:08:39" (1/1) ... [2025-01-09 12:08:39,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:08:39,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:08:39,229 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 12:08:39,237 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 12:08:39,255 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:08:39,255 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:08:39,255 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:08:39,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-01-09 12:08:39,256 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:08:39,256 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:08:39,327 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:08:39,329 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:08:39,641 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 12:08:39,641 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:08:39,653 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:08:39,653 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:08:39,653 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:08:39 BoogieIcfgContainer [2025-01-09 12:08:39,653 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:08:39,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:08:39,657 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:08:39,661 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:08:39,661 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:08:38" (1/3) ... [2025-01-09 12:08:39,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c66b104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:08:39, skipping insertion in model container [2025-01-09 12:08:39,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:08:39" (2/3) ... [2025-01-09 12:08:39,662 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c66b104 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:08:39, skipping insertion in model container [2025-01-09 12:08:39,662 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:08:39" (3/3) ... [2025-01-09 12:08:39,664 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2025-01-09 12:08:39,675 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:08:39,678 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:08:39,737 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:08:39,745 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;@53edd73b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:08:39,746 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:08:39,749 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 12:08:39,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 12:08:39,761 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:08:39,762 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:08:39,762 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:08:39,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:08:39,767 INFO L85 PathProgramCache]: Analyzing trace with hash -761904437, now seen corresponding path program 1 times [2025-01-09 12:08:39,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:08:39,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116298231] [2025-01-09 12:08:39,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:08:39,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:08:39,858 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 12:08:39,877 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 12:08:39,880 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:08:39,880 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:08:40,090 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-01-09 12:08:40,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:08:40,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116298231] [2025-01-09 12:08:40,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116298231] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:08:40,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1932029002] [2025-01-09 12:08:40,092 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:08:40,093 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:08:40,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:08:40,096 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 12:08:40,100 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 12:08:40,178 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 12:08:40,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 12:08:40,236 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:08:40,236 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:08:40,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 383 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:08:40,243 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:08:40,275 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 1058 trivial. 0 not checked. [2025-01-09 12:08:40,275 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:08:40,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1932029002] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:08:40,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:08:40,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [2] total 2 [2025-01-09 12:08:40,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324520816] [2025-01-09 12:08:40,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:08:40,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:08:40,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:08:40,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:08:40,298 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:08:40,300 INFO L87 Difference]: Start difference. First operand has 84 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 12:08:40,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:08:40,316 INFO L93 Difference]: Finished difference Result 162 states and 283 transitions. [2025-01-09 12:08:40,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:08:40,317 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2025-01-09 12:08:40,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:08:40,322 INFO L225 Difference]: With dead ends: 162 [2025-01-09 12:08:40,322 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 12:08:40,324 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 162 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 12:08:40,326 INFO L435 NwaCegarLoop]: 127 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, 127 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 12:08:40,326 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:08:40,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 12:08:40,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-09 12:08:40,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 55 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 12:08:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 127 transitions. [2025-01-09 12:08:40,360 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 127 transitions. Word has length 161 [2025-01-09 12:08:40,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:08:40,360 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 127 transitions. [2025-01-09 12:08:40,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (24), 2 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 12:08:40,360 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 127 transitions. [2025-01-09 12:08:40,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 12:08:40,366 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:08:40,367 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:08:40,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-01-09 12:08:40,567 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 12:08:40,568 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:08:40,569 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:08:40,569 INFO L85 PathProgramCache]: Analyzing trace with hash -467270257, now seen corresponding path program 1 times [2025-01-09 12:08:40,569 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:08:40,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [969988712] [2025-01-09 12:08:40,569 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:08:40,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:08:40,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 12:08:40,627 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 12:08:40,627 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:08:40,627 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:08:40,772 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:08:40,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:08:40,772 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [969988712] [2025-01-09 12:08:40,772 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [969988712] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:08:40,772 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:08:40,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:08:40,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088201639] [2025-01-09 12:08:40,772 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:08:40,773 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:08:40,773 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:08:40,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:08:40,779 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:08:40,779 INFO L87 Difference]: Start difference. First operand 81 states and 127 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:08:40,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:08:40,853 INFO L93 Difference]: Finished difference Result 237 states and 375 transitions. [2025-01-09 12:08:40,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:08:40,853 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2025-01-09 12:08:40,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:08:40,855 INFO L225 Difference]: With dead ends: 237 [2025-01-09 12:08:40,855 INFO L226 Difference]: Without dead ends: 159 [2025-01-09 12:08:40,855 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 12:08:40,856 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 81 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:08:40,856 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 248 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:08:40,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-01-09 12:08:40,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2025-01-09 12:08:40,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 106 states have (on average 1.4433962264150944) internal successors, (153), 106 states have internal predecessors, (153), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 12:08:40,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 249 transitions. [2025-01-09 12:08:40,882 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 249 transitions. Word has length 161 [2025-01-09 12:08:40,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:08:40,883 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 249 transitions. [2025-01-09 12:08:40,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:08:40,883 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 249 transitions. [2025-01-09 12:08:40,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 12:08:40,884 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:08:40,885 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:08:40,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-01-09 12:08:40,885 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:08:40,885 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:08:40,885 INFO L85 PathProgramCache]: Analyzing trace with hash -44568431, now seen corresponding path program 1 times [2025-01-09 12:08:40,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:08:40,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557147164] [2025-01-09 12:08:40,886 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:08:40,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:08:40,902 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 12:08:40,958 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 12:08:40,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:08:40,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:08:41,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:08:41,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:08:41,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557147164] [2025-01-09 12:08:41,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557147164] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:08:41,218 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:08:41,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-01-09 12:08:41,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809360930] [2025-01-09 12:08:41,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:08:41,219 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-01-09 12:08:41,219 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:08:41,219 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-01-09 12:08:41,219 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-01-09 12:08:41,220 INFO L87 Difference]: Start difference. First operand 157 states and 249 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:08:41,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:08:41,551 INFO L93 Difference]: Finished difference Result 562 states and 899 transitions. [2025-01-09 12:08:41,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:08:41,552 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2025-01-09 12:08:41,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:08:41,555 INFO L225 Difference]: With dead ends: 562 [2025-01-09 12:08:41,555 INFO L226 Difference]: Without dead ends: 408 [2025-01-09 12:08:41,560 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:08:41,560 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 205 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-01-09 12:08:41,561 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 423 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-01-09 12:08:41,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 408 states. [2025-01-09 12:08:41,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 408 to 353. [2025-01-09 12:08:41,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 353 states, 227 states have (on average 1.3920704845814977) internal successors, (316), 227 states have internal predecessors, (316), 120 states have call successors, (120), 5 states have call predecessors, (120), 5 states have return successors, (120), 120 states have call predecessors, (120), 120 states have call successors, (120) [2025-01-09 12:08:41,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 353 states to 353 states and 556 transitions. [2025-01-09 12:08:41,601 INFO L78 Accepts]: Start accepts. Automaton has 353 states and 556 transitions. Word has length 161 [2025-01-09 12:08:41,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:08:41,601 INFO L471 AbstractCegarLoop]: Abstraction has 353 states and 556 transitions. [2025-01-09 12:08:41,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 4 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:08:41,602 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 556 transitions. [2025-01-09 12:08:41,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 12:08:41,606 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:08:41,606 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:08:41,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-01-09 12:08:41,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:08:41,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:08:41,607 INFO L85 PathProgramCache]: Analyzing trace with hash 1176919440, now seen corresponding path program 1 times [2025-01-09 12:08:41,607 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:08:41,607 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879132164] [2025-01-09 12:08:41,607 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:08:41,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:08:41,619 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 12:08:41,659 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 12:08:41,659 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:08:41,659 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:08:41,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:08:41,869 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:08:41,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879132164] [2025-01-09 12:08:41,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879132164] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:08:41,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:08:41,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:08:41,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1909440176] [2025-01-09 12:08:41,870 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:08:41,870 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:08:41,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:08:41,871 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:08:41,872 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:08:41,872 INFO L87 Difference]: Start difference. First operand 353 states and 556 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:08:41,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:08:41,953 INFO L93 Difference]: Finished difference Result 525 states and 834 transitions. [2025-01-09 12:08:41,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:08:41,954 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-01-09 12:08:41,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:08:41,956 INFO L225 Difference]: With dead ends: 525 [2025-01-09 12:08:41,958 INFO L226 Difference]: Without dead ends: 223 [2025-01-09 12:08:41,960 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 12:08:41,960 INFO L435 NwaCegarLoop]: 122 mSDtfsCounter, 59 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:08:41,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 221 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:08:41,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2025-01-09 12:08:41,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 205. [2025-01-09 12:08:41,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 205 states, 129 states have (on average 1.37984496124031) internal successors, (178), 129 states have internal predecessors, (178), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 12:08:41,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 205 states to 205 states and 322 transitions. [2025-01-09 12:08:41,993 INFO L78 Accepts]: Start accepts. Automaton has 205 states and 322 transitions. Word has length 162 [2025-01-09 12:08:41,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:08:41,994 INFO L471 AbstractCegarLoop]: Abstraction has 205 states and 322 transitions. [2025-01-09 12:08:41,994 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:08:41,994 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 322 transitions. [2025-01-09 12:08:41,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 12:08:41,995 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:08:41,995 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:08:41,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-01-09 12:08:41,996 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:08:41,996 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:08:41,996 INFO L85 PathProgramCache]: Analyzing trace with hash 1152384174, now seen corresponding path program 1 times [2025-01-09 12:08:41,996 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:08:41,996 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327199220] [2025-01-09 12:08:41,996 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:08:41,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:08:42,011 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 12:08:42,148 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 12:08:42,149 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:08:42,149 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:08:46,027 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:08:46,028 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:08:46,028 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327199220] [2025-01-09 12:08:46,028 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327199220] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:08:46,028 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:08:46,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 12:08:46,028 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049996618] [2025-01-09 12:08:46,028 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:08:46,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 12:08:46,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:08:46,029 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 12:08:46,029 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-01-09 12:08:46,029 INFO L87 Difference]: Start difference. First operand 205 states and 322 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:08:46,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:08:46,955 INFO L93 Difference]: Finished difference Result 545 states and 831 transitions. [2025-01-09 12:08:46,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 12:08:46,956 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-01-09 12:08:46,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:08:46,958 INFO L225 Difference]: With dead ends: 545 [2025-01-09 12:08:46,958 INFO L226 Difference]: Without dead ends: 391 [2025-01-09 12:08:46,959 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-01-09 12:08:46,959 INFO L435 NwaCegarLoop]: 113 mSDtfsCounter, 204 mSDsluCounter, 711 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 824 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:08:46,960 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 824 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 12:08:46,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2025-01-09 12:08:46,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 279. [2025-01-09 12:08:46,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 193 states have (on average 1.4093264248704662) internal successors, (272), 195 states have internal predecessors, (272), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 12:08:46,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 432 transitions. [2025-01-09 12:08:46,976 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 432 transitions. Word has length 162 [2025-01-09 12:08:46,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:08:46,977 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 432 transitions. [2025-01-09 12:08:46,977 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:08:46,977 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 432 transitions. [2025-01-09 12:08:46,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 12:08:46,978 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:08:46,978 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:08:46,978 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-01-09 12:08:46,979 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:08:46,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:08:46,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1154231216, now seen corresponding path program 1 times [2025-01-09 12:08:46,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:08:46,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973753968] [2025-01-09 12:08:46,979 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:08:46,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:08:46,989 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 12:08:47,031 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 12:08:47,032 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:08:47,032 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:08:51,380 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:08:51,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:08:51,380 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973753968] [2025-01-09 12:08:51,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973753968] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:08:51,380 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:08:51,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 12:08:51,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709586201] [2025-01-09 12:08:51,380 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:08:51,380 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 12:08:51,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:08:51,381 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 12:08:51,381 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:08:51,381 INFO L87 Difference]: Start difference. First operand 279 states and 432 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:08:52,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:08:52,420 INFO L93 Difference]: Finished difference Result 382 states and 561 transitions. [2025-01-09 12:08:52,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 12:08:52,420 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-01-09 12:08:52,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:08:52,427 INFO L225 Difference]: With dead ends: 382 [2025-01-09 12:08:52,429 INFO L226 Difference]: Without dead ends: 380 [2025-01-09 12:08:52,430 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-01-09 12:08:52,430 INFO L435 NwaCegarLoop]: 119 mSDtfsCounter, 186 mSDsluCounter, 693 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 812 SdHoareTripleChecker+Invalid, 463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:08:52,430 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 812 Invalid, 463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 12:08:52,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 380 states. [2025-01-09 12:08:52,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 380 to 279. [2025-01-09 12:08:52,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 193 states have (on average 1.4093264248704662) internal successors, (272), 195 states have internal predecessors, (272), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 12:08:52,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 432 transitions. [2025-01-09 12:08:52,450 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 432 transitions. Word has length 162 [2025-01-09 12:08:52,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:08:52,451 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 432 transitions. [2025-01-09 12:08:52,451 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:08:52,451 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 432 transitions. [2025-01-09 12:08:52,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 12:08:52,453 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:08:52,453 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:08:52,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-01-09 12:08:52,453 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:08:52,454 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:08:52,454 INFO L85 PathProgramCache]: Analyzing trace with hash 472325804, now seen corresponding path program 1 times [2025-01-09 12:08:52,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:08:52,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204573912] [2025-01-09 12:08:52,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:08:52,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:08:52,462 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 12:08:52,499 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 12:08:52,499 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:08:52,499 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:08:54,540 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:08:54,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:08:54,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204573912] [2025-01-09 12:08:54,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204573912] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:08:54,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:08:54,541 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 12:08:54,541 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255226981] [2025-01-09 12:08:54,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:08:54,541 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 12:08:54,541 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:08:54,542 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 12:08:54,543 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-01-09 12:08:54,543 INFO L87 Difference]: Start difference. First operand 279 states and 432 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:08:55,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:08:55,215 INFO L93 Difference]: Finished difference Result 389 states and 569 transitions. [2025-01-09 12:08:55,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-01-09 12:08:55,215 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-01-09 12:08:55,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:08:55,217 INFO L225 Difference]: With dead ends: 389 [2025-01-09 12:08:55,217 INFO L226 Difference]: Without dead ends: 387 [2025-01-09 12:08:55,218 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2025-01-09 12:08:55,218 INFO L435 NwaCegarLoop]: 118 mSDtfsCounter, 178 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 484 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 484 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 484 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:08:55,218 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 690 Invalid, 484 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 484 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 12:08:55,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2025-01-09 12:08:55,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 283. [2025-01-09 12:08:55,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 283 states, 197 states have (on average 1.4111675126903553) internal successors, (278), 199 states have internal predecessors, (278), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 12:08:55,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 283 states to 283 states and 438 transitions. [2025-01-09 12:08:55,233 INFO L78 Accepts]: Start accepts. Automaton has 283 states and 438 transitions. Word has length 162 [2025-01-09 12:08:55,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:08:55,233 INFO L471 AbstractCegarLoop]: Abstraction has 283 states and 438 transitions. [2025-01-09 12:08:55,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:08:55,233 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 438 transitions. [2025-01-09 12:08:55,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 12:08:55,234 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:08:55,234 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:08:55,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-01-09 12:08:55,235 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:08:55,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:08:55,235 INFO L85 PathProgramCache]: Analyzing trace with hash 474172846, now seen corresponding path program 1 times [2025-01-09 12:08:55,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:08:55,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318863173] [2025-01-09 12:08:55,235 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:08:55,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:08:55,242 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 12:08:55,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 12:08:55,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:08:55,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:08:58,966 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:08:58,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:08:58,967 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318863173] [2025-01-09 12:08:58,967 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318863173] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:08:58,967 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:08:58,967 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2025-01-09 12:08:58,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275864304] [2025-01-09 12:08:58,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:08:58,967 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-01-09 12:08:58,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:08:58,968 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-01-09 12:08:58,968 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=171, Unknown=0, NotChecked=0, Total=240 [2025-01-09 12:08:58,968 INFO L87 Difference]: Start difference. First operand 283 states and 438 transitions. Second operand has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:09:00,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:09:00,173 INFO L93 Difference]: Finished difference Result 387 states and 567 transitions. [2025-01-09 12:09:00,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-01-09 12:09:00,173 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-01-09 12:09:00,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:09:00,175 INFO L225 Difference]: With dead ends: 387 [2025-01-09 12:09:00,175 INFO L226 Difference]: Without dead ends: 385 [2025-01-09 12:09:00,176 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=91, Invalid=215, Unknown=0, NotChecked=0, Total=306 [2025-01-09 12:09:00,176 INFO L435 NwaCegarLoop]: 128 mSDtfsCounter, 172 mSDsluCounter, 717 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 845 SdHoareTripleChecker+Invalid, 592 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-01-09 12:09:00,176 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 845 Invalid, 592 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 592 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-01-09 12:09:00,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2025-01-09 12:09:00,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 279. [2025-01-09 12:09:00,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 193 states have (on average 1.4093264248704662) internal successors, (272), 195 states have internal predecessors, (272), 80 states have call successors, (80), 5 states have call predecessors, (80), 5 states have return successors, (80), 78 states have call predecessors, (80), 80 states have call successors, (80) [2025-01-09 12:09:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 432 transitions. [2025-01-09 12:09:00,203 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 432 transitions. Word has length 162 [2025-01-09 12:09:00,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:09:00,204 INFO L471 AbstractCegarLoop]: Abstraction has 279 states and 432 transitions. [2025-01-09 12:09:00,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.8125) internal successors, (45), 16 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:09:00,206 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 432 transitions. [2025-01-09 12:09:00,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 12:09:00,207 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:09:00,207 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:09:00,207 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-01-09 12:09:00,207 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:09:00,208 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:09:00,208 INFO L85 PathProgramCache]: Analyzing trace with hash 1410549612, now seen corresponding path program 1 times [2025-01-09 12:09:00,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:09:00,208 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240293658] [2025-01-09 12:09:00,208 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:09:00,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:09:00,248 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 12:09:00,255 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 12:09:00,256 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:09:00,256 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:09:00,283 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:09:00,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:09:00,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240293658] [2025-01-09 12:09:00,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240293658] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:09:00,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:09:00,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-01-09 12:09:00,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297018676] [2025-01-09 12:09:00,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:09:00,285 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:09:00,286 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:09:00,286 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:09:00,286 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:09:00,287 INFO L87 Difference]: Start difference. First operand 279 states and 432 transitions. Second operand has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:09:00,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:09:00,327 INFO L93 Difference]: Finished difference Result 639 states and 997 transitions. [2025-01-09 12:09:00,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:09:00,327 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-01-09 12:09:00,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:09:00,331 INFO L225 Difference]: With dead ends: 639 [2025-01-09 12:09:00,331 INFO L226 Difference]: Without dead ends: 411 [2025-01-09 12:09:00,332 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 12:09:00,334 INFO L435 NwaCegarLoop]: 226 mSDtfsCounter, 108 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-01-09 12:09:00,334 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 335 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:09:00,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 411 states. [2025-01-09 12:09:00,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 411 to 409. [2025-01-09 12:09:00,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 293 states have (on average 1.3651877133105803) internal successors, (400), 296 states have internal predecessors, (400), 108 states have call successors, (108), 7 states have call predecessors, (108), 7 states have return successors, (108), 105 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 12:09:00,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 616 transitions. [2025-01-09 12:09:00,358 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 616 transitions. Word has length 162 [2025-01-09 12:09:00,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:09:00,358 INFO L471 AbstractCegarLoop]: Abstraction has 409 states and 616 transitions. [2025-01-09 12:09:00,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.0) internal successors, (45), 3 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:09:00,359 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 616 transitions. [2025-01-09 12:09:00,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 12:09:00,360 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:09:00,360 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:09:00,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-01-09 12:09:00,360 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:09:00,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:09:00,361 INFO L85 PathProgramCache]: Analyzing trace with hash 601202986, now seen corresponding path program 1 times [2025-01-09 12:09:00,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:09:00,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1756702725] [2025-01-09 12:09:00,362 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:09:00,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:09:00,368 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 12:09:00,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 12:09:00,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:09:00,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:09:02,353 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:09:02,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:09:02,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1756702725] [2025-01-09 12:09:02,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1756702725] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:09:02,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:09:02,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2025-01-09 12:09:02,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891051445] [2025-01-09 12:09:02,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:09:02,355 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 12:09:02,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:09:02,355 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 12:09:02,356 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210 [2025-01-09 12:09:02,356 INFO L87 Difference]: Start difference. First operand 409 states and 616 transitions. Second operand has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-01-09 12:09:03,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:09:03,713 INFO L93 Difference]: Finished difference Result 637 states and 910 transitions. [2025-01-09 12:09:03,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 12:09:03,713 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) Word has length 162 [2025-01-09 12:09:03,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:09:03,716 INFO L225 Difference]: With dead ends: 637 [2025-01-09 12:09:03,716 INFO L226 Difference]: Without dead ends: 635 [2025-01-09 12:09:03,717 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=192, Invalid=408, Unknown=0, NotChecked=0, Total=600 [2025-01-09 12:09:03,717 INFO L435 NwaCegarLoop]: 126 mSDtfsCounter, 434 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 705 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 434 SdHoareTripleChecker+Valid, 772 SdHoareTripleChecker+Invalid, 781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-01-09 12:09:03,717 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [434 Valid, 772 Invalid, 781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 705 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-01-09 12:09:03,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2025-01-09 12:09:03,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 549. [2025-01-09 12:09:03,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 397 states have (on average 1.345088161209068) internal successors, (534), 402 states have internal predecessors, (534), 140 states have call successors, (140), 11 states have call predecessors, (140), 11 states have return successors, (140), 135 states have call predecessors, (140), 140 states have call successors, (140) [2025-01-09 12:09:03,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 814 transitions. [2025-01-09 12:09:03,751 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 814 transitions. Word has length 162 [2025-01-09 12:09:03,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:09:03,752 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 814 transitions. [2025-01-09 12:09:03,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.0) internal successors, (45), 15 states have internal predecessors, (45), 3 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 3 states have call predecessors, (24), 3 states have call successors, (24) [2025-01-09 12:09:03,752 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 814 transitions. [2025-01-09 12:09:03,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 12:09:03,754 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:09:03,754 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:09:03,754 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-01-09 12:09:03,755 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:09:03,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:09:03,755 INFO L85 PathProgramCache]: Analyzing trace with hash 603050028, now seen corresponding path program 1 times [2025-01-09 12:09:03,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:09:03,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475121537] [2025-01-09 12:09:03,755 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:09:03,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:09:03,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 12:09:03,796 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 12:09:03,796 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:09:03,796 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:09:06,142 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:09:06,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:09:06,143 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475121537] [2025-01-09 12:09:06,143 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475121537] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:09:06,143 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:09:06,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2025-01-09 12:09:06,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1071372072] [2025-01-09 12:09:06,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:09:06,143 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 12:09:06,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:09:06,143 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 12:09:06,144 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:09:06,144 INFO L87 Difference]: Start difference. First operand 549 states and 814 transitions. Second operand has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:09:07,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:09:07,522 INFO L93 Difference]: Finished difference Result 635 states and 908 transitions. [2025-01-09 12:09:07,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-01-09 12:09:07,523 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-01-09 12:09:07,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:09:07,528 INFO L225 Difference]: With dead ends: 635 [2025-01-09 12:09:07,529 INFO L226 Difference]: Without dead ends: 633 [2025-01-09 12:09:07,529 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=80, Invalid=130, Unknown=0, NotChecked=0, Total=210 [2025-01-09 12:09:07,530 INFO L435 NwaCegarLoop]: 144 mSDtfsCounter, 268 mSDsluCounter, 602 mSDsCounter, 0 mSdLazyCounter, 686 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 698 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 686 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-01-09 12:09:07,530 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [268 Valid, 746 Invalid, 698 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 686 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2025-01-09 12:09:07,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2025-01-09 12:09:07,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 549. [2025-01-09 12:09:07,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 397 states have (on average 1.345088161209068) internal successors, (534), 402 states have internal predecessors, (534), 140 states have call successors, (140), 11 states have call predecessors, (140), 11 states have return successors, (140), 135 states have call predecessors, (140), 140 states have call successors, (140) [2025-01-09 12:09:07,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 814 transitions. [2025-01-09 12:09:07,569 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 814 transitions. Word has length 162 [2025-01-09 12:09:07,569 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:09:07,569 INFO L471 AbstractCegarLoop]: Abstraction has 549 states and 814 transitions. [2025-01-09 12:09:07,569 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 3.4615384615384617) internal successors, (45), 13 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:09:07,570 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 814 transitions. [2025-01-09 12:09:07,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 12:09:07,571 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:09:07,571 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:09:07,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-01-09 12:09:07,572 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:09:07,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:09:07,572 INFO L85 PathProgramCache]: Analyzing trace with hash -78855384, now seen corresponding path program 1 times [2025-01-09 12:09:07,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:09:07,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1041323255] [2025-01-09 12:09:07,572 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:09:07,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:09:07,583 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 12:09:07,591 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 12:09:07,591 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:09:07,591 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:09:07,643 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:09:07,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:09:07,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1041323255] [2025-01-09 12:09:07,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1041323255] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:09:07,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:09:07,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:09:07,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475896406] [2025-01-09 12:09:07,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:09:07,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:09:07,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:09:07,645 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:09:07,645 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:09:07,645 INFO L87 Difference]: Start difference. First operand 549 states and 814 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:09:07,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:09:07,831 INFO L93 Difference]: Finished difference Result 1091 states and 1592 transitions. [2025-01-09 12:09:07,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:09:07,831 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 162 [2025-01-09 12:09:07,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:09:07,834 INFO L225 Difference]: With dead ends: 1091 [2025-01-09 12:09:07,834 INFO L226 Difference]: Without dead ends: 617 [2025-01-09 12:09:07,835 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:09:07,836 INFO L435 NwaCegarLoop]: 137 mSDtfsCounter, 88 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 211 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:09:07,836 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 383 Invalid, 211 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:09:07,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2025-01-09 12:09:07,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 576. [2025-01-09 12:09:07,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 418 states have (on average 1.3301435406698565) internal successors, (556), 424 states have internal predecessors, (556), 144 states have call successors, (144), 13 states have call predecessors, (144), 13 states have return successors, (144), 138 states have call predecessors, (144), 144 states have call successors, (144) [2025-01-09 12:09:07,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 844 transitions. [2025-01-09 12:09:07,869 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 844 transitions. Word has length 162 [2025-01-09 12:09:07,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:09:07,869 INFO L471 AbstractCegarLoop]: Abstraction has 576 states and 844 transitions. [2025-01-09 12:09:07,869 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:09:07,869 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 844 transitions. [2025-01-09 12:09:07,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 12:09:07,870 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:09:07,870 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:09:07,870 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-01-09 12:09:07,870 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:09:07,871 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:09:07,871 INFO L85 PathProgramCache]: Analyzing trace with hash 565578160, now seen corresponding path program 1 times [2025-01-09 12:09:07,871 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:09:07,871 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424322607] [2025-01-09 12:09:07,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:09:07,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:09:07,877 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 12:09:07,885 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 12:09:07,886 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:09:07,886 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:09:08,151 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:09:08,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:09:08,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424322607] [2025-01-09 12:09:08,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1424322607] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:09:08,151 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:09:08,151 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-01-09 12:09:08,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174309284] [2025-01-09 12:09:08,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:09:08,152 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-01-09 12:09:08,152 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:09:08,153 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-01-09 12:09:08,153 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-01-09 12:09:08,153 INFO L87 Difference]: Start difference. First operand 576 states and 844 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 12:09:08,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:09:08,401 INFO L93 Difference]: Finished difference Result 1088 states and 1578 transitions. [2025-01-09 12:09:08,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-01-09 12:09:08,401 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 162 [2025-01-09 12:09:08,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:09:08,404 INFO L225 Difference]: With dead ends: 1088 [2025-01-09 12:09:08,404 INFO L226 Difference]: Without dead ends: 585 [2025-01-09 12:09:08,405 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2025-01-09 12:09:08,406 INFO L435 NwaCegarLoop]: 133 mSDtfsCounter, 147 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 188 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-01-09 12:09:08,406 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 243 Invalid, 188 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-01-09 12:09:08,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2025-01-09 12:09:08,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 575. [2025-01-09 12:09:08,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 575 states, 408 states have (on average 1.2941176470588236) internal successors, (528), 414 states have internal predecessors, (528), 150 states have call successors, (150), 16 states have call predecessors, (150), 16 states have return successors, (150), 144 states have call predecessors, (150), 150 states have call successors, (150) [2025-01-09 12:09:08,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 575 states to 575 states and 828 transitions. [2025-01-09 12:09:08,438 INFO L78 Accepts]: Start accepts. Automaton has 575 states and 828 transitions. Word has length 162 [2025-01-09 12:09:08,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:09:08,438 INFO L471 AbstractCegarLoop]: Abstraction has 575 states and 828 transitions. [2025-01-09 12:09:08,438 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 5 states have internal predecessors, (45), 2 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 12:09:08,438 INFO L276 IsEmpty]: Start isEmpty. Operand 575 states and 828 transitions. [2025-01-09 12:09:08,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 12:09:08,439 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:09:08,439 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:09:08,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-01-09 12:09:08,439 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:09:08,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:09:08,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1558460370, now seen corresponding path program 1 times [2025-01-09 12:09:08,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:09:08,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263536065] [2025-01-09 12:09:08,440 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:09:08,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:09:08,446 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 12:09:08,461 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 12:09:08,462 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:09:08,462 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:09:08,534 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-01-09 12:09:08,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:09:08,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1263536065] [2025-01-09 12:09:08,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1263536065] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:09:08,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [594085687] [2025-01-09 12:09:08,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:09:08,536 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:09:08,536 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:09:08,539 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 12:09:08,540 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 12:09:08,588 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 12:09:08,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 12:09:08,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:09:08,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:09:08,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 387 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-01-09 12:09:08,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:09:08,844 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 365 proven. 12 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2025-01-09 12:09:08,845 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:09:09,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-01-09 12:09:09,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [594085687] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:09:09,049 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-01-09 12:09:09,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 6] total 13 [2025-01-09 12:09:09,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564966344] [2025-01-09 12:09:09,049 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-01-09 12:09:09,049 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-01-09 12:09:09,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:09:09,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-01-09 12:09:09,050 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-01-09 12:09:09,050 INFO L87 Difference]: Start difference. First operand 575 states and 828 transitions. Second operand has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 5 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 5 states have call predecessors, (72), 5 states have call successors, (72) [2025-01-09 12:09:09,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:09:09,608 INFO L93 Difference]: Finished difference Result 1529 states and 2182 transitions. [2025-01-09 12:09:09,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-01-09 12:09:09,608 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 5 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 5 states have call predecessors, (72), 5 states have call successors, (72) Word has length 163 [2025-01-09 12:09:09,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:09:09,613 INFO L225 Difference]: With dead ends: 1529 [2025-01-09 12:09:09,613 INFO L226 Difference]: Without dead ends: 1014 [2025-01-09 12:09:09,614 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 346 GetRequests, 320 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 182 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=228, Invalid=528, Unknown=0, NotChecked=0, Total=756 [2025-01-09 12:09:09,615 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 392 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 411 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 160 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-01-09 12:09:09,615 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [411 Valid, 392 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [160 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-01-09 12:09:09,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1014 states. [2025-01-09 12:09:09,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1014 to 892. [2025-01-09 12:09:09,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 624 states have (on average 1.2612179487179487) internal successors, (787), 638 states have internal predecessors, (787), 240 states have call successors, (240), 27 states have call predecessors, (240), 27 states have return successors, (240), 226 states have call predecessors, (240), 240 states have call successors, (240) [2025-01-09 12:09:09,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1267 transitions. [2025-01-09 12:09:09,693 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1267 transitions. Word has length 163 [2025-01-09 12:09:09,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:09:09,693 INFO L471 AbstractCegarLoop]: Abstraction has 892 states and 1267 transitions. [2025-01-09 12:09:09,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.153846153846154) internal successors, (93), 13 states have internal predecessors, (93), 5 states have call successors, (72), 3 states have call predecessors, (72), 6 states have return successors, (72), 5 states have call predecessors, (72), 5 states have call successors, (72) [2025-01-09 12:09:09,693 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1267 transitions. [2025-01-09 12:09:09,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 12:09:09,694 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:09:09,694 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:09:09,704 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 12:09:09,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:09:09,898 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:09:09,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:09:09,899 INFO L85 PathProgramCache]: Analyzing trace with hash 378488036, now seen corresponding path program 1 times [2025-01-09 12:09:09,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:09:09,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946926129] [2025-01-09 12:09:09,899 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:09:09,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:09:09,909 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 12:09:09,935 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 12:09:09,935 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:09:09,935 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:09:09,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2007629979] [2025-01-09 12:09:09,937 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:09:09,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:09:09,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:09:09,938 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 12:09:09,940 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 12:09:09,981 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 12:09:10,019 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 12:09:10,019 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:09:10,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:09:10,022 INFO L256 TraceCheckSpWp]: Trace formula consists of 390 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-01-09 12:09:10,026 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:09:11,096 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 625 proven. 132 refuted. 0 times theorem prover too weak. 347 trivial. 0 not checked. [2025-01-09 12:09:11,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:09:45,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-01-09 12:09:45,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946926129] [2025-01-09 12:09:45,158 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2025-01-09 12:09:45,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2007629979] [2025-01-09 12:09:45,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2007629979] provided 0 perfect and 1 imperfect interpolant sequences [2025-01-09 12:09:45,158 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2025-01-09 12:09:45,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2025-01-09 12:09:45,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441456246] [2025-01-09 12:09:45,159 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2025-01-09 12:09:45,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-01-09 12:09:45,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-01-09 12:09:45,161 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-01-09 12:09:45,161 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=267, Unknown=2, NotChecked=0, Total=342 [2025-01-09 12:09:45,161 INFO L87 Difference]: Start difference. First operand 892 states and 1267 transitions. Second operand has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 5 states have call successors, (24), 5 states have call predecessors, (24), 8 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) [2025-01-09 12:09:51,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:09:51,604 INFO L93 Difference]: Finished difference Result 1547 states and 2030 transitions. [2025-01-09 12:09:51,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-01-09 12:09:51,605 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 5 states have call successors, (24), 5 states have call predecessors, (24), 8 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) Word has length 164 [2025-01-09 12:09:51,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:09:51,609 INFO L225 Difference]: With dead ends: 1547 [2025-01-09 12:09:51,609 INFO L226 Difference]: Without dead ends: 1255 [2025-01-09 12:09:51,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 277 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=301, Invalid=1029, Unknown=2, NotChecked=0, Total=1332 [2025-01-09 12:09:51,612 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 156 mSDsluCounter, 529 mSDsCounter, 0 mSdLazyCounter, 736 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 632 SdHoareTripleChecker+Invalid, 777 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 736 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2025-01-09 12:09:51,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [165 Valid, 632 Invalid, 777 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 736 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2025-01-09 12:09:51,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1255 states. [2025-01-09 12:09:51,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1255 to 1026. [2025-01-09 12:09:51,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1026 states, 725 states have (on average 1.2165517241379311) internal successors, (882), 739 states have internal predecessors, (882), 236 states have call successors, (236), 64 states have call predecessors, (236), 64 states have return successors, (236), 222 states have call predecessors, (236), 236 states have call successors, (236) [2025-01-09 12:09:51,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1026 states to 1026 states and 1354 transitions. [2025-01-09 12:09:51,782 INFO L78 Accepts]: Start accepts. Automaton has 1026 states and 1354 transitions. Word has length 164 [2025-01-09 12:09:51,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:09:51,783 INFO L471 AbstractCegarLoop]: Abstraction has 1026 states and 1354 transitions. [2025-01-09 12:09:51,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 4.533333333333333) internal successors, (68), 15 states have internal predecessors, (68), 5 states have call successors, (24), 5 states have call predecessors, (24), 8 states have return successors, (24), 5 states have call predecessors, (24), 5 states have call successors, (24) [2025-01-09 12:09:51,783 INFO L276 IsEmpty]: Start isEmpty. Operand 1026 states and 1354 transitions. [2025-01-09 12:09:51,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2025-01-09 12:09:51,784 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:09:51,785 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:09:51,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-01-09 12:09:51,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:09:51,986 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:09:51,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:09:51,987 INFO L85 PathProgramCache]: Analyzing trace with hash 380335078, now seen corresponding path program 1 times [2025-01-09 12:09:51,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-01-09 12:09:51,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [162083892] [2025-01-09 12:09:51,987 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:09:51,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-01-09 12:09:51,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 12:09:52,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 12:09:52,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:09:52,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unknown [2025-01-09 12:09:52,058 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1731074477] [2025-01-09 12:09:52,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:09:52,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-01-09 12:09:52,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:09:52,062 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 12:09:52,069 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 12:09:52,115 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 12:09:52,157 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 12:09:52,157 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:09:52,157 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:09:52,157 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-01-09 12:09:52,173 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 164 statements into 1 equivalence classes. [2025-01-09 12:09:52,192 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 164 of 164 statements. [2025-01-09 12:09:52,193 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:09:52,193 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-01-09 12:09:52,265 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-01-09 12:09:52,266 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-01-09 12:09:52,267 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-01-09 12:09:52,275 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-01-09 12:09:52,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2025-01-09 12:09:52,471 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:09:52,575 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-01-09 12:09:52,577 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.01 12:09:52 BoogieIcfgContainer [2025-01-09 12:09:52,577 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-01-09 12:09:52,578 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-01-09 12:09:52,578 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-01-09 12:09:52,578 INFO L274 PluginConnector]: Witness Printer initialized [2025-01-09 12:09:52,579 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:08:39" (3/4) ... [2025-01-09 12:09:52,580 INFO L149 WitnessPrinter]: No result that supports witness generation found [2025-01-09 12:09:52,581 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-01-09 12:09:52,581 INFO L158 Benchmark]: Toolchain (without parser) took 73753.23ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 113.4MB in the beginning and 86.6MB in the end (delta: 26.8MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. [2025-01-09 12:09:52,581 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:09:52,582 INFO L158 Benchmark]: CACSL2BoogieTranslator took 263.08ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 98.4MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:09:52,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.66ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 95.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:09:52,582 INFO L158 Benchmark]: Boogie Preprocessor took 57.51ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 90.7MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-01-09 12:09:52,582 INFO L158 Benchmark]: RCFGBuilder took 458.51ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 66.8MB in the end (delta: 23.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-01-09 12:09:52,582 INFO L158 Benchmark]: TraceAbstraction took 72920.59ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 66.3MB in the beginning and 86.6MB in the end (delta: -20.3MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. [2025-01-09 12:09:52,583 INFO L158 Benchmark]: Witness Printer took 2.77ms. Allocated memory is still 167.8MB. Free memory was 86.6MB in the beginning and 86.6MB in the end (delta: 33.1kB). There was no memory consumed. Max. memory is 16.1GB. [2025-01-09 12:09:52,583 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.25ms. Allocated memory is still 201.3MB. Free memory is still 123.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 263.08ms. Allocated memory is still 142.6MB. Free memory was 113.4MB in the beginning and 98.4MB in the end (delta: 15.0MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.66ms. Allocated memory is still 142.6MB. Free memory was 98.4MB in the beginning and 95.5MB in the end (delta: 2.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.51ms. Allocated memory is still 142.6MB. Free memory was 95.5MB in the beginning and 90.7MB in the end (delta: 4.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 458.51ms. Allocated memory is still 142.6MB. Free memory was 90.7MB in the beginning and 66.8MB in the end (delta: 23.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 72920.59ms. Allocated memory was 142.6MB in the beginning and 167.8MB in the end (delta: 25.2MB). Free memory was 66.3MB in the beginning and 86.6MB in the end (delta: -20.3MB). Peak memory consumption was 9.2MB. Max. memory is 16.1GB. * Witness Printer took 2.77ms. Allocated memory is still 167.8MB. Free memory was 86.6MB in the beginning and 86.6MB in the end (delta: 33.1kB). 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 someUnaryDOUBLEoperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 176, overapproximation of someBinaryDOUBLEComparisonOperation at line 81, overapproximation of someBinaryDOUBLEComparisonOperation at line 174, overapproximation of someBinaryDOUBLEComparisonOperation at line 182. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed char var_1_1 = 50; [L23] signed char var_1_3 = 8; [L24] signed char var_1_4 = 10; [L25] double var_1_5 = 16.5; [L26] signed char var_1_6 = 64; [L27] signed char var_1_7 = 2; [L28] unsigned short int var_1_8 = 256; [L29] unsigned short int var_1_10 = 63583; [L30] unsigned short int var_1_11 = 33789; [L31] unsigned char var_1_12 = 1; [L32] unsigned char var_1_14 = 0; [L33] signed long int var_1_15 = 8; [L34] signed short int var_1_16 = -16; [L35] signed short int var_1_18 = 16; [L36] signed short int var_1_19 = 25; [L37] signed short int var_1_20 = 25; [L38] signed short int var_1_21 = 50; [L39] signed long int var_1_22 = -8; [L40] unsigned long int var_1_26 = 10; [L41] signed long int var_1_28 = -10000; [L42] signed long int var_1_29 = -1263929197; [L43] signed short int var_1_31 = 1; [L44] unsigned char var_1_36 = 32; [L45] unsigned char var_1_38 = 2; [L46] double var_1_39 = 3.6; [L47] double var_1_40 = 24.25; [L48] double var_1_41 = 31.25; [L49] unsigned long int var_1_42 = 10; [L50] unsigned char last_1_var_1_12 = 1; VAL [isInitial=0, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=8, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L186] isInitial = 1 [L187] FCALL initially() [L189] CALL updateLastVariables() [L179] last_1_var_1_12 = var_1_12 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=8, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L189] RET updateLastVariables() [L190] CALL updateVariables() [L140] var_1_3 = __VERIFIER_nondet_char() [L141] CALL assume_abort_if_not(var_1_3 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L141] RET assume_abort_if_not(var_1_3 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L142] CALL assume_abort_if_not(var_1_3 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L142] RET assume_abort_if_not(var_1_3 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=10, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L143] var_1_4 = __VERIFIER_nondet_char() [L144] CALL assume_abort_if_not(var_1_4 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L144] RET assume_abort_if_not(var_1_4 >= -63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L145] CALL assume_abort_if_not(var_1_4 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L145] RET assume_abort_if_not(var_1_4 <= 63) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=64, var_1_7=2, var_1_8=256] [L146] var_1_6 = __VERIFIER_nondet_char() [L147] CALL assume_abort_if_not(var_1_6 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L147] RET assume_abort_if_not(var_1_6 >= -1) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L148] CALL assume_abort_if_not(var_1_6 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L148] RET assume_abort_if_not(var_1_6 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=2, var_1_8=256] [L149] var_1_7 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L150] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L151] CALL assume_abort_if_not(var_1_7 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L151] RET assume_abort_if_not(var_1_7 <= 127) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=63583, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L152] var_1_10 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_10 >= 49150) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L153] RET assume_abort_if_not(var_1_10 >= 49150) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L154] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L154] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=33789, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L155] var_1_11 = __VERIFIER_nondet_ushort() [L156] CALL assume_abort_if_not(var_1_11 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L156] RET assume_abort_if_not(var_1_11 >= 32767) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L157] CALL assume_abort_if_not(var_1_11 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L157] RET assume_abort_if_not(var_1_11 <= 65534) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L158] var_1_14 = __VERIFIER_nondet_uchar() [L159] CALL assume_abort_if_not(var_1_14 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L159] RET assume_abort_if_not(var_1_14 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L160] CALL assume_abort_if_not(var_1_14 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L160] RET assume_abort_if_not(var_1_14 <= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=25, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L161] var_1_20 = __VERIFIER_nondet_short() [L162] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L162] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L163] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L163] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=50, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L164] var_1_21 = __VERIFIER_nondet_short() [L165] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L165] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L166] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L166] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1263929197, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L167] var_1_29 = __VERIFIER_nondet_long() [L168] CALL assume_abort_if_not(var_1_29 >= -2147483646) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L168] RET assume_abort_if_not(var_1_29 >= -2147483646) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L169] CALL assume_abort_if_not(var_1_29 <= -1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L169] RET assume_abort_if_not(var_1_29 <= -1073741823) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=2, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L170] var_1_38 = __VERIFIER_nondet_uchar() [L171] CALL assume_abort_if_not(var_1_38 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L171] RET assume_abort_if_not(var_1_38 >= 0) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L172] CALL assume_abort_if_not(var_1_38 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L172] RET assume_abort_if_not(var_1_38 <= 254) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-1, var_1_40=97/4, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L173] var_1_40 = __VERIFIER_nondet_double() [L174] CALL assume_abort_if_not((var_1_40 >= -922337.2036854765600e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-1, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-1, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L174] RET assume_abort_if_not((var_1_40 >= -922337.2036854765600e+13F && var_1_40 <= -1.0e-20F) || (var_1_40 <= 9223372.036854765600e+12F && var_1_40 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-1, var_1_41=125/4, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L175] var_1_41 = __VERIFIER_nondet_double() [L176] CALL assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-1, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-1, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L176] RET assume_abort_if_not((var_1_41 >= -922337.2036854765600e+13F && var_1_41 <= -1.0e-20F) || (var_1_41 <= 9223372.036854765600e+12F && var_1_41 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-1, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L190] RET updateVariables() [L191] CALL step() [L54] COND FALSE !(var_1_16 > var_1_18) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=10, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-1, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L59] var_1_26 = var_1_8 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=256, var_1_28=-10000, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-1, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L60] COND FALSE !(((((-256) < 0 ) ? -(-256) : (-256))) < var_1_19) [L63] var_1_28 = var_1_29 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-1, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L65] COND TRUE var_1_8 > var_1_18 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-1, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L66] COND TRUE var_1_29 < var_1_18 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=1, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-1, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L67] COND TRUE var_1_29 <= (-64 & var_1_19) [L68] var_1_31 = ((((var_1_1) > (((((8) < (var_1_1)) ? (8) : (var_1_1))))) ? (var_1_1) : (((((8) < (var_1_1)) ? (8) : (var_1_1)))))) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=32, var_1_38=0, var_1_39=18/5, var_1_3=-1, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L74] COND FALSE !(((((((((var_1_8) > (var_1_15)) ? (var_1_8) : (var_1_15)))) > (var_1_1)) ? (((((var_1_8) > (var_1_15)) ? (var_1_8) : (var_1_15)))) : (var_1_1))) > var_1_8) [L79] var_1_36 = var_1_38 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=18/5, var_1_3=-1, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L81] var_1_39 = ((((((((var_1_40) < 0 ) ? -(var_1_40) : (var_1_40)))) > (((((var_1_41) < (100.75)) ? (var_1_41) : (100.75))))) ? (((((var_1_40) < 0 ) ? -(var_1_40) : (var_1_40)))) : (((((var_1_41) < (100.75)) ? (var_1_41) : (100.75)))))) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-1, var_1_40=0, var_1_41=0, var_1_42=10, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L82] COND FALSE !(var_1_8 <= (~ ((((var_1_1) < (var_1_1)) ? (var_1_1) : (var_1_1))))) [L93] var_1_42 = var_1_38 VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-1, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L95] signed char stepLocal_1 = var_1_6; [L96] unsigned char stepLocal_0 = last_1_var_1_12; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_1=-1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-1, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=256] [L97] COND FALSE !(-25 == stepLocal_1) [L102] var_1_8 = ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-1, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=32767] [L104] signed char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_2=127, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-1, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=32767] [L105] COND TRUE var_1_8 >= stepLocal_2 [L106] var_1_12 = (! var_1_14) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=50, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-1, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=32767] [L108] COND TRUE \read(var_1_12) [L109] var_1_1 = (var_1_3 + var_1_4) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-1, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-1, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=32767] [L111] COND TRUE var_1_4 >= (var_1_6 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-1, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-1, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=0, var_1_5=33/2, var_1_6=-1, var_1_7=127, var_1_8=32767] [L112] COND TRUE \read(var_1_12) [L113] var_1_5 = 8.25 VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-1, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-1, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=0, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=32767] [L116] signed char stepLocal_4 = var_1_6; VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_4=-1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=16, var_1_19=25, var_1_1=-1, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-1, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=0, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=32767] [L117] COND FALSE !(var_1_1 < stepLocal_4) [L120] var_1_18 = (((((var_1_6 + var_1_4)) < (var_1_1)) ? ((var_1_6 + var_1_4)) : (var_1_1))) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-1, var_1_19=25, var_1_1=-1, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-1, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=0, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=32767] [L122] COND TRUE \read(var_1_12) [L123] var_1_19 = ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=8, var_1_16=-16, var_1_18=-1, var_1_19=-64, var_1_1=-1, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-1, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=0, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=32767] [L125] COND TRUE -64 > (var_1_6 + var_1_19) [L126] var_1_15 = (var_1_11 - var_1_7) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-1, var_1_19=-64, var_1_1=-1, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-1, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=0, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=32767] [L134] signed long int stepLocal_3 = ((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10); VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, stepLocal_3=32767, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-1, var_1_19=-64, var_1_1=-1, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-1, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=0, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=32767] [L135] COND FALSE !(var_1_19 > stepLocal_3) VAL [isInitial=1, last_1_var_1_12=1, stepLocal_0=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-1, var_1_19=-64, var_1_1=-1, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-1, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=0, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=32767] [L191] RET step() [L192] CALL, EXPR property() [L182-L183] return (((((((var_1_12 ? (var_1_1 == ((signed char) (var_1_3 + var_1_4))) : 1) && ((var_1_4 >= (var_1_6 - var_1_7)) ? (var_1_12 ? (var_1_5 == ((double) 8.25)) : 1) : 1)) && ((-25 == var_1_6) ? ((last_1_var_1_12 && last_1_var_1_12) ? (var_1_8 == ((unsigned short int) ((((((var_1_10 - 10) - 16)) > ((var_1_11 - var_1_7))) ? (((var_1_10 - 10) - 16)) : ((var_1_11 - var_1_7)))))) : 1) : (var_1_8 == ((unsigned short int) ((((var_1_7) > (var_1_11)) ? (var_1_7) : (var_1_11))))))) && ((var_1_8 >= var_1_7) ? (var_1_12 == ((unsigned char) (! var_1_14))) : 1)) && ((-64 > (var_1_6 + var_1_19)) ? (var_1_15 == ((signed long int) (var_1_11 - var_1_7))) : ((! var_1_12) ? (var_1_12 ? (var_1_15 == ((signed long int) 4)) : 1) : 1))) && ((var_1_19 > (((((var_1_11) > (var_1_18)) ? (var_1_11) : (var_1_18))) + (var_1_15 / var_1_10))) ? (var_1_16 == ((signed short int) var_1_4)) : 1)) && ((var_1_1 < var_1_6) ? (var_1_18 == ((signed short int) (var_1_6 - var_1_7))) : (var_1_18 == ((signed short int) (((((var_1_6 + var_1_4)) < (var_1_1)) ? ((var_1_6 + var_1_4)) : (var_1_1))))))) && (var_1_12 ? (var_1_19 == ((signed short int) ((var_1_7 - ((((var_1_20) < (var_1_21)) ? (var_1_20) : (var_1_21)))) + var_1_6))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-1, var_1_19=-64, var_1_1=-1, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-1, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=0, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=32767] [L192] RET, EXPR property() [L192] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-1, var_1_19=-64, var_1_1=-1, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-1, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=0, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=32767] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=1, var_1_10=49150, var_1_11=32767, var_1_12=1, var_1_14=0, var_1_15=32640, var_1_16=-16, var_1_18=-1, var_1_19=-64, var_1_1=-1, var_1_20=190, var_1_21=190, var_1_22=-8, var_1_26=256, var_1_28=-1073741823, var_1_29=-1073741823, var_1_31=50, var_1_36=0, var_1_38=0, var_1_39=2, var_1_3=-1, var_1_40=0, var_1_41=0, var_1_42=0, var_1_4=0, var_1_5=33/4, var_1_6=-1, var_1_7=127, var_1_8=32767] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 84 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 72.8s, OverallIterations: 16, TraceHistogramMax: 24, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 14.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2706 SdHoareTripleChecker+Valid, 8.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2678 mSDsluCounter, 7693 SdHoareTripleChecker+Invalid, 8.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5664 mSDsCounter, 344 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5263 IncrementalHoareTripleChecker+Invalid, 5607 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 344 mSolverCounterUnsat, 2029 mSDtfsCounter, 5263 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 870 GetRequests, 695 SyntacticMatches, 0 SemanticMatches, 175 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 616 ImplicationChecksByTransitivity, 19.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1026occurred in iteration=15, InterpolantAutomatonStates: 168, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 1072 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 55.1s InterpolantComputationTime, 3246 NumberOfCodeBlocks, 3246 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2899 ConstructedInterpolants, 1 QuantifiedInterpolants, 16972 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1160 ConjunctsInSsa, 30 ConjunctsInUnsatCore, 18 InterpolantComputations, 13 PerfectInterpolantSequences, 19658/19872 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 12:09:52,794 WARN L435 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forcibly destroying the process [2025-01-09 12:09:52,866 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 137 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-ps-co_file-66.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 ee1d4ab2254e09ab1c7ffa7d0c8fe840fd7239014a5c1c2ca5c976023f5a71b5 --- Real Ultimate output --- This is Ultimate 0.3.0-?-551b009-m [2025-01-09 12:09:54,733 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-01-09 12:09:54,813 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2025-01-09 12:09:54,819 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-01-09 12:09:54,819 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-01-09 12:09:54,853 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-01-09 12:09:54,855 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-01-09 12:09:54,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-01-09 12:09:54,864 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-01-09 12:09:54,864 INFO L153 SettingsManager]: * Use memory slicer=true [2025-01-09 12:09:54,864 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-01-09 12:09:54,864 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-01-09 12:09:54,864 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-01-09 12:09:54,864 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-01-09 12:09:54,864 INFO L153 SettingsManager]: * Use SBE=true [2025-01-09 12:09:54,865 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-01-09 12:09:54,865 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-01-09 12:09:54,865 INFO L153 SettingsManager]: * sizeof long=4 [2025-01-09 12:09:54,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-01-09 12:09:54,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-01-09 12:09:54,865 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-01-09 12:09:54,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-01-09 12:09:54,865 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-01-09 12:09:54,865 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-01-09 12:09:54,865 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2025-01-09 12:09:54,865 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2025-01-09 12:09:54,865 INFO L153 SettingsManager]: * sizeof long double=12 [2025-01-09 12:09:54,865 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-01-09 12:09:54,865 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-01-09 12:09:54,865 INFO L153 SettingsManager]: * Use constant arrays=true [2025-01-09 12:09:54,865 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-01-09 12:09:54,865 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:09:54,865 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:09:54,865 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:09:54,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:09:54,866 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-01-09 12:09:54,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-01-09 12:09:54,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-01-09 12:09:54,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-01-09 12:09:54,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:09:54,866 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-01-09 12:09:54,866 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-01-09 12:09:54,866 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-01-09 12:09:54,866 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-01-09 12:09:54,866 INFO L153 SettingsManager]: * Trace refinement strategy=FOX [2025-01-09 12:09:54,866 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2025-01-09 12:09:54,866 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-01-09 12:09:54,866 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-01-09 12:09:54,866 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-01-09 12:09:54,872 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-01-09 12:09:54,872 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 -> ee1d4ab2254e09ab1c7ffa7d0c8fe840fd7239014a5c1c2ca5c976023f5a71b5 [2025-01-09 12:09:55,115 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-01-09 12:09:55,130 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-01-09 12:09:55,131 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-01-09 12:09:55,132 INFO L270 PluginConnector]: Initializing CDTParser... [2025-01-09 12:09:55,132 INFO L274 PluginConnector]: CDTParser initialized [2025-01-09 12:09:55,137 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-ps-co_file-66.i [2025-01-09 12:09:56,319 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a990c4c4/8d8ddd3d21954dd581d9058b77e7997c/FLAG7f0b2a6ab [2025-01-09 12:09:56,577 INFO L384 CDTParser]: Found 1 translation units. [2025-01-09 12:09:56,578 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2025-01-09 12:09:56,587 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a990c4c4/8d8ddd3d21954dd581d9058b77e7997c/FLAG7f0b2a6ab [2025-01-09 12:09:56,881 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/9a990c4c4/8d8ddd3d21954dd581d9058b77e7997c [2025-01-09 12:09:56,883 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-01-09 12:09:56,884 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-01-09 12:09:56,885 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-01-09 12:09:56,885 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-01-09 12:09:56,888 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-01-09 12:09:56,889 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:09:56" (1/1) ... [2025-01-09 12:09:56,890 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3abfd80 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:56, skipping insertion in model container [2025-01-09 12:09:56,890 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.01 12:09:56" (1/1) ... [2025-01-09 12:09:56,909 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-01-09 12:09:57,008 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-ps-co_file-66.i[919,932] [2025-01-09 12:09:57,050 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:09:57,059 INFO L200 MainTranslator]: Completed pre-run [2025-01-09 12:09:57,066 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-ps-co_file-66.i[919,932] [2025-01-09 12:09:57,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-01-09 12:09:57,098 INFO L204 MainTranslator]: Completed translation [2025-01-09 12:09:57,098 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:57 WrapperNode [2025-01-09 12:09:57,098 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-01-09 12:09:57,099 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-01-09 12:09:57,099 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-01-09 12:09:57,099 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-01-09 12:09:57,103 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:57" (1/1) ... [2025-01-09 12:09:57,109 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:57" (1/1) ... [2025-01-09 12:09:57,130 INFO L138 Inliner]: procedures = 27, calls = 37, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 176 [2025-01-09 12:09:57,130 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-01-09 12:09:57,131 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-01-09 12:09:57,131 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-01-09 12:09:57,131 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-01-09 12:09:57,138 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:57" (1/1) ... [2025-01-09 12:09:57,138 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:57" (1/1) ... [2025-01-09 12:09:57,140 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:57" (1/1) ... [2025-01-09 12:09:57,154 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 12:09:57,154 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:57" (1/1) ... [2025-01-09 12:09:57,154 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:57" (1/1) ... [2025-01-09 12:09:57,163 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:57" (1/1) ... [2025-01-09 12:09:57,163 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:57" (1/1) ... [2025-01-09 12:09:57,165 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:57" (1/1) ... [2025-01-09 12:09:57,166 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:57" (1/1) ... [2025-01-09 12:09:57,167 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:57" (1/1) ... [2025-01-09 12:09:57,169 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-01-09 12:09:57,169 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-01-09 12:09:57,169 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-01-09 12:09:57,169 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-01-09 12:09:57,170 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:57" (1/1) ... [2025-01-09 12:09:57,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-01-09 12:09:57,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-01-09 12:09:57,191 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 12:09:57,193 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 12:09:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-01-09 12:09:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2025-01-09 12:09:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2025-01-09 12:09:57,207 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2025-01-09 12:09:57,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-01-09 12:09:57,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-01-09 12:09:57,274 INFO L234 CfgBuilder]: Building ICFG [2025-01-09 12:09:57,275 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-01-09 12:09:57,630 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2025-01-09 12:09:57,630 INFO L283 CfgBuilder]: Performing block encoding [2025-01-09 12:09:57,645 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-01-09 12:09:57,647 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2025-01-09 12:09:57,648 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:09:57 BoogieIcfgContainer [2025-01-09 12:09:57,648 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-01-09 12:09:57,650 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-01-09 12:09:57,650 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-01-09 12:09:57,654 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-01-09 12:09:57,654 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.01 12:09:56" (1/3) ... [2025-01-09 12:09:57,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78426c2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:09:57, skipping insertion in model container [2025-01-09 12:09:57,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.01 12:09:57" (2/3) ... [2025-01-09 12:09:57,655 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78426c2b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.01 12:09:57, skipping insertion in model container [2025-01-09 12:09:57,655 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.01 12:09:57" (3/3) ... [2025-01-09 12:09:57,656 INFO L128 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i [2025-01-09 12:09:57,667 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-01-09 12:09:57,668 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG hardness_fillercode_fillercodestructure_filler-ps-co_file-66.i that has 2 procedures, 84 locations, 1 initial locations, 1 loop locations, and 1 error locations. [2025-01-09 12:09:57,729 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-01-09 12:09:57,741 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;@668d2157, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-01-09 12:09:57,741 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-01-09 12:09:57,744 INFO L276 IsEmpty]: Start isEmpty. Operand has 84 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 12:09:57,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 12:09:57,753 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:09:57,754 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:09:57,754 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:09:57,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:09:57,760 INFO L85 PathProgramCache]: Analyzing trace with hash -761904437, now seen corresponding path program 1 times [2025-01-09 12:09:57,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:09:57,771 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [899002143] [2025-01-09 12:09:57,771 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:09:57,771 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2025-01-09 12:09:57,772 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:09:57,773 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 12:09:57,775 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 12:09:57,855 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 12:09:57,965 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 12:09:57,965 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:09:57,965 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:09:57,972 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 1 conjuncts are in the unsatisfiable core [2025-01-09 12:09:57,982 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:09:58,023 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 610 trivial. 0 not checked. [2025-01-09 12:09:58,024 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:09:58,024 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:09:58,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [899002143] [2025-01-09 12:09:58,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [899002143] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:09:58,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:09:58,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:09:58,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [24101305] [2025-01-09 12:09:58,027 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:09:58,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-01-09 12:09:58,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:09:58,042 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-01-09 12:09:58,043 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-01-09 12:09:58,044 INFO L87 Difference]: Start difference. First operand has 84 states, 57 states have (on average 1.4736842105263157) internal successors, (84), 58 states have internal predecessors, (84), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 12:09:58,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:09:58,062 INFO L93 Difference]: Finished difference Result 162 states and 283 transitions. [2025-01-09 12:09:58,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-01-09 12:09:58,063 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 161 [2025-01-09 12:09:58,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:09:58,071 INFO L225 Difference]: With dead ends: 162 [2025-01-09 12:09:58,072 INFO L226 Difference]: Without dead ends: 81 [2025-01-09 12:09:58,074 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 160 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 12:09:58,076 INFO L435 NwaCegarLoop]: 127 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, 127 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 12:09:58,076 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-01-09 12:09:58,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-01-09 12:09:58,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-01-09 12:09:58,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 55 states have internal predecessors, (79), 24 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2025-01-09 12:09:58,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 127 transitions. [2025-01-09 12:09:58,106 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 127 transitions. Word has length 161 [2025-01-09 12:09:58,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:09:58,107 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 127 transitions. [2025-01-09 12:09:58,107 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (24), 2 states have call predecessors, (24), 2 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2025-01-09 12:09:58,107 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 127 transitions. [2025-01-09 12:09:58,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 12:09:58,109 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:09:58,109 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:09:58,115 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 (2)] Ended with exit code 0 [2025-01-09 12:09:58,313 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 12:09:58,313 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:09:58,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:09:58,314 INFO L85 PathProgramCache]: Analyzing trace with hash -467270257, now seen corresponding path program 1 times [2025-01-09 12:09:58,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:09:58,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [951196499] [2025-01-09 12:09:58,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:09:58,314 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 12:09:58,315 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:09:58,316 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 12:09:58,319 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 12:09:58,416 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 12:09:58,518 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 12:09:58,518 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:09:58,518 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:09:58,524 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-01-09 12:09:58,534 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:09:58,815 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:09:58,815 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:09:58,815 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:09:58,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [951196499] [2025-01-09 12:09:58,816 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [951196499] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:09:58,816 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:09:58,816 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:09:58,816 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022916143] [2025-01-09 12:09:58,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:09:58,817 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:09:58,817 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:09:58,818 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:09:58,818 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:09:58,818 INFO L87 Difference]: Start difference. First operand 81 states and 127 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:09:58,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:09:58,892 INFO L93 Difference]: Finished difference Result 237 states and 375 transitions. [2025-01-09 12:09:58,892 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:09:58,892 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2025-01-09 12:09:58,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:09:58,894 INFO L225 Difference]: With dead ends: 237 [2025-01-09 12:09:58,894 INFO L226 Difference]: Without dead ends: 159 [2025-01-09 12:09:58,895 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 159 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 12:09:58,896 INFO L435 NwaCegarLoop]: 134 mSDtfsCounter, 54 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:09:58,896 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 248 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:09:58,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-01-09 12:09:58,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2025-01-09 12:09:58,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 106 states have (on average 1.4433962264150944) internal successors, (153), 106 states have internal predecessors, (153), 48 states have call successors, (48), 2 states have call predecessors, (48), 2 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2025-01-09 12:09:58,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 249 transitions. [2025-01-09 12:09:58,919 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 249 transitions. Word has length 161 [2025-01-09 12:09:58,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:09:58,919 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 249 transitions. [2025-01-09 12:09:58,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:09:58,920 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 249 transitions. [2025-01-09 12:09:58,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2025-01-09 12:09:58,921 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:09:58,921 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:09:58,928 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 12:09:59,122 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 12:09:59,123 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:09:59,126 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:09:59,126 INFO L85 PathProgramCache]: Analyzing trace with hash -44568431, now seen corresponding path program 1 times [2025-01-09 12:09:59,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:09:59,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [434298476] [2025-01-09 12:09:59,127 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:09:59,127 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 12:09:59,127 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:09:59,129 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 12:09:59,131 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 12:09:59,184 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 161 statements into 1 equivalence classes. [2025-01-09 12:09:59,272 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 161 of 161 statements. [2025-01-09 12:09:59,272 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:09:59,272 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:09:59,278 INFO L256 TraceCheckSpWp]: Trace formula consists of 264 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-01-09 12:09:59,284 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:09:59,876 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1104 trivial. 0 not checked. [2025-01-09 12:09:59,876 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-01-09 12:09:59,876 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:09:59,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [434298476] [2025-01-09 12:09:59,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [434298476] provided 1 perfect and 0 imperfect interpolant sequences [2025-01-09 12:09:59,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-01-09 12:09:59,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-01-09 12:09:59,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282209265] [2025-01-09 12:09:59,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-01-09 12:09:59,877 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-01-09 12:09:59,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:09:59,877 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-01-09 12:09:59,877 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-01-09 12:09:59,877 INFO L87 Difference]: Start difference. First operand 157 states and 249 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:09:59,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:09:59,974 INFO L93 Difference]: Finished difference Result 375 states and 597 transitions. [2025-01-09 12:09:59,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-01-09 12:09:59,974 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) Word has length 161 [2025-01-09 12:09:59,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:09:59,976 INFO L225 Difference]: With dead ends: 375 [2025-01-09 12:09:59,976 INFO L226 Difference]: Without dead ends: 221 [2025-01-09 12:09:59,977 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 159 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 12:09:59,977 INFO L435 NwaCegarLoop]: 127 mSDtfsCounter, 25 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-01-09 12:09:59,977 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 226 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-01-09 12:09:59,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2025-01-09 12:10:00,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 216. [2025-01-09 12:10:00,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 216 states, 140 states have (on average 1.3857142857142857) internal successors, (194), 140 states have internal predecessors, (194), 72 states have call successors, (72), 3 states have call predecessors, (72), 3 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2025-01-09 12:10:00,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 216 states to 216 states and 338 transitions. [2025-01-09 12:10:00,008 INFO L78 Accepts]: Start accepts. Automaton has 216 states and 338 transitions. Word has length 161 [2025-01-09 12:10:00,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:10:00,009 INFO L471 AbstractCegarLoop]: Abstraction has 216 states and 338 transitions. [2025-01-09 12:10:00,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 2 states have internal predecessors, (44), 1 states have call successors, (24), 1 states have call predecessors, (24), 1 states have return successors, (24), 1 states have call predecessors, (24), 1 states have call successors, (24) [2025-01-09 12:10:00,009 INFO L276 IsEmpty]: Start isEmpty. Operand 216 states and 338 transitions. [2025-01-09 12:10:00,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2025-01-09 12:10:00,012 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:10:00,013 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:10:00,023 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 (4)] Ended with exit code 0 [2025-01-09 12:10:00,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /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 12:10:00,214 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:10:00,214 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:10:00,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1152384174, now seen corresponding path program 1 times [2025-01-09 12:10:00,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:10:00,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [313023345] [2025-01-09 12:10:00,217 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:10:00,217 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 12:10:00,217 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:10:00,219 INFO L229 MonitoredProcess]: Starting monitored process 5 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 12:10:00,221 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 (5)] Waiting until timeout for monitored process [2025-01-09 12:10:00,259 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 162 statements into 1 equivalence classes. [2025-01-09 12:10:00,340 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 162 of 162 statements. [2025-01-09 12:10:00,340 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:10:00,340 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:10:00,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-01-09 12:10:00,348 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:10:00,598 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 365 proven. 12 refuted. 0 times theorem prover too weak. 727 trivial. 0 not checked. [2025-01-09 12:10:00,598 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-01-09 12:10:00,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 57 proven. 12 refuted. 0 times theorem prover too weak. 1035 trivial. 0 not checked. [2025-01-09 12:10:00,752 INFO L136 FreeRefinementEngine]: Strategy FOX found an infeasible trace [2025-01-09 12:10:00,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [313023345] [2025-01-09 12:10:00,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [313023345] provided 0 perfect and 2 imperfect interpolant sequences [2025-01-09 12:10:00,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-01-09 12:10:00,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2025-01-09 12:10:00,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809711309] [2025-01-09 12:10:00,753 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-01-09 12:10:00,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-01-09 12:10:00,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FOX [2025-01-09 12:10:00,754 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-01-09 12:10:00,754 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2025-01-09 12:10:00,754 INFO L87 Difference]: Start difference. First operand 216 states and 338 transitions. Second operand has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 4 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2025-01-09 12:10:01,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-01-09 12:10:01,464 INFO L93 Difference]: Finished difference Result 485 states and 750 transitions. [2025-01-09 12:10:01,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-01-09 12:10:01,465 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 4 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) Word has length 162 [2025-01-09 12:10:01,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-01-09 12:10:01,467 INFO L225 Difference]: With dead ends: 485 [2025-01-09 12:10:01,468 INFO L226 Difference]: Without dead ends: 322 [2025-01-09 12:10:01,468 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 315 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=109, Unknown=0, NotChecked=0, Total=182 [2025-01-09 12:10:01,470 INFO L435 NwaCegarLoop]: 87 mSDtfsCounter, 285 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 321 mSolverCounterSat, 102 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 102 IncrementalHoareTripleChecker+Valid, 321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-01-09 12:10:01,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 313 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [102 Valid, 321 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-01-09 12:10:01,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 322 states. [2025-01-09 12:10:01,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 322 to 310. [2025-01-09 12:10:01,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 195 states have (on average 1.3384615384615384) internal successors, (261), 197 states have internal predecessors, (261), 108 states have call successors, (108), 6 states have call predecessors, (108), 6 states have return successors, (108), 106 states have call predecessors, (108), 108 states have call successors, (108) [2025-01-09 12:10:01,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 477 transitions. [2025-01-09 12:10:01,512 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 477 transitions. Word has length 162 [2025-01-09 12:10:01,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-01-09 12:10:01,513 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 477 transitions. [2025-01-09 12:10:01,513 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.88888888888889) internal successors, (80), 9 states have internal predecessors, (80), 4 states have call successors, (48), 3 states have call predecessors, (48), 5 states have return successors, (48), 4 states have call predecessors, (48), 4 states have call successors, (48) [2025-01-09 12:10:01,514 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 477 transitions. [2025-01-09 12:10:01,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2025-01-09 12:10:01,516 INFO L210 NwaCegarLoop]: Found error trace [2025-01-09 12:10:01,517 INFO L218 NwaCegarLoop]: trace histogram [24, 24, 24, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-01-09 12:10:01,524 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 (5)] Ended with exit code 0 [2025-01-09 12:10:01,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /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 12:10:01,721 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-01-09 12:10:01,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-01-09 12:10:01,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1379531428, now seen corresponding path program 1 times [2025-01-09 12:10:01,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy FOX [2025-01-09 12:10:01,723 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1947597916] [2025-01-09 12:10:01,723 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-01-09 12:10:01,723 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 12:10:01,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/mathsat [2025-01-09 12:10:01,727 INFO L229 MonitoredProcess]: Starting monitored process 6 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 12:10:01,729 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 (6)] Waiting until timeout for monitored process [2025-01-09 12:10:01,780 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 163 statements into 1 equivalence classes. [2025-01-09 12:10:01,878 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 163 of 163 statements. [2025-01-09 12:10:01,879 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-01-09 12:10:01,879 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-01-09 12:10:01,884 INFO L256 TraceCheckSpWp]: Trace formula consists of 267 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-01-09 12:10:01,890 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-01-09 12:10:03,155 INFO L134 CoverageAnalysis]: Checked inductivity of 1104 backedges. 616 proven. 132 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2025-01-09 12:10:03,156 INFO L312 TraceCheckSpWp]: Computing backward predicates...